Mining Association Rules with Rough Sets

We say that there is an association between two sets of items when the sets are likely to occur together in transactions. In information retrieval, an association between two keyword sets means that they co-occur in a record or document. In databases, an association is a rule latent in the databases whereby an attribute set can be inferred from another. Generally, the number of associations may be large, so we look for those that are particularly strong. Maximal association rules were introduced by [3, 4], and there is only one maximal association. Rough set theory has been used successfully for data mining. By using this theory, rules that are similar to maximal associations can be found. However, we show that the rough set approach to discovering knowledge is much simpler than the maximal association method.

[1]  David A. Bell,et al.  Discovering Motifs in DNA Sequences , 2004, Fundam. Informaticae.

[2]  Do Phuc,et al.  Discovering Motiv Based Association Rules in a Set of DNA Sequences , 2000, Rough Sets and Current Trends in Computing.

[3]  David A. Bell,et al.  Data Mining for Motifs in DNA Sequences , 2003, RSFDGrC.

[4]  Yehuda Lindell,et al.  Text Mining at the Term Level , 1998, PKDD.

[5]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[6]  David A. Bell,et al.  Computational Methods for Rough Classification and Discovery , 1998, J. Am. Soc. Inf. Sci..

[7]  Gregory Piatetsky-Shapiro,et al.  Knowledge Discovery in Databases: An Overview , 1992, AI Mag..

[8]  Yonatan Aumann,et al.  Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections , 1997, KDD.

[9]  J. W. Guan,et al.  Discovering frequent patterns in sequence groups , 2004 .

[10]  David A. Bell,et al.  The rough set approach to association rule mining , 2003, Third IEEE International Conference on Data Mining.

[11]  Yehuda Lindell,et al.  TextVis: An Integrated Visual Environment for Text Mining , 1998, PKDD.

[12]  Yonatan Aumann,et al.  Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections , 1998, PKDD.

[13]  D. A. Bell,et al.  Rough Computational Methods for Information , 1998, Artif. Intell..

[14]  David A. Bell,et al.  Discovering Maximal Frequent Patterns in Sequence Groups , 2004, Rough Sets and Current Trends in Computing.

[15]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.