Abstract
This paper continue the study of machine oriented models initiated by the second author. An attribute value is regarded as a name of the collection (called granule) of the entities that have the same property (specified by the attribute value). The relational model uses these granules (e.g., bit representation of subsets) as attribute values is called machine oriented data model. The model transforms data mining, particularly finding association rules, into Boolean operations. This paper show that this approach speed up data mining process tremendously; in the experiments, it is approximately 50 times faster, the pre-processing time was included).
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
Y.D. Cai, N. Cercone, and J. Han. “Attribute-oriented induction in relational databases,” in Knowledge Discovery in Databases, pages 213–228. AAAI/MIT Press, Cambridge, MA, 1991.
Maier, D.: The Theory of Relational Databases. Computer Science Press, 1983 (6th printing 1988).
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic, Dordrecht (1991)
T. Y. Lin.,“Data Mining and Machine Oriented Modeling: A Granular Computing Approach,” Journal of Applied Intelligence, Kluwer, in print
Eric Louie and T.Y. Lin, “A Data Mining Approach using Machine Oriented Modeling: Finding Association Rules using Canonical Names.”. In: Proceeding of 14th Annual International Symposium Aerospace/Defense Sensing, Simulation, and Controls, SPIE Vol 4057, Orlando, April 24–28, 2000
Agrawal, R., T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,”in Proceeding of ACM-SIGMOD International Conference on Management of Data, pp. 207–216, Washington, DC, June, 1993.
Agrawal, R., R. Srikant, “Fast Algorithms for Mining Association Rules,” in Proceeding of 20th VLDB Conference San Tiago, Chile, 1994.
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
Louie, E., Young, T. (2000). Finding Association Rules Using Fast Bit Computation: Machine-Oriented Modeling. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_51
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)