Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Implementation of WAP through an Innovative and Efficient Technique

Print
PDF
International Journal of Computer Applications
© 2011 by IJCA Journal
Volume 36 - Number 4
Year of Publication: 2011
Authors:
Shorya Agrawal
Nirved K. Pandey
Amit Kanskar
10.5120/4482-6305

Shorya Agrawal, Nirved K Pandey and Amit Kanskar. Article: Implementation of WAP through an Innovative and Efficient Technique. International Journal of Computer Applications 36(4):22-27, December 2011. Full text available. BibTeX

@article{key:article,
	author = {Shorya Agrawal and Nirved K. Pandey and Amit Kanskar},
	title = {Article: Implementation of WAP through an Innovative and Efficient Technique},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {36},
	number = {4},
	pages = {22-27},
	month = {December},
	note = {Full text available}
}

Abstract

Web Access Pattern (WAP) tree mining is finding of sequence pattern from web access log. It has gained importance in view of increasing usage of World Wide Web. Access to web pages generates access log wherefrom meaningful information is extracted. WAP stores web accesses in a prefix tree. In order to mine data, this tree is recursively traversed in bottom up fashion for frequent items that starts with suffix sequences. Repeated construction of sub-trees for finding frequent itemset is necessary in this method. This paper proposes an improved technique termed as WRDSP (WAP Related Dotted Sequence Path) for creation of such graph in which each item needs to be constructed only once. For each attribute, single node only needs be created in proposed approach whereas many nodes may be required for each attribute in conventional WAP approach. To mine frequent pattern from such graph does not require repeated traversal of links already traversed, which is a big saving in memory and time.

References

  • Cooley, R., Mobasher, B., and Srivastava J., “Data preparation for mining World Wide Web browsing patterns”, In Journal of Knowledge & Information Systems, Vol.1, No.1, 1999.
  • Spiliopoulou, M. and Faulstich, L., “WUM: A tool for Web utilization analysis”, In Proc. 6th Int'l Conf. on Extending Database Technology (EDBT'98), Valencia, Spain, March 1998.
  • Borges, J. and Levene, M., “Data mining of user navigation patterns”, In Proceedings of the KDD Workshop on Web Mining San Diego California, pages 31–36, 1999.
  • Etzioni O., “The world wide web: Quagmire or gold mine”, Communications of the ACM, 39(1):65 – 68, 1996.
  • Agrawal, R. and Srikant, R., “Fast algorithms for mining association rules”, In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487{499, Santiago, Chile, September 1994.
  • Agrawal, R. and Srikant, R., “Mining sequential patterns”, In Proc. 1995 Int. Conf. Data Engineering, pages 3{14, Taipei, Taiwan, March 1995.
  • Srikant, R. and Agrawal, R., “Mining quantitative association rules in large relational tables”, In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data, pages 1-12, Montreal, Canada, June 1996.
  • Agrawal, R., Imielienski, T., and Swami, A., “Mining Association Rules between Sets of Items in Large Databases”, Proc. Conf. on Management of Data, 207–216,ACM Press, New York, NY, USA 1993.
  • Pei, J., Han, J., Mortazavi-Asl, B., and Zhu, H., “Mining access patterns efficiently from web logs”, In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD’00) Kyoto Japan, 2000.
  • Han, J., Pei, J., Yin, Y., and Mao, R., “Mining frequent patterns without candidate generation: A frequent-pattern tree approach”, International Journal of Data Mining and Knowledge Discovery, 8(1):53–87, Jan 2004.
  • Han, J., Pei, H., and Yin, Y, “Mining Frequent Patterns without Candidate Generation”, In: Proc. Conf. on the Management of Data (SIGMOD’00, Dallas, TX).ACM Press, New York, NY, USA 2000.
  • Masseglia, F., Poncelet, P., and Cicchetti, R., “An efficient algorithm for web usage mining”, Networking and Information Systems Journal (NIS), 2(5-6):571–603, 1999.
  • Ezeife, C. and Lu, Y., “Mining web log sequential patterns with position coded pre-order linked wap-tree”, International Journal of Data Mining and Knowledge Discovery (DMKD) Kluwer Publishers, 10(1):5–38, 2005.
  • Lu, Y. and Ezeife C., “Position coded pre-order linked wap-tree for web log sequential pattern mining”, In Proceedings of the 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2003), pages 337–349. Springer, May 2003.
  • Nanopoulos and Manolopoulos, Y., “Mining patterns from graph traversals”, Data and Knowledge Engineering, 37(3):243–266, 2001.
  • Ezeife, C.I., Lu, Yi and Liu, Yi, “PLWAP Sequential Mining: Open Source Code”, Proceedings of the First International Workshop on Open Source Data Mining, pages 26-35, 2005.
  • Ezeife, C.I. and Chen, Min, “Incremental mining of Web sequential pattern using PLWAP tree on tolerance Min Support”, Database Engineering and Applications Symposium, 2004. IDEAS '04. Proceedings. International,2004 , Page(s): 465 – 469.
  • Liu, Lizhi and Liu, Jun, “Mining Maximal Sequential Patterns with Layer Coded Breadth-First Linked WAP-Tree”, 2009 Second Asia-Pacific Conference on Computational Intelligence and Industrial Applications, pages- 61-65.
  • Parmar, Jatin D and Garg, Sanjay, “Modified Web Access Pattern (mWAP) Approach for Sequential Pattern Mining”, IJCSNS International Journal of Computer Science and Network Security, VOL. 9 No.6, June 2009.