Mining High Order Decision Rules

We introduce the notion of high order decision rules. While a standard decision rule expresses connections between attribute values of the same object, a high order decision rule expresses connections of different objects in terms of their attribute values. An example of high order decision rules may state that “if an object x is related to another object y with respect to an attribute a, then x is related to y with respect to another attribute b.” The problem of mining high order decision rules is formulated as a process of finding connections of objects as expressed in terms of their attribute values. In order to mine high order decision rules, we use relationships between values of attributes. Various types of relationships can be used, such as ordering relations, closeness relations, similarity relations, and neighborhood systems on attribute values. The introduction of semantics information on attribute values leads to information tables with added semantics. Depending on the decision rules to be mined, one can transform the original table into another information table, in which each new entity is a pair of objects. Any standard data mining algorithm can then be used. As an example to illustrate the basic idea, we discuss in detail the mining of ordering rules.

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

[2]  Alberto Maria Segre,et al.  Programs for Machine Learning , 1994 .

[3]  Z. Pawlak,et al.  Rough set approach to multi-attribute decision analysis , 1994 .

[4]  Siegfried Bell.  Discovery and Maintenance of Functional Dependencies by Independencies , 1995, KDD.

[5]  Yiyu Yao,et al.  Measuring Retrieval Effectiveness Based on User Preference of Documents , 1995, J. Am. Soc. Inf. Sci..

[6]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

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

[8]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[9]  Lech Polkowski,et al.  Rough Sets in Knowledge Discovery 2 , 1998 .

[10]  Salvatore Greco,et al.  Rough approximation of a preference relation by dominance relations , 1999, Eur. J. Oper. Res..

[11]  Shusaku Tsumoto.  Automated Discovery of Plausible Rules Based on Rough Sets and Rough Inclusion , 1999, PAKDD.

[12]  Yiyu Yao,et al.  An Analysis of Quantitative Measures Associated with Rules , 1999, PAKDD.

[13]  Roman Słowiński,et al.  Extension Of The Rough Set Approach To Multicriteria Decision Support , 2000 .

[14]  Yiyu Yao,et al.  On Association, Similarity and Dependency of Attributes , 2000, PAKDD.

[15]  Yiyu Yao,et al.  On modeling data mining with granular computing , 2001, 25th Annual International Computer Software and Applications Conference. COMPSAC 2001.

[16]  Ivo Düntsch,et al.  Rough approximation quality revisited , 2001, Artif. Intell..

[17]  Yiyu Yao,et al.  Data analysis and mining in ordered information tables , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[18]  Y. Yao,et al.  Information-Theoretic Measures for Knowledge Discovery and Data Mining , 2003 .