Paper Info
Title
A Constraint Programming Approach for Web Log Mining
Abstract
AbstractMining web access patterns consists in extracting knowledge from server log files. This problem is represented as a sequential pattern mining problem SPM which allows to extract patterns which are sequences of accesses that occur frequently in the web log file. There are in the literature many efficient algorithms to solve SMP e.g., GSP, SPADE, PrefixSpan, WAP-tree, LAPIN, PLWAP. Despite the effectiveness of these methods, they do not allow to express and to handle new constraints defined on patterns, new implementations are required. Recently, many approaches based on constraint programming CP was proposed to solve SPM in a declarative and generic way. Since no CP-based approach was applied for mining web access patterns, the authors introduce in this paper an efficient CP-based approach for solving the web log mining problem. They bring back the problem of web log mining to SPM within a CP environment which enables to handle various constraints. Experimental results on non-trivial web log mining problems show the effectiveness of the authors' CP-based mining approach.
Year
DOI
Venue
2016
10.4018/IJITWE.2016100102
Periodicals
Keywords
Field
DocType
Constraint Programming, Constraint-Based Mining, Sequential Patterns, Web Logs, Web Mining
Data mining,PrefixSpan,Server log,Web mining,Web access,Computer science,Constraint programming,Implementation,Log mining,Sequential Pattern Mining,Database
Journal
Volume
Issue
ISSN
11
4
1554-1045
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Amina Kemmar1162.65
Yahia Lebbah211519.34
Samir Loudni315221.48