Abstract
Rather than finding new association-mining types one at a time, in this paper, we propose a framework, which is called Generalization of Association Mining via Information Granulation (GAMInG), based on which new association-mining types capable of discovering new patterns hidden in data can be systematically defined.
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. ACM-SIGMOD Int. Conf. on Management of Data, Washington, DC (1993)
Lu, H., Feng, L., Han, J.: Beyond intra-transaction association analysis: Mining multidimensional inter-transaction association rules. ACM Trans. on Information Systems 18(4) (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, Y., Raghavan, V.V. (2004). GAMInG – A Framework for Generalization of Association Mining via Information Granulation. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive