A New Joinless Apriori Algorithm for Mining Association Rules

Denis L. Nkweteyim, Stephen C. Hirtle

Abstract

In this paper, we introduce a new approach to implementing the apriori algorithm in association rule mining. We show that by omitting the join step in the classical apriori algoritm, and applying the apriori property to each transaction in the transactions database, we get the same results. We use a simulation study to compare the performances of the classical to the joinless algorithm under varying conditions and draw the following conclusions: (1) the joinless algorithm offers better space management; (2) the joinless apriori algorithm is faster for small, but slower for large, average transaction widths. We analyze the two algorithms to determine factors responsible for their relative performances. The new approach is demonstrated with an application to web mining of navigation sequences.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. Proc. ACM SIGMOD Int. Conf. on Management of Data. ACM Press, New York (1993) 207-216.
  2. Aggarwal, C., Srikant, R.: Fast Algorithms for Mining Association Rules. Proc. 20th Int. Conf. on Very Large Data Bases, VLDB. Morgan Kaufmann Publishers Inc., San Francisco (1994) 487-499.
  3. , Toivonen, H., Verkamo, I.: Efficient Algorithms for Discovering Association Rules. AAAI Workshop on Knowledge Discovery in Databases (KDD-94), Seattle, WA (1994) 181-192.
  4. , Kamber M.: Data Mining: Concepts and Techniques. Academic Press, San Diego, CA, (2001)
  5. , A fast APRIORI implementation. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, FL (2003)
  6. Borgelt, C.: Efficient Implementations of Apriori and Eclat. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, FL (2003)
  7. Kosters, W.A. and W. Pijls, Apriori, A Depth First Implementation. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, FL (2003)
  8. , Mobasher, B., and Srivastava, J.: Web Mining: Information and Pattern Discovery on the World Wide Web. International Conference on Tools With Artificial Intelligence, Newport Beach, CA (1997) 558-567.
  9. , Mobasher, B., and Srivastava, J.: Data Preparation for Mining World Web Browsing Patterns. Journal of Knowledge and Information Systems (1999) 5-32
  10. , Cooley, R., and Srivastava, J.: Automatic Personalization Based on Web Usage Mining. Communications of the ACM, ACM Press (2000) 142-151
  11. , Dai, D., Luo, L., and Nakagawa, M.: Effective Personalization Based on Association Rule Discovery from Web Usage Data. Proc. Third Int. Workshop on Web Information and Data Management, ACM Press, New York (2001) 9-15
  12. : In Search of Reliable Usage Data on the WWW. Proc. of the Sixth International WWW Conference (1997)
  13. Retrieved April 5 2003 from http://www.w3.org/Daemon/User/Config/Logging.html
  14. : Computational Models of Information Scent-following in a Very Large Browsable Text Collection. Proc.SIGCHI Conf. on Human Factors in Computing Systems, ACM, Atlanta, GA (1997)
  15. S., Park, J.S., and Yu, P.S.: Data Mining for Path Traversal Patterns in a Web Environment. Proc. of the 16th International Conference on Distributed Computing Systems (1996) 385-392
  16. : Google's PageRank Explained and How to Make the Most of it. Retrieved September 5 2003 from http://www. webworkshop.net/pagerank.html.
  17. : The Google Pagerank Algorithm and How it Works. Retrieved September 5 2003 from http://www.iprcom.com/ papers/pagerank/.
Download


Paper Citation


in Harvard Style

L. Nkweteyim D. and C. Hirtle S. (2005). A New Joinless Apriori Algorithm for Mining Association Rules . In Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005) ISBN 972-8865-28-7, pages 234-243. DOI: 10.5220/0002577802340243


in Bibtex Style

@conference{pris05,
author={Denis L. Nkweteyim and Stephen C. Hirtle},
title={A New Joinless Apriori Algorithm for Mining Association Rules},
booktitle={Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005)},
year={2005},
pages={234-243},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002577802340243},
isbn={972-8865-28-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005)
TI - A New Joinless Apriori Algorithm for Mining Association Rules
SN - 972-8865-28-7
AU - L. Nkweteyim D.
AU - C. Hirtle S.
PY - 2005
SP - 234
EP - 243
DO - 10.5220/0002577802340243