By Topic

Data analysis and mining in ordered information tables

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ying Sai ; Dept. of Comput. Sci., Regina Univ., Sask., Canada ; Y. Y. Yao ; Ning Zhong

Many real-world problems deal with ordering objects instead of classifying objects, although the majority of the research in machine learning and data mining has been focused on the latter. For the modeling of ordering problems, we generalize the notion of information tables to ordered information tables by adding order relations on attribute values. The problem of mining ordering rules is formulated as finding associations between the orderings of attribute values and the overall ordering of objects. An ordering rule may state, for example, 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, we first transform an ordered information table into binary information, and then apply any standard machine learning and data mining algorithms. As an illustration, we analyze in detail the Maclean's university ranking for the year 2000

Published in:

Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on

Date of Conference: