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

Reference Scan Algorithm for Path Traversal Patterns

by Chintandeep Kaur, Rinkle Rani Aggarwal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 48 - Number 7
Year of Publication: 2012
Authors: Chintandeep Kaur, Rinkle Rani Aggarwal
10.5120/7360-0135

Chintandeep Kaur, Rinkle Rani Aggarwal . Reference Scan Algorithm for Path Traversal Patterns. International Journal of Computer Applications. 48, 7 ( June 2012), 20-25. DOI=10.5120/7360-0135

@article{ 10.5120/7360-0135,
author = { Chintandeep Kaur, Rinkle Rani Aggarwal },
title = { Reference Scan Algorithm for Path Traversal Patterns },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 48 },
number = { 7 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 20-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume48/number7/7360-0135/ },
doi = { 10.5120/7360-0135 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:43:28.170761+05:30
%A Chintandeep Kaur
%A Rinkle Rani Aggarwal
%T Reference Scan Algorithm for Path Traversal Patterns
%J International Journal of Computer Applications
%@ 0975-8887
%V 48
%N 7
%P 20-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The paper focuses the path of exploring an algorithm which involves mining frequently used user traversals pattern while using the World Wide Web by the user. As the web's becoming more and more popular, web servers gather the large amount of data from the web in the form of web server logs. The web server log provides important information aiding to analysing the user surfing behavior and thus extract important information. Web Usage Mining analyses the Web access logs to find how the users surf a website so as to bring out interesting patterns which can be used for improving user profile, web site design, business and marketing decision support and web server system. Firstly, the server log is scanned and the maximal forward references are obtained for which effect of backward references is not considered and secondly, the maximal forward references obtained in the first step are used to finally obtain the large references which are frequently accessed patterns by the user.

References
  1. Behzad. M. A. 2001. Discovering and mining user web-page traversal patterns. Master's Thesis, Simon Fraser University
  2. J. December and N. Randall, 1994 "The World Wide Web Unleashed". SAMS Publishing.
  3. Park, J. S. , Chen, M. S. and P. S. Yu, P. S. 1998. Efficient Data Mining for Path Traversal Patterns. In IEEE transactions on Knowledge and Data Engineering, 10(2), 209-221.
  4. Mobasher, B. ,Jain, N. and Han, E. H. and Srivastava, J. 1996. "Web mining: pattern discovery from World Wide Web transactions, Technical Report: TR96-050, University of Minnesota
  5. Spiliopoulou, M. , and Faulstich, L. C. 1999. Wum: A web utilization miner. In the proceedings of EDBT Workshop on the Web and Data Bases (WebDB'98), Springer Verlag, 109-115.
  6. Park, J. S. , Chen, M. S. and Yu, P. S. , 1996. Data Mining for Path Traversal Patterns in a Web Environment. In proceedings of 16th international conference on Distributed Computing Systems, 385-392.
  7. Yao, H. , Hamilton, H. J. , and Butz, C. J. 2004. A Foundational Approach to Mining Itemset Utilities from Databases. In the Proceedings of the 4th SIAM International Conference on Data Mining, 482-486
  8. Zhixiang, C. , Fowler, R. H. and Fu, A. W. -C. 2003. Linear Time Algorithms for Finding Maximal Forward References. In the proceedings of Information Technology: Coding and Computing, 160-164
  9. Jing, T. , Zou, W. L. , and Zhang, B. Z. , 2004 An Efficient Web Traversal Pattern Mining algorithm Based On Suffix Array. In the Proceedings of the 3rd International Conference on Machine Learning and Cybernetics,1535-1539
  10. Yen,S. J. , Lee,Y. S. , and Hsieh, M. C. 2005. An efficient incremental algorithm for mining Web traversal patterns. In the Proceedings of the 2005 IEEE International Conference on e-Business Engineering (ICEBE'05), 274-281.
  11. Zhou, L. , Liu, Y. , Wang J. , and Shi, Y. 2007. Utility-based Web Path Traversal Pattern Mining. In the Proceedings of Seventh IEEE International Conference on Data Mining Workshops, 373-378.
  12. Ahmed, C. F. , Tanbeer, S. K. , Jeong B. S. and Lee, Y. K. 2009. Efficient mining of utility-based web path traversal patterns. In the proceedings of 11th International Conference on Advanced Communication Technology (ICACT'09), 2215-2218.
  13. Park, J. S. , Chen, M. -S. and Yu, P. S. 1995. An Effective Hash Based Algorithm for Mining Association Rules. In Proceedings of the 1995 ACM SIGMOD international conference on Management of data SIGMOD '95, 175-186.
Index Terms

Computer Science
Information Sciences

Keywords

Reference Scan Server Log

Powered by PhDFocusTM