Abstract
Attribute-Oriented Induction (AOI) reduces the search space of large data to produce a minimal rule set. Classical AOI techniques only consider attributes that can be generalised but eliminates keys to relations. The Key-Preserving AOI (AOI-KP) preserves keys of the input relation and relate them to the rules for subsequent data queries. Previously, the sequential nature of AOI-KP affected performance on a single processor machine. More significantly, time was spent doing I/O to files linked to each generated rule. AOI-KP is O (np) and storage requirement O (n), where n and p represent the number of input and generalised tuples respectively. We present two enhanced AOI-KP algorithms, concAOI-KP (concurrent AOI-KP) and onLineConcAOI-KP of orders O (np) and O (n) respectively. The two algorithms have storage requirement O (p) and O (q), q =p*r, 0<r<l respectively. A prototype support tool exists and initial results indicate substantially increased utilisation of a single processor.
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
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.
Frawley, W. J. and Piatetsky-Shapiro, G. 1991. “Knowledge Discovery in Databases”, AAAI/MIT Press, pp 1–27.
Agrawal, R.; Imielinski, T. and Swami, A. 1993. “Database Mining: A Performance Perspective” IEEE Transactions on Knowledge and Data Engineering, 5(6):914–925, December.
Fu, Y. 1996. “Discovery of Multiple-Level Rules from Large Databases” Ph.D. thesis, Computing Science, Simon Fraser University, July.
Muyeba, K. M. and Keane, J. A. 1999. “Extending Attribute-Oriented Induction as a Key-Preserving Data Mining Method” Proceedings of the 3rd European Conference on Principles of Knowledge Discovery and Data Mining (PKDD’99), J. Zytkow and J. Rauch, editors, Prague, Czech. Republic, pp 249–258, September.
Carter, C. L. and Hamilton, H. J. 1998. “Efficient Attribute-Oriented Generalisation for Knowledge Discovery from Large Databases” IEEE Transactions on Knowledge Discovery and Data Engineering, 10(2): 193–208, March.
Zaki, M. J.; Li, W. and Parthasarathy, S. 1997. “Customized Dynamic Load Balancing for a Network of Workstations” JPDC, Special Issues on Workstation Clusters and Network-Based Computing, 43(2): 156–162, June.
Freitas, A. A. and Lavington, S. H. 1996. “Mining Very Large Databases with Parallel Processing”, Kluwer Academic, Boston.
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). A Concurrent Approach to the Key-Preserving Attribute-Oriented Induction Method. In: Terano, T., Liu, H., Chen, A.L.P. (eds) Knowledge Discovery and Data Mining. Current Issues and New Applications. PAKDD 2000. Lecture Notes in Computer Science(), vol 1805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45571-X_36
Download citation
DOI: https://doi.org/10.1007/3-540-45571-X_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67382-8
Online ISBN: 978-3-540-45571-4
eBook Packages: Springer Book Archive