Abstract
In recent times, Web usage mining has attracted significant attention due to its large number of applications. Existing Web usage mining approaches determine the significance of a Web access pattern by computing its support or utility, considering the entire span time of the database. The discovered frequent and high-utility patterns are treated as significant patterns and they reflect users’ interest based on support and utility constraints. However, in reality, users’ interest of a pattern is dynamic and varies from time to time. Because of this, there may be changes in web page access and its browsing time in a web access pattern at any point of time. Hence, it is essential and useful to analyze how changes in users’ interest affect the significance of the discovered patterns at any point of time in the database. With this idea, we propose an efficient algorithm to address the problems restricted in the existing approaches such as (1) discovery of Web access patterns with support and/or utility constraints (2) analyzing users’ interest of the discovered patterns with period constraint. The proposed algorithm uses a structure called web access pattern with support and utility (WAPSU) tree to represent the database in a compressed form and mines frequent and/or high-utility patterns from the tree efficiently.
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
References
Mobasher, B., Jain, N., Han, E.H., Srivastava, J.: Web mining: pattern discovery from World Wide Web transactions. Technical Report: TR96-050, pp. 1–25 (1996)
Srivastava, J., Cooley, R., Deshpande, M., Tan, P.-N.: Web usage mining: discovery and applications of usage patterns from web data. SIGKDD Explor. 1(2), 12–23 (2000)
Chen, M.S., Park, J.S., Yu, P.S.: Efficient data mining for path traversal patterns. IEEE Trans. Knowl. Data Eng. 10, 209–221 (1998)
Agrawal, R., Srikant. R.: Mining sequential patterns. In: Proceedings of the 11th International Conference on Data Engineering, pp 3–14 (1995)
Pei, J., Han, J., Mortazavi-Asl, B., Zhu, H.: Mining access patterns efficiently from web logs. In: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pp. 396–407 (2000)
Ezeife, C.I., Lu, Y.: Position coded pre-order linked WAP-tree for web log sequential pattern mining” PAKDD’03. In: Proceedings of the 7th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp. 337–349 (2003)
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE TKDE 16, 1424–1440 (2004)
Lee, Y.S., Yen, S.J.: Incremental and interactive mining of web traversal patterns. Inf. Sci. 178(2), 287–306 (2008)
Zhou, L., Liu, Y., Wang, J., Shi, Y.: Utility-based web path traversal pattern mining. In: Proceedings of the 7th IEEE International conference on Data Mining Workshops, pp. 373–378 (2007)
Liu, Y., Liao, W.K., Choudhary, A.: A two phase algorithm for fast discovery of high utility of itemsets. In: Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pp. 689–695 (2005)
Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K.: Efficient mining of utility-based web path traversal patterns. ISBN 978-89-5519-139-4, Feb 15–18, ICACT 2009, pp. 2215–2218 (2009)
Ahmed, C.F., Tanbeer, S.K., Jeong, B.S.: “A Framework for Mining High Utility Web Access Sequences. IETE Tech. Rev. 28(1), 3–16 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Thilagu, M., Nadarajan, R. (2014). An Efficient Approach to Analyze Users’ Interest on Significant Web Access Patterns with Period Constraint. In: Mohapatra, D.P., Patnaik, S. (eds) Intelligent Computing, Networking, and Informatics. Advances in Intelligent Systems and Computing, vol 243. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1665-0_82
Download citation
DOI: https://doi.org/10.1007/978-81-322-1665-0_82
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1664-3
Online ISBN: 978-81-322-1665-0
eBook Packages: EngineeringEngineering (R0)