Abstract
A new algorithm called STAG (Stacked Graph) for association rule mining has been proposed in this paper using graph theoretic approach. A structure is built by scanning the database only once or at most twice that can be queried for varying levels of minimum support to find frequent item sets. Incremental growth is possible as and when new transactions are added to the database making it suitable for mining data streams. Transaction scanning is independent of the order of items in a transaction. Performance of this algorithm has been compared with other existing algorithms using popular datasets like the mushroom dataset, chess and connect dataset of the UCI data repository. The algorithm excels in performance when the dataset is dense.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Aggarwal, C.C., Yu, P.S.: Online Generation of Association Rules. In: ICDE Conference (1998)
Agrawal, R., Imielinski, T., Srikant, R.: Mining associaton rules between sets of items in large databases. In: SIGMOD (May 1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th Int’l Conf. on Very Large Databases (VLDB 1994), Santiago, Chile (June 1994)
Lin, D., Kedem, Z.M.: Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. In: Proc. of the Sixth European Conf. on Extending Database Technology (September 1997)
Han, J., Pei, J., Yin, Y.: Mining frequent Patterns without Candidate Generation. In: ACM-SIGMOD, Dallas (2000)
Zaki, M.J., Parthasarthy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proc. of the 3rd Int’l Conf. on KDD and Data Mining (KDD 1997), Newport Beach California (August 1997), http://kdd.ics.uci.edu/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandra, B., Gaurav (2008). A New Association Rule Mining Algorithm. In: Ishikawa, M., Doya, K., Miyamoto, H., Yamakawa, T. (eds) Neural Information Processing. ICONIP 2007. Lecture Notes in Computer Science, vol 4985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69162-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-69162-4_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69159-4
Online ISBN: 978-3-540-69162-4
eBook Packages: Computer ScienceComputer Science (R0)