Research Article
Web Log Mining using K-Apriori Algorithm
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 41 - Issue 11 |
| Published: March 2012 |
| Authors: Ashok Kumar D, Loraine Charlet Annie M.C. |
10.5120/5584-7820
|
Ashok Kumar D, Loraine Charlet Annie M.C. . Web Log Mining using K-Apriori Algorithm. International Journal of Computer Applications. 41, 11 (March 2012), 16-20. DOI=10.5120/5584-7820
@article{ 10.5120/5584-7820,
author = { Ashok Kumar D,Loraine Charlet Annie M.C. },
title = { Web Log Mining using K-Apriori Algorithm },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 41 },
number = { 11 },
pages = { 16-20 },
doi = { 10.5120/5584-7820 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Ashok Kumar D
%A Loraine Charlet Annie M.C.
%T Web Log Mining using K-Apriori Algorithm%T
%J International Journal of Computer Applications
%V 41
%N 11
%P 16-20
%R 10.5120/5584-7820
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Web log mining is a data mining technique which extracts useful information from the World Wide Web's (WWW) client usage details. Automated data gathering has resulted in extremely large information about web access and it can be represented in binary form. A novel method called K-Apriori algorithm is proposed here, to find the frequently accessed web pages from the very large binary weblog databases. Experimental results show that the proposed method has shows higher performance in terms of objectivity and subjectivity.
References
- Raymond Kosala and Hendrik Blockeel. 2000, "Web Mining Research: A Survey", ACM SIGKDD.
- Sanjay Kumar Madria, Sourav S Bhowmick, Ng W. K. and Lim E. P. 1999, "Research Issues in Web Data Mining", Springer.
- Qingyu Zhang and Richard S. Segall. 2008, "Web Mining: A Survey Of Current Research, Techniques, And Software", In International Journal of Information Technology and Decision Making, Volume: 07, Issue: 04, pp. 683-720.
- Agrawal R and Srikant R . 1984. " Fast algorithms for mining association rules", In Proceedings of the 20th VLDB conference, pp. 487–499.
- Borgelt C. 2003. "Efficient Implementations of Apriori and Eclat", Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI), Melbourne, Florida.
- Han J, Pei H, and Yin Y. 2000. "Mining Frequent Patterns without Candidate Generation", In Proc. Conf. on the Management of Data SIGMOD, Dallas, TX. ACM Press, New York, USA.
- Liu J,Pan Y,Wang K, andHan J. 2002. "Mining Frequent Item Sets by Opportunistic Projection", Proceedings of ACM SIGKDD, Edmonton, Alberta, Canada.
- Gopalan R. P and Sucahyo Y. G. 2004. "High Performance Frequent Pattern Extraction using Compressed FPTrees", Proceedings of SIAM International Workshop on High Performance and Distributed Mining (HPDM),Orlando, USA.
- Han J and Kamber M. 2001. "Data Mining: Concepts and Techniuqes", Morgan Kaufmann Publishers, San Francisco, CA.
- Wanjun Yu, Xiaochun Wang, Fangyi Wang, Erkang Wang and Bowen Chen, 2008. "The research of improved apriori algorithm for mining association rules", 11th IEEE International Conference on Communication Technology, pp. 513 - 516.
- Frederic Garcia Becerro. 2007, "Report on Wiener filtering", Image Analysis, Vibot. [Online] http://eia. udg. edu/~fgarciab/.
- McQueen J. 1967. "Some methods for classification and analysis of multivariate observations", In Proc. of 5th Berkeley Symp Mathematics,statistics and probability, pp. 281-296.
- Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, and Angela Y. Wu, 2002. "An Efficient k-Means Clustering Algorithm: Analysis and Implementation", IEEE Transactions on Pattern Analysis and Machine Intelligence", pp. 881-892.
Index Terms
Keywords