CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Enhanced Integrated Approach to Predict Web User's Future Requests using K-Means and FP-Growth

by Tanveer Kaur Dewgun, Pushpraj Singh Chauhan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 115 - Number 16
Year of Publication: 2015
Authors: Tanveer Kaur Dewgun, Pushpraj Singh Chauhan
10.5120/20238-2558

Tanveer Kaur Dewgun, Pushpraj Singh Chauhan . Enhanced Integrated Approach to Predict Web User's Future Requests using K-Means and FP-Growth. International Journal of Computer Applications. 115, 16 ( April 2015), 42-46. DOI=10.5120/20238-2558

@article{ 10.5120/20238-2558,
author = { Tanveer Kaur Dewgun, Pushpraj Singh Chauhan },
title = { Enhanced Integrated Approach to Predict Web User's Future Requests using K-Means and FP-Growth },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 115 },
number = { 16 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 42-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume115/number16/20238-2558/ },
doi = { 10.5120/20238-2558 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:55:02.444690+05:30
%A Tanveer Kaur Dewgun
%A Pushpraj Singh Chauhan
%T Enhanced Integrated Approach to Predict Web User's Future Requests using K-Means and FP-Growth
%J International Journal of Computer Applications
%@ 0975-8887
%V 115
%N 16
%P 42-46
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The tremendous growth in the World Wide Web has led to the user perceived latency when requesting for resources from the web servers. Millions of users are connected to the web server for different needs. To improve the performance of the servers, caching is used where the frequently accessed pages are stored in proxy server caches. Pre-fetching of web pages is the new research area which when used with caching greatly increases the performance. In this paper, a better algorithm for predicting the web pages is proposed. Clustering of web users according to their location using K-Means clustering is done and then each cluster is mined using FP-Growth algorithm to find the association rules and predict the pages to be pre-fetched for storing in cache.

References
  1. Web Usage Mining: Discovery and Applicaions of Usage Patterns from Web Data, Jaideep Srivastava, Robert Cooleyz , Mukund Deshpande, Pang-Ning Tan, ACM SIGKDD, Jan 2000.
  2. K. Chinen and S. Yamaguchi. An Interactive Pre-fetching Proxy Server for Improvement of WWW Latency. In Proceedings of the Seventh Annual Conference of the Internet Society (INEt'97), Kuala Lumpur, June 1997.
  3. Garofalakis M. N. , Rastogi R. , Sheshadri S. , and Shim K. ,"Data mining and the Web: past, present and future. " InProceedings of the second international workshopon Web information and data management, ACM, 1999.
  4. Fu Y. , Sandhu K. , and Shih M. , "Clustering of Web Users Based on Access Patterns. " International Workshop on Web Usage Analysis and User Profiling (WEBKDD'99), San Diego, CA, 1999.
  5. Pitkow J. and Pirolli P. Mining longest repeating subsequences to predict www surfing. In Proceedings of the 1999 USENIX Annual Technical Conference, 1999.
  6. Z. Su, Q. Yang, Y. Lu, and H. Zhang. Whatnext: A prediction system for web requests using n- gram sequence models. In Proceedings of the First International Conference on Web Information System and Engineering Conference, pages 200-207, Hong Kong, June 2000.
  7. Phoha V. V. , Iyengar S. S. , and Kannan R. , "Faster Web Page Allocation with Neural Networks," IEEE Internet Computing, Vol. 6, No. 6, pp. 18-26, December 2002.
  8. Zhang T. , Ramakrishnan R. , and Livny M. , "Birch: AnEfficient Data Clustering Method for Very Large Databases. " In Proceedings of the ACM SIGMODConference on Management of Data, pages 103-114, Montreal, Canada, June 1996.
  9. Cadez I. , Heckerman D. , Meek C. , Smyth P. , and Whire S. , "Visualization of Navigation Patterns on a Website Using Model Based Clustering. " Technical Report MSR-TR-00-18, Microsoft Research, March 2002.
  10. Podlipnig S, Boszormenyi L. A survey of Web cache replacement strategies. ACM Comput Surveys 2003;35(4):374–98.
  11. Rabinovich M, Spatsheck O. Web caching and replication. Addison Wesley; 2002.
  12. Teng WG, Chang CY, Chen MS. Integrating Web caching and Web prefetching in client-side proxies. IEEE Trans Parallel Distributed Syst 2005;16(5):444–55.
  13. Schloegel K, Karypis G, Kumar V. Parallel multilevel algorithms for multi-constraint graph partitioning. In: Proceedings of 6th international Euro-Par conference. September 2000. p. 296– 310.
  14. Vakali A, Pokorny J, Dalamagas T. An overview of Web data clustering practices. In: Proceedings of the EDBT Workshops 2004. Heraklion, Crete; 2004. p. 597–606.
  15. Nanhay Singh, Arvind Panwar and Ram Shringar Raw. Enhancing the performance of Web Proxy Server using Cluster Based Pre-fetching technique. IEEE 2013.
Index Terms

Computer Science
Information Sciences

Keywords

Web Usage Mining Apriori FP-Growth algorithm K-Means clustering

Powered by PhDFocusTM