Abstract
In this paper, we present experiments evaluating Association Rule Classification algorithms on on-line and off-line recommender tasks of the CLEF NewsReel 2014 Challenge. The second focus of the experimental evaluation is to investigate possible performance optimizations of the Classification Based on Associations algorithm. Our findings indicate that pruning steps in CBA reduce the number of association rules substantially while not affecting accuracy. Using only part of the data employed for the rule learning phase in the pruning phase may also reduce training time while not affecting accuracy significantly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. SIGMOD Rec. 22(2), 207–216 (1993)
Coenen, F., Leng, P., Ahmed, S.: Data structure for association rule mining: T-trees and p-trees. IEEE Transactions on Knowledge and Data Engineering 16(6), 774–778 (2004)
Cohen, W.W.: Fast effective rule induction. In: Proceedings of the 12th International Conference on Machine Learning, ML’95, pp. 115–123. Morgan Kaufmann, Lake Tahoe (1995)
Fürnkranz, J.: FOSSIL: a robust relational learner. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS, vol. 784, pp. 122–137. Springer, Heidelberg (1994)
Fürnkranz, J., Gamberger, D., Lavrač, N.: Foundations of Rule Learning. Springer (2012)
Hahsler, M., Grün, B., Hornik, K.: Arules - a computational environment for mining association rules and frequent item sets. Journal of Statistical Software 14(15), 1–25 (2005)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. SIGMOD Rec. 29(2), 1–12 (2000)
Kille, B., Hopfgartner, F., Brodt, T., Heintz, T.: The plista dataset. In: Proceedings of the International Workshop and Challenge on News Recommender Systems, NRS’13, pp. 14–22. ACM, October 2013
Li, W., Han, J., Pei, J.: CMAR: accurate and efficient classification based on multiple class-association rules. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) The 2001 IEEE International Conference on Data Mining (ICDM’01), pp. 369–376. IEEE Computer Society (2001)
Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD’98), pp. 80–86. AAAI Press, August 1998
Moghimipour, I. Ebrahimpour, M.: Comparing decision tree method over three data mining software. International Journal of Statistics and Probability 3(3) (2014)
Quinlan, J.: Induction of decision trees. Machine Learning 1(1), 81–106 (1986)
Quinlan, J.R.: Learning logical definitions from relations. Machine Learning 5(3), 239–266 (1990)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann (1993)
Vanhoof, K., Depaire, B.: Structure of association rule classifiers: a review. In: International Conference on Intelligent Systems and Knowledge Engineering (ISKE), pp. 9–12, November 2010
Yin, X., Han, J.: CPAR: classification based on predictive association rules. In: Proceedings of the SIAM International Conference on Data Mining, pp. 369–376. SIAM Press, San Franciso (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kliegr, T., Kuchař, J. (2015). Benchmark of Rule-Based Classifiers in the News Recommendation Task. In: Mothe, J., et al. Experimental IR Meets Multilinguality, Multimodality, and Interaction. CLEF 2015. Lecture Notes in Computer Science(), vol 9283. Springer, Cham. https://doi.org/10.1007/978-3-319-24027-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-24027-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24026-8
Online ISBN: 978-3-319-24027-5
eBook Packages: Computer ScienceComputer Science (R0)