Abstract
The paper presents two approaches to post-processing of association rules that are used for concept description. The first approach is based on the idea of meta-learning; a subsequent association rule mining step is applied to the results of ”standard” association rule mining. We thus obtain ”rules about rules” that in a condensed form represent the knowledge found using association rules generated in the first step. The second approach finds a ”core” part of the association rules that can be used to derive the confidence of every rule created in the first step. Again, the core part is substantially smaller than the set of all association rules. We experimentally evaluate the proposed methods on some benchmark data taken from the UCI repository. The system LISp-Miner has been used to carry out the experiments.
This is a preview of subscription content, log in via an institution to check access.
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
An, A., Khan, S., Huang, X.: Objective and Subjective Algorithms for Grouping Association Rules. In: Third IEEE Conference on Data Mining (ICDM 2003), pp. 477–480 (2003)
Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: SIGMOD Conference, pp. 207–216 (1993)
Baesens, B., Viaene, S., Vanthienen, J.: Post-processing of association rules. In: The Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000), Boston, Massachusetts (2000)
Bauer, E., Kohavi, R.: An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants. Machine Learning 36(1/2), 105–139 (1999)
Berka, P., Ivánek, J.: Automated Knowledge Acquisition for PROSPECTOR-like Expert Systems. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS (LNAI), vol. 784, pp. 339–342. Springer, Heidelberg (1994)
Berka, P.: Learning compositional decision rules using the KEX algorithm. Intelligent Data Analysis 16(4), 665–681 (2012)
Berka, P., Rauch, J.: Meta-learning for Post-processing of Association Rules. In: Bach Pedersen, T., Mohania, M.K., Tjoa, A.M. (eds.) DAWAK 2010. LNCS, vol. 6263, pp. 251–262. Springer, Heidelberg (2010)
Duda, R.O., Gasching, J.E.: Model design in the Prospector consultant system for mineral exploration. In: Michie, D. (ed.) Expert Systems in the Micro Electronic Age. Edinburgh University Press, UK (1979)
Chapman, P., Clinton, J., Kerber, R., Khabaza, T., Reinartz, T., Shearer, C., Wirth, R.: CRISP-DM 1.0 Step-by-step data mining guide. SPSS Inc. (2000)
Domingues, M.A., Rezende, S.O.: Using Taxonomies to Faciliate the Analysis of the Association Rules. In: Second International Workshop on Knowledge Discovery and Ontologies (KDO 2005), ECML/PKDD, Porto (2005)
Hájek, P., Havránek, T.: Mechanising Hypothesis Formation – Mathematical Foundations for a General Theory. Springer (1978)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. ACM-SIGMOD Int. Conf. on Management of Data (2000)
Jorge, A., Poas, J., Azevedo, P.J.: Post-processing Operators for Browsing Large Sets of Association Rules. Discovery Science, 414–421 (2002)
The LISp-Miner Project, http://lispminer.vse.cz/
Rauch, J.: Logic of association rules. Applied Intelligence 22, 9–28 (2005)
Rauch, J., Šimuånek, M.: An Alternative Approach to Mining Association Rules. In: Lin, T.Y., Ohsuga, S., Liau, C.J., Tsumoto, S. (eds.) Foundations of Data Mining and knowledge Discovery. SCI, vol. 6, pp. 211–231. Springer, Heidelberg (2005)
Sigal, S.: Exploring interestingness through clustering. In: Proc. of the IEEE Int. Conf. on Data Mining (ICDM 2002). Maebashi City (2002)
Šimuånek, M.: Academic KDD Project LISp-Miner. In: Abraham, A., Franke, K., Koppen, K. (eds.) Advances in Soft Computing Intelligent Systems Design and Applications, pp. 263–272. Springer, Heidelberg (2003)
Toivonen, H., Klementinen, M., Roikainen, P., Hatonen, K., Mannila, H.: Pruning and grouping discovered association rules. In: Workshop Notes of the ECML 1995 Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases, Heraklion, pp.47–52 (1995)
UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berka, P. (2013). Towards Comprehensive Concept Description Based on Association Rules. In: Tucker, A., Höppner, F., Siebes, A., Swift, S. (eds) Advances in Intelligent Data Analysis XII. IDA 2013. Lecture Notes in Computer Science, vol 8207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41398-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-41398-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41397-1
Online ISBN: 978-3-642-41398-8
eBook Packages: Computer ScienceComputer Science (R0)