CFP last date
21 October 2024
Reseach Article

Article:Constraint-based Web Log Mining for Analyzing Customersí Behaviour

by Anagha Shastri, Dipti Patil, V.M.Wadhai
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 11 - Number 10
Year of Publication: 2010
Authors: Anagha Shastri, Dipti Patil, V.M.Wadhai
10.5120/1621-2180

Anagha Shastri, Dipti Patil, V.M.Wadhai . Article:Constraint-based Web Log Mining for Analyzing Customersí Behaviour. International Journal of Computer Applications. 11, 10 ( December 2010), 7-11. DOI=10.5120/1621-2180

@article{ 10.5120/1621-2180,
author = { Anagha Shastri, Dipti Patil, V.M.Wadhai },
title = { Article:Constraint-based Web Log Mining for Analyzing Customersí Behaviour },
journal = { International Journal of Computer Applications },
issue_date = { December 2010 },
volume = { 11 },
number = { 10 },
month = { December },
year = { 2010 },
issn = { 0975-8887 },
pages = { 7-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume11/number10/1621-2180/ },
doi = { 10.5120/1621-2180 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:00:10.457043+05:30
%A Anagha Shastri
%A Dipti Patil
%A V.M.Wadhai
%T Article:Constraint-based Web Log Mining for Analyzing Customersí Behaviour
%J International Journal of Computer Applications
%@ 0975-8887
%V 11
%N 10
%P 7-11
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Analysis of Web logs is one of the important challenges to provide Web intelligent services. Association rule mining algorithms are used widely to track users' web behaviour. Due to large amount of data many times the rules formed by these algorithms are very long and redundant. Recently Constraint-based mining approaches have received attention to deal with these big and redundant association rules. In this paper we discuss the Constraint based web mining approach used to reduce the size of association rules derived from Web log. The approach proves effective in reducing the overlap of information and also improves the efficiency of mining tasks. Constraint-based mining enables users to concentrate on mining their interested association rules instead of the complete set of association rules.

References
  1. R. Cooley, J. Srivastava, and B. Mobasher, “Web mining: Information and pattern discovery on the World Wide Web”. In 9th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’97), November 1997.
  2. M. Eirinaki and M. Vazirgiannis, “Web mining for web personalization”. In ACM Trans. Inter. Tech., vol. 3, no. 1, pp. 1-27, 2003
  3. Mathia Gery, Hatem Haddad, “Evaluation of Web Usage Mining Approaches for User’s Next Request Prediction”. In WIDM ’03, ACM November 2003.
  4. R. Cooley, B. Mobasher, and J. Srivastava, “Data preparation for mining world wide web browsing patterns” In Knowledge and Information Systems, vol. 1, no. 1, pp. 5-32, 1999.
  5. Xin Chen and Yi-fang Brook Wu, “Web Mining from Competitors’ Websites”, Research track poster, New Jersey Institute of Technology
  6. W. Yang, Yuefeng Li, Yue Xu, Hang Liu, “Rough Set Model for Constraint-based Multi-dimensional Association Rule” In journal Software Engineering and Data Communication of Queensland University of Technology, Brisban.
  7. R.T.Ng, L.V.S. Lakshmanan, J. Han, A. Pang, “Exploratory Mining and Pruning Optimizations of Constrained Associations Rules”. In Proceedings of ACM-SIGMOD, 1998, pp. 13-24.
  8. Rajendra K.Gupta and Dev Prakash Agarwal, “Improving the performance of Association Rule Mining Algorithms by Filtering Insignificant Transactions dynamically”, Asian Journal of Information Management, pp.7-17. 2009 Academic Journals Inc.
  9. V.Umarani, Dr.M. Punithavalli, “A Study on Effective Mining of Association Rules from Huge Databases”, IJCSR International Journal of Computer Science and Research, Vol 1 Issue 1, 2010
Index Terms

Computer Science
Information Sciences

Keywords

Data Mining Association rules Constraint Based Web Mining