Abstract
The Web serves as a global information service center that contains vast amount of data. The Website structure should be designed effectively so that users can efficiently find their information. The main contribution of this paper is to propose a graph-based optimization algorithm to modify Website topology using interesting association rules. The interestingness of an association rule A ⇒ B is defined based on the probability measure between two sets of Web pages A and B in the Website. If the probability measure between A and B is low (high), then the association rule A ⇒ B has high (low) interest. The hyperlinks in the Website can be modified to adapt user access patterns according to association rules with high interest. We present experimental results and demonstrate that our method is effective.
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
R. Agrawal and R. Srikant, Fast Algorithm for Mining Association Rules, Proc. Int’l Conf. Very large Data Bases, pp. 487–499, 1994.
R. Agrawal, T. Imielinski, and A. Swami, Database Mining: A Performance Perspective, IEEE Trans. Knowledge and Data Eng., 5(6) (1993):914–925.
R. Agrawal, T. Imielinski, and A. Swami, Mining Association Rules between Sets of Items in Large Databases, In: Proceedings of the ACM SIGMOD Conference on Management of Data, 1993: 207–216.
R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, In Research Report RJ 9839, IBM Almaden Research Center, San Jose, CA, June 1994.
R. Agrawal and R. Srikant, Fast algorithms for mining association rules, In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB’94), pages 487–499, Santiago, Chile, Sept. 1994.
John D. Garofalakis, Panagiotis Kappos, Dimitris Mourloukos: Website Optimization Using Page Popularity. IEEE Internet Computing 3(4):22–29, 1999.
J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2000.
M. Perkowitz and O. Etzioni, Adaptive Websites: an AI Challenge, In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997.
M. Perkowitz and O. Etzioni, Adaptive Websites: Automatically Synthesizing Web Pages, In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 1998.
M. Perkowitz and O. Etzioni, Adaptive Websites: Conceptual cluster mining, In Proc. 16th Joint Int. Conf. on Artificial Intelligence (IJCAI’99), pages 264–269, Stockholm, Sweden, 1999.
J. Srivastava, R. Cooley, M. Deshpande, and P. N. Tan, Web Usage Mining: Discovery and applications of usage patterns from web data, SIGKDD Explorations, 1:12–23, 2000.
L. Tauscher and S. Greenberg, How people revisit web pages: Empirical findings and implications for the design of history systems. International Journal of Human Computer Studies, Special issue on World Wide Web Usability, 97–138, 1997.
Q. Yang, J. Huang and M. Ng, A data cube model for prediction-based Web prefetching, Journal of Intelligent Information Systems, 20:11–30, 2003.
C. Zhang and S. Zhang, Association rule mining: models and algorithms, Springer, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, E.H., Ng, M.K. (2003). A Graph-Based Optimization Algorithm for Website Topology Using Interesting Association Rules. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-36175-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04760-5
Online ISBN: 978-3-540-36175-6
eBook Packages: Springer Book Archive