论文信息 - Semantics oriented association rules

Semantics oriented association rules

It is well known that relational theory carries very little semantic. To mine deeper semantics, additional modeling is necessary. In fact, some "pure" association rules are found to exist even in randomly generated data. We consider a relational database in which every attribute value has some additional information, such as price, fuzzy degree, neighborhood, or security compartment and levels. Two types of additions are considered: one is structure added, the other is valued-added. Somewhat a surprise, the additional cost in semantics checking is found to be very well compensated by the pruning of non-semantic rules.

Tsau Young Lin | Eric Louie

[1] Tsau Young Lin,et al. Association Rules with Additional Semantics Modeled by Binary Relations , 2003 .

[2] Tsau Young Lin,et al. Value Added Association Rules , 2002, PAKDD.

[3] Tsau Young Lin,et al. Data Mining and Machine Oriented Modeling: A Granular Computing Approach , 2000, Applied Intelligence.

[4] Tsau Young Lin,et al. Data Mining: Granular Computing Approach , 1999, PAKDD.

[5] Eric Louie,et al. Data mining approach using machine-oriented modeling: finding association rules using canonical names , 2000, SPIE Defense + Commercial Sensing.

[6] Balaji Padmanabhan,et al. Finding unexpected patterns in data , 2002 .

[7] Tsau Young Lin,et al. Finding Association Rules Using Fast Bit Computation: Machine-Oriented Modeling , 2000, ISMIS.

[8] T. Y. Lin,et al. Neighborhood systems and relational databases , 1988, CSC '88.

[9] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[10] T. Lin. Rough set theory in very large databases , 1996 .