Abstract
A hybrid interestingness heuristic algorithm, clusterAOI, is presented that generates a more interesting generalized final table than traditional attribute-oriented induction (AOI). AOI uses a global static threshold to generalize attributes irrespective of attribute features, consequently leading to overgeneralisation. In contrast, clusterAOI uses attribute features such as concept hierarchies and distinct domain attribute values to dynamically recalculate new attribute thresholds for each of the less significant attributes. ClusterAOI then applies new heuristic functions and the Kullback-leibler (K-L) measure to evaluate interestingness for each attribute and then for all attributes by a harmonic aggregation in each generalisation iteration. The dynamic threshold adjustment, aggregation and evaluation of interestingness within each generalization iteration ultimately generates a higher quality final table than traditional AOI. Results from real-world cancer and population datasets show both significantly increased interestingness and better performance compared with AOI.
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
Han, J., Cercone, N., Cai, Y.: Attribute-Oriented Induction in Relational Databases. In: Piatetsky-Shapiro, G., Frawley, W.J. (eds.) Knowledge Discovery in Databases, pp. 213–228 (1991)
Resnik, P.: Using information content to evaluate semantic similarity in a taxonomy (1). In: Proc.14th Joint Conference on Artificial intelligence, San Francisco, vol. 1, pp. 448–453 (1995)
Muyeba, M., Sulaiman Khan, M., Gong, Z.: On Clustering Attribute-oriented Induction. In: Research and Development in Intelligent Systems XXIII 2006, pp. 403–407 (2006)
Fudger, D.R., Hamilton, J.: A Heuristic for Evaluating Databases for Knowledge Discovery with DBLEARN. Rough Sets and Knowledge Discovery, pp. 29-39 (1993)
Chen, Y.L., Wu, Y.Y., Chang, R.I.: From data to global generalized knowledge. Journal of Knowledge and Information Systems (2010) (in Press)
Yen-Liang, C., Ching-Cheng, S.: Mining generalized knowledge from ordered data through attribute-oriented induction techniques. European Journal of Operational Research 166(1), 221–245 (2005)
Hsu, C.-C.: Extending attribute-oriented induction algorithm for major values and numeric values. Expert Systems with Applications 27(2), 187–202 (2004)
Han, J., Fu, Y.: Exploration of the power of attribute-oriented induction in data mining. In: Advances in Knowledge Discovery and Data Mining (1996)
Huang, Y.-F., Wu, C.-M.: Mining Generalized Association Rules Using Pruning Techniques. In: ICDM 2002, pp. 227–234 (2002)
Hilderman, R.J., Hamilton, H.J.: Knowledge Discovery and Measures of Interest. Kluwer Academic Publishers, Dordrecht (2001)
Silberschatz, A., Tuzhilin, A.: What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineerig 8(6), 970–974 (1996)
Kim, J., Lee, G., Seo, J.-T., Park, E.-K., Park, C.-s., Kim, D.-K.: An Alert Reasoning Method for Intrusion Detection System Using Attribute Oriented Induction. In: Kim, C. (ed.) ICOIN 2005. LNCS, vol. 3391, pp. 72–79. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muyeba, M., Crockett, K., Keane, J. (2011). A Hybrid Interestingness Heuristic Approach for Attribute-Oriented Mining. In: O’Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2011. Lecture Notes in Computer Science(), vol 6682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22000-5_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-22000-5_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21999-3
Online ISBN: 978-3-642-22000-5
eBook Packages: Computer ScienceComputer Science (R0)