Mining Web log data based on key path

A Web log mining method is presented. First, minimal key path set (MKPS) is defined and an algorithm to find the MKPS online is given. At the same time, for any key path in the MPKS, this algorithm can find out all transactions relevant to it. After scanning the transaction database only once, a rel...

Full description

Saved in:
Bibliographic Details
Main Authors: Ai-Bo Song, Zuo-Peng Liang, Mao-Xian Zhao, Yi-Sheng Dong
Format: Conference Proceeding
Language:English
Subjects:
Clustering algorithms
Computer science
Data engineering
Data mining
Educational technology
Electronic mail
Lungs
Software libraries
Transaction databases
Web pages
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A Web log mining method is presented. First, minimal key path set (MKPS) is defined and an algorithm to find the MKPS online is given. At the same time, for any key path in the MPKS, this algorithm can find out all transactions relevant to it. After scanning the transaction database only once, a relevant matrix is set up, where the key paths in MKPS are taken as columns and the transactions are taken as rows. Compared to previous methods, our method considers the three major features of users' accessing the Web: ordinal, contiguous, and duplicate. Moreover, for clustering transactions, we have lesser dimensions than the previous method. Using the clustering algorithm based on the relevant matrix, better clustering results will be obtained more precisely and quickly. Experiments show the effectiveness of the method.
DOI:10.1109/ICMLC.2002.1176728