Mining association rules from imprecise ordinal data

Categorical data can generally be classified into ordinal data and nominal data. Although there have been numerous studies on finding association rules from nominal data, few have tried to do so from ordinal data. Additionally, previous mining algorithms usually assume that the input data is precise and clean, which is unrealistic in practical situations. Real-world data tends to be imprecise due to human errors, instrument errors, recording errors, and so on. Therefore, this paper proposes a new approach to discovering association rules from imprecise ordinal data. Experimental results from the survey data show the feasibility of the proposed mining algorithm. Performance analyses of the algorithms also show that the proposed approach can discover interesting and valuable rules that could never be found using the conventional approach, the Apriori algorithm.

[1]  Yi-Chung Hu,et al.  Elicitation of classification rules by fuzzy data mining , 2003 .

[2]  Yen-Liang Chen,et al.  Discovering fuzzy time-interval sequential patterns in sequence databases , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Robert L. Grossman,et al.  Mining Web pages for data records , 2004, IEEE Intelligent Systems.

[4]  Tsau Young Lin,et al.  A fast association rule algorithm based on bitmap and granular computing , 2003, The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03..

[5]  Chun-Lang Chang.  A study of applying data mining to early intervention for developmentally-delayed children , 2007, Expert Syst. Appl..

[6]  Renée J. Miller,et al.  Association rules over interval data , 1997, SIGMOD '97.

[7]  Yen-Liang Chen,et al.  Mining generalized knowledge from ordered data through attribute-oriented induction techniques , 2005, Eur. J. Oper. Res..

[8]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[9]  Jiah-Shing Chen,et al.  Mining inter-organizational retailing knowledge for an alliance formed by competitive firms , 2003, Inf. Manag..

[10]  Ulrich Güntzer,et al.  Algorithms for association rule mining — a general survey and comparison , 2000, SKDD.

[11]  Christoph F. Eick,et al.  Using clustering to learn distance functions for supervised similarity assessment , 2005, Eng. Appl. Artif. Intell..

[12]  Tzung-Pei Hong,et al.  Mining fuzzy sequential patterns from quantitative data , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[13]  Ping-Yu Hsu,et al.  Algorithms for mining association rules in bag databases , 2004, Inf. Sci..

[14]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[15]  Soon Myoung Chung,et al.  Mining association rules using inverted hashing and pruning , 2002, Inf. Process. Lett..

[16]  Yen-Liang Chen,et al.  Market basket analysis in a multiple store environment , 2005, Decis. Support Syst..

[17]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[18]  Xindong Wu,et al.  Database classification for multi-database mining , 2005, Inf. Syst..

[19]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[20]  Yi-Chung Hu,et al.  Discovering fuzzy association rules using fuzzy partition methods , 2003, Knowl. Based Syst..

[21]  Yen-Liang Chen,et al.  A new approach for discovering fuzzy quantitative sequential patterns in sequence databases , 2006, Fuzzy Sets Syst..

[22]  Tsau Young Lin,et al.  Foundations of Data Mining and knowledge Discovery , 2005, Studies in Computational Intelligence.

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

[24]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[25]  Keun Ho Ryu,et al.  Mining association rules on significant rare data using relative support , 2003, J. Syst. Softw..

[26]  David Wai-Lok Cheung,et al.  Efficient Mining of Association Rules in Distributed Databases , 1996, IEEE Trans. Knowl. Data Eng..

[27]  Supriya Kumar De,et al.  Clustering web transactions using rough approximation , 2004, Fuzzy Sets Syst..

[28]  Tzung-Pei Hong,et al.  Fuzzy data mining for interesting generalized association rules , 2003, Fuzzy Sets Syst..

[29]  Tzung-Pei Hong,et al.  A fuzzy AprioriTid mining algorithm with reduced computational time , 2004, Appl. Soft Comput..

[30]  Le Gruenwald,et al.  Microarray gene expression data association rules mining based on BSC-tree and FIS-tree , 2005, Data Knowl. Eng..

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

[32]  Ramakrishnan Srikant,et al.  Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.

[33]  Yen-Liang Chen,et al.  A Sampling-Based Method for Mining Frequent Patterns from Databases , 2005, FSKD.

[34]  Jan Rauch,et al.  An Alternative Approach to Mining Association Rules , 2005, Foundations of Data Mining and knowledge Discovery.

[35]  Michael J. A. Berry,et al.  Data mining techniques - for marketing, sales, and customer support , 1997, Wiley computer publishing.

[36]  Aura Conci,et al.  Image mining by content , 2002, Expert Syst. Appl..

[37]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.

[38]  Kyuseok Shim,et al.  Mining optimized support rules for numeric attributes , 2001, Inf. Syst..

[39]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

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