CCIC: Consistent Common Itemsets Classifier
We propose a novel approach which extracts consistent (100% confident) rules and builds a classifier with them. Recently, associative classifiers which utilize association rules have been widely studied. Indeed, the associative classifiers often outperform the traditional classifiers. In this case, it is important to collect high quality (association) rules. Many algorithms find only high support rules, because decreasing the minimum support to be satisfied is computationally demanding. However, it may be effective to collect low support but high confidence rules. Therefore, we propose an algorithm that produces a wide variety of 100% confident rules including low support rules. To achieve this goal, we adopt a specific-to-general rule searching strategy, in contrast to the previous many approaches. Our experimental results show that the proposed method achieves higher accuracies in several datasets taken from UCI machine learning repository.
KeywordsAssociation Rule Positive Instance Negative Instance Common Item Transaction Database
Unable to display preview. Download preview PDF.
- 1.Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Knowledge Discovery and Data Mining, pp. 80–86 (1998)Google Scholar
- 2.Li, W., Han, J., Pei, J.: CMAR: accurate and efficient classification based on multipleclass-association rules. In: ICDM 2001. Proceedings on IEEE International Conference on Data Mining, pp. 369–376. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
- 3.Yin, X., Han, J.: CPAR: Classification based on predictive association rules. In: SDM 2003. 3rd SIAM International Conference on Data Mining (2003)Google Scholar
- 4.Zaiane, O.R., Antonie, M.-L.: Classifying text documents by associating terms with text categories. In: Proceedings of the 13th Australasian database conference, pp. 215–222 (2002)Google Scholar
- 6.Dong, G., Zhang, X., Wong, L., Li, J.: CAEP: Classification by aggregating emerging patterns. Discovery Science, 30–42 (1999)Google Scholar
- 7.Quinlan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)Google Scholar
- 8.Cohen, W.W.: Fast effective rule induction. In: Proceedings of the 12th International Conference on Machine Learning, pp. 115–123 (1995)Google Scholar
- 9.Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB. Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499 (1994)Google Scholar
- 12.Kudo, M., Shimbo, M.: Analysis of the structure of classes and its applications – subclass approach. Current Topics in Pattern Recognition Research 1, 69–81 (1994)Google Scholar
- 13.Murphy, P.H., Aha, D.W.: UCI repository of machine learning databases. http://www.ics.uci.edu/mlearn/MLRepository.html
- 14.Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: Jagadish, H.V., Mumick, I.S. (eds.) Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, 4–6 1996, pp. 1–12. ACM Press, New York (1996)CrossRefGoogle Scholar