Temporal web log mining using olap techniques

Authors:
I. Petrounias;A. Assaid
Affiliations:
Department of Computation, UMIST, PO Box 88, Manchester M60 1QD, UK;Department of Computation, UMIST, PO Box 88, Manchester M60 1QD, UK
Venue:
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Year:
2003

Citing 5
Cited 0

An overview of data warehousing and OLAP technology

ACM SIGMOD Record
Efficient enumeration of frequent sequences

Proceedings of the seventh international conference on Information and knowledge management
Sequence mining in categorical domains: incorporating constraints

Proceedings of the ninth international conference on Information and knowledge management
SPADE: An Efficient Algorithm for Mining Frequent Sequences

Machine Learning
webSPADE: A Parallel Sequence Mining Algorithm to Analyze Web Log Data

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper is concerned with mining temporal features from web logs. We present two methods. The first one concerns the temporal mining of sequential patterns in which we use sequence data which are used as support for discovered patterns in order to find periodicity in web log data. The second one concerns an efficient method for finding periodicity in web log sequence data which handles missing sequences by dealing with the overlap problem.