Abstract
Discovery of useful information and valuable knowledge from transactions has attracted many researchers due to increasing use of very large databases and data warehouses. Furthermore most of proposed methods are designed to work on traditional databases in which re-scanning the transactions is allowed. These methods are not useful for mining in data streams (DS) because it is not possible to re-scan the transactions duo to huge and continues data in DS. In this paper, we proposed an effective approach to mining frequent itemsets used for association rule mining in DS named GRM. Unlike other semi-graph methods, our method is based on graph structure and has the ability to maintain and update the graph in one pass of transactions. In this method data storing is optimized by memory usage criteria and mining the rules is done in a linear processing time.
Efficiency of our implemented method is compared with other proposed method and the result is presented.
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
Agrawal, R., Imiliniski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. of the ACM SIGMOD conference on Management of Data, Washington, D.C. (May 1993)
Han, J., Jian, P., Yin, Y.: Mining Frequent pattern without Candidate Generation. In: Int’l. Conf. on Management of Data (May 2000)
Miller, R.G.: Simultaneous Statistical Inference, 2nd edn. Springer, New York (1981)
Maron, O., Moore, A.: Hoe_ding races: Accelerating model selection search for classi_cation and function approximation. In: Cowan, J.D., Tesauro, G., Alspector, J. (eds.) Advances in Neural Information Processing Systems, vol. 6, Morgan Kaufmann, San Mateo (1994)
Jiang, N., Gruenwald, L.: CFI-Stream: Mining Closed Frequent Itemsets in Data Streams. In: ACM SIGKDD intl. conf. on knowledge discovery and data mining (2006)
Naganthan, E.R., Rsmesh Dhanaseelan, F.: Efficient Graph Structure for the Mining of Frequent Itemsets from Data Streams. International Journal of Soft Computing 3(2), 144–146 (2008)
Leung, C.K.-S., Kkan, Q.l.: DSTree: A Tree Structure for the Mining of Frequent Set from Data Streams. In: IEEE Sixth Int’l. Conf. on Data Mining (2006)
Pudi, V., Haritsa, J.R.: ARMOR: Association Rule Mining based on Oracle. In: Proc. of ICDM Workshop on Frequent Itemset Mining Implementations, Florida, USA (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gahderi Mojaveri, S., Mirzaeian, E., Bornaee, Z., Ayat, S. (2010). New Approach in Data Stream Association Rule Mining Based on Graph Structure. In: Perner, P. (eds) Advances in Data Mining. Applications and Theoretical Aspects. ICDM 2010. Lecture Notes in Computer Science(), vol 6171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14400-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-14400-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14399-1
Online ISBN: 978-3-642-14400-4
eBook Packages: Computer ScienceComputer Science (R0)