Patent · US Expired

Mining of generalized disjunctive association rules

US6754651B2 · kind B2 · utility

21Cited by
10References
42Claims
0Family size

Assignee

Inventors

Key dates

Filing dateApr 17, 2001
Grant dateJun 22, 2004
Priority date—
Expiry dateDec 24, 2021

Classification

  • Technology area (CPC Y)Emerging Cross-Sectional Technologies
  • CPC primaryY10S707/99945
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

The present invention provides a system and a method for mining a new kind of association rules called disjunctive association rules, where the antecedent or the consequent of a rule may contain disjuncts of terms (X<CUSTOM-CHARACTER FILE="US06754651-20040622-P00900.TIF" ALT="custom character" HE="20" WI="20" ID="CUSTOM-CHARACTER-00001"/>Y or X&#8853;Y). Such rules are a natural generalisation to the kind of rules that have been mined hitherto. Furthermore, disjunctive association rules are generalised in the sense that the algorithm also mines rules which have disjunctions of conjuncts (C<CUSTOM-CHARACTER FILE="US06754651-20040622-P00901.TIF" ALT="custom character" HE="20" WI="20" ID="CUSTOM-CHARACTER-00002"/>(A<CUSTOM-CHARACTER FILE="US06754651-20040622-P00902.TIF" ALT="custom character" HE="20" WI="20" ID="CUSTOM-CHARACTER-00003"/>B)<CUSTOM-CHARACTER FILE="US06754651-20040622-P00900.TIF" ALT="custom character" HE="20" WI="20" ID="CUSTOM-CHARACTER-00004"/>(D<CUSTOM-CHARACTER FILE="US06754651-20040622-P00902.TIF" ALT="custom character" HE="20" WI="20" ID="CUSTOM-CHARACTER-00005"/>E)). Since the number of combinations of disjuncts is explosive, we use clustering to find a generaliz…

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.