Constraint based web mining

Authors:
I. Petrounias;A. Tseng;P. Chountas
Affiliations:
Department of Computation, UMIST, PO Box 88, Manchester, M60 1QD, UK;Department of Computation, UMIST, PO Box 88, Manchester, M60 1QD, UK;Department of Computer Science, University of Westminster, Northwick Watford Rd, Northwick Park, London, HA1 3TP, UK
Venue:
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Year:
2003

Citing 2
Cited 0

An effective hash-based algorithm for mining association rules

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Data mining for path traversal patterns in a web environment

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)

Quantified Score

Hi-index	0.00

Visualization

Abstract

As the rapid growing number of WWW users, the hidden information becomes ever increasingly valuable. As the consequence of such phenomenon, mining Web data and analysing on-line users' behaviour and their on-line traversal pattern have emerged into a new popular research area. Primarily based on the Web servers' log files, the main objective of traversal pattern mining is to discover the frequent patterns in users' browsing paths and behaviours. This paper presents a complete framework for web mining, allows users to predefine physical constraints when analysing complex traversal patterns in order to improve the efficiency of algorithms and offer flexibility in producing the results.