Abstract
Data mining is the efficient discovery of patterns in large databases, and classification rules are perhaps the most important type of patterns in data mining applications. However, the number of such classification rules is generally very big that selection of interesting ones among all discovered rules becomes an important task. In this paper, factors related to the interestingness of a rule are investigated and some new factors are proposed. Following this, an interactive rule interestingness-learning algorithm (IRIL) is developed to automatically label the classification rules either as “interesting” or “uninteresting” with limited user participation. In our study, VFP (Voting Feature Projections), a feature projection based incremental classification learning algorithm, is also developed in the framework of IRIL. The concept description learned by the VFP algorithm constitutes a novel hybrid approach for interestingness analysis of classification rules.
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
Frawely, W.J., Piatetsky-Shapiro, G., Matheus, C.J.: Knowledge discovery in databases: an overview. In: Knowledge Discovery in Databases, pp. 1–27. MIT Press, Cambridge (1991)
Major, J.A., Mangano, J.J.: Selecting among rules induced from a hurricane database. In: Proceedings of AAAI Workshop on Knowledge Discovery in Databases, pp. 30–31. AAAI, Menlo Park (1993)
Piatetsky-Shapiro, G., Matheus, C.J.: The interestingness of deviations. In: Proceedings of AAAI Workshop on Knowledge Discovery in Databases, pp. 25–36. AAAI, Menlo Park (1994)
Fayyad, U., Shapiro, G., Smyth, P.: From data mining to knowledge discovery in databases. AI Magazine 17(3), 37–54 (1996)
Hilderman, R.J., Hamilton, H.J.: Knowledge discovery and interestingness measures: a survey. Technical Report, Department of Computer Science, University of Regina (1999)
Güvenir, H.A.: Benefit Maximization in Classification on Feature Projections. In: Proceedings of the 3rd IASTED International Conference on Artificial Intelligence and Applications (AIA’03), pp. 424–429 (2003)
Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding interesting rules from large sets of discovered association rules. In: Proceedings of the 3rd Int. Conf. on Information and Knowledge Management, pp. 401–407 (1994)
Liu, B., Hsu, W., Chen, S.: Using general impressions to analyze discovered classification rules. In: Proceedings of the 3rd Int. Conf. on KDD, pp. 31–36 (1997)
Liu, B., Hsu, W.: Post-analysis of learned rules, pp. 828–834. AAAI, Menlo Park (1996)
Hussain, F., Liu, H., Suzuki, E., Lu, H.: Exception rule mining with a relative interestingness measure. In: PAKDD 2000, pp. 86–97 (2000)
Dong, G., Li, J.: Interestingness of discovered association rules in terms of neighborhood-based unexpectedness. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol. 1394, pp. 72–86. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Aydın, T., Güvenir, H.A. (2007). A Novel Hybrid Approach for Interestingness Analysis of Classification Rules. In: Sakurai, A., Hasida, K., Nitta, K. (eds) New Frontiers in Artificial Intelligence. JSAI JSAI 2003 2004. Lecture Notes in Computer Science(), vol 3609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71009-7_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-71009-7_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71008-0
Online ISBN: 978-3-540-71009-7
eBook Packages: Computer ScienceComputer Science (R0)