
Mining the Most Interesting Web Access Associations
PROCEEDINGS
Li Shen, Ling Cheng, James Ford, Fillia Makedon, Vasileios Megalooikonomou, Tilmann Steinberg, Dartmouth College, United States
WebNet World Conference on the WWW and Internet, in San Antonio, Texas Publisher: Association for the Advancement of Computing in Education (AACE), Chesapeake, VA
Abstract
Web access patterns can provide valuable information for website designers in making website-based communication more efficient. To extract interesting or useful web access patterns, we use data mining techniques which analyze historical web access logs. In this paper, we present an efficient approach to mine the most interesting web access associations, where the word "interesting" denotes patterns that are supported by a high fraction of access activities with strong confidence. Our approach consists of three steps: 1) transform raw web logs to a relational table; 2) convert the relational table to a collection of access transactions; 3) mine the transaction collection to extract associations and rules. In both step 1 and step 2, we provide users with an effective mechanism to help them generate only "interesting" access records and transactions for mining. In the third step, we present a new efficient data mining algorithm to find the most interesting web access associations. We evaluate this approach using both synthetic data sets and real web logs and show the efficacy, efficiency and good scalability of the proposed mining methods.
Citation
Shen, L., Cheng, L., Ford, J., Makedon, F., Megalooikonomou, V. & Steinberg, T. (2000). Mining the Most Interesting Web Access Associations. In Proceedings of WebNet World Conference on the WWW and Internet 2000 (pp. 489-494). San Antonio, Texas: Association for the Advancement of Computing in Education (AACE). Retrieved July 1, 2022 from https://www.learntechlib.org/primary/p/6408/.
© 2000 Association for the Advancement of Computing in Education (AACE)
Keywords
References
View References & Citations Map- Agrawal, R., ImielinskiT., & Swami A. (1993). Mining Associations between Sets of Items in Massive Databases. Proc. Of the ACM SIGMOD Int'l Conference on Management of Data, Washington D.C., May 1993. 207-216.
- Agrawal R., Mannila H., Srikant R., Toivonen H., & Verkamo A.I. (1996). Fast Discovery of Association Rules.
- Shafer J.C., Agrawal R., & MehtaM. (1996). SPRINT: A Scalable Parallel Classifier for Data Mining. Proc. Of the 22nd
These references have been extracted automatically and may have some errors. Signed in users can suggest corrections to these mistakes.
Suggest Corrections to ReferencesCited By
View References & Citations Map-
The Design and Development of a Faculty of Education Web Site: Creating an Institutional Portal
Marlo Steed, Faculty of Ed, University of Lethbridge, Canada
Society for Information Technology & Teacher Education International Conference 2011 (Mar 07, 2011) pp. 2744–2751
These links are based on references which have been extracted automatically and may have some errors. If you see a mistake, please contact info@learntechlib.org.