Mining Ordering Rules Using Rough Set Theory

Many real world problems deal with ordering of objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter. Examples of such problems are ordering of consumer products produced by different manufactures, ranking of universities, and so on. Typically, an overall ordering of objects is given. In this paper, we formulate the problem of mining ordering rules as finding association between orderings of attribute values and the overall ordering of objects. An example of ordering rules may state that “if the value of an object x on an attribute a is ordered ahead of the value of another object y on the same attribute, then x is ordered ahead of y”. For mining ordering rules, the notion of information tables is generalized to ordered information tables by adding order relations on attribute values, and rough set theory based algorithms are then used.

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

[2]  Yiyu Yao,et al.  Information tables with neighborhood semantics , 2000, SPIE Defense + Commercial Sensing.

[3]  T. B. Iwinski.  ordinal information systems. II , 1991 .

[4]  Zdzislaw Pawlak,et al.  Information systems theoretical foundations , 1981, Inf. Syst..

[5]  Yiyu Yao,et al.  Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..

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

[7]  Dimitar P. Filev,et al.  Fuzzy SETS AND FUZZY LOGIC , 1996 .

[8]  Yiyu Yao,et al.  Granular computing using information tables , 2002 .

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

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

[11]  Shusaku Tsumoto,et al.  Modelling Medical Diagnostic Rules Based on Rough Sets , 1998, Rough Sets and Current Trends in Computing.

[12]  Tsau Young Lin,et al.  A Review of Rough Set Models , 1997 .

[13]  T. B. Iwinski,et al.  Ordinal information systems, I , 1988 .

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

[15]  George J. Klir,et al.  Fuzzy sets and fuzzy logic - theory and applications , 1995 .

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

[17]  Zdzislaw Pawlak,et al.  Rough classification , 1984, Int. J. Hum. Comput. Stud..

[18]  Y. Yao,et al.  Generalized Rough Set Models , 1998 .

[19]  Jiawei Han,et al.  Data-Driven Discovery of Quantitative Rules in Relational Databases , 1993, IEEE Trans. Knowl. Data Eng..

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

[21]  Roman Słowiński,et al.  The Use of Rough Sets and Fuzzy Sets in MCDM , 1999 .

[22]  Yiyu Yao.  Measuring retrieval effectiveness based on user preference of documents , 1995 .

[23]  Aleksander Øhrn,et al.  Discernibility and Rough Sets in Medicine: Tools and Applications , 2000 .

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

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

[26]  A. Wasilewska,et al.  Conditional knowledge representation systems -model for an implementation , 1989 .

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

[28]  S.K.M. Wong,et al.  On data and probabilistic dependencies , 1999, Engineering Solutions for the Next Millennium. 1999 IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.99TH8411).