An efficient discovery method of patterns from transactions with their classes

This paper deals with transactions with their classes. The classes represent the difference of conditions in the data collection. This paper redefines two kinds of supports: characteristic support and possible support. The former one is based on specific classes assigned to specific patterns. The latter one is based on the minimum class in the classes. This paper proposes a new method that efficiently discovers characteristic patterns based on the supports. Also, this paper verifies the effect of the method through numerical experiments based on the data registered in UCI machine learning repository.

[1]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[2]  Tadeusz Morzy,et al.  Group Bitmap Index: A Structure for Association Rules Retrieval , 1998, KDD.

[3]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[4]  Roberto J. Bayardo,et al.  Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[5]  Ada Wai-Chee Fu,et al.  Mining association rules with weighted items , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[6]  Xifeng Yan,et al.  CloSpan: Mining Closed Sequential Patterns in Large Datasets , 2003, SDM.

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

[8]  Zhi-Hong Deng,et al.  Mining Top-Rank-K Frequent Patterns , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[9]  Bruno Crémilleux,et al.  Treatment of Missing Values for Association Rules , 1998, PAKDD.

[10]  Ryohei Orihara,et al.  Discovery of Association Rules from Data including Missing Values , 2009, 2009 International Conference on Complex, Intelligent and Software Intensive Systems.

[11]  Toon Calders,et al.  Mining itemsets in the presence of missing values , 2007, SAC '07.