Abstract
Attribute-Oriented Induction (AOI) is a data mining technique that produces simplified descriptive patterns. Classical AOIuses a predictive strategy to determine distinct values of an attribute but generalises attributes indiscriminately i.e. the value ‘ANY’ is replaced like any other value without restrictions. AOI only produces interesting rules by using interior concepts of attribute hierarchies. The COMPARE algorithm that integrates predictive and lookahead methods and of order complexity O (np), where n and p are input and generalised tuples respectively, is introduced. The latter method determines distinct values of attribute clusters and greatest number of attribute values with a ‘common parent’ (except parent ‘ANY’). When generating rules, a rough set approach to eliminate redundant attributes is used leading to more interesting multiple-level rules with fewer ‘ANY’ values than classical AOI.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Han, J.; Cercone, N. and Cai, Y. 1991. „Attribute-Oriented Induction in Relational Databases” In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, pp 213–228.
Muyeba, K. M., and Keane, J.A 1999. „Extending Attribute-Oriented Induction as a Key-Preserving Data Mining Method” In Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery (PKDD’99), Prague, Czech. Republic, pp 448–455.
Fudger, D. and Hamilton, H. 1993. „Heuristic Evaluation of Databases for Knowledge Discovery with DBLEARN” International Workshop on Rough Sets and Knowledge Discovery, Banff, Canada, pp 29–39.
Shan, N.; Howard, J. H. and Cercone, N. 1996. „GRG: Knowledge Discovery Using Information Generalisation, Information Reduction and Rule Generation” In International Journal of Artificial Intelligence tools, 5:(1&2), pp 99–112.
Silberschatz, A. and Tuzhilin, A. 1995. „On subjective measures of Interestingness in Knowledge Discovery” In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD’95), Montreal, Canada, pp 275–281.
Barber, B. and Howard, H. J. 1997. „A Comparison of Attribute Selection Strategies for Attribute-Oriented Generalisation” In International Symposium on Methodologies for Intelligent Systems (ISMIS’97), Charlotte, NC, pp 106–116.
Yongjian, F. 1996. „Discovery of Multiple-level Rules from Large Databases”, Ph.D. thesis, Simon Fraser University, Canada.
Carter, C.L.; Hamilton, H. J. and Cercone, N. 1994. „The Software Architecture of DBLEARN”, Technical Report CS-94-04, University of Regina.
Quinlan, J. R. 1986. „Induction of decision trees”, Machine Learning, Vol. 1, pp 81–106.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muyeba, M.K., Keane, J.A. (2000). Interestingness in Attribute-Oriented Induction (AOI): Multiple-Level Rule Generation. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2000. Lecture Notes in Computer Science(), vol 1910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45372-5_64
Download citation
DOI: https://doi.org/10.1007/3-540-45372-5_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41066-9
Online ISBN: 978-3-540-45372-7
eBook Packages: Springer Book Archive