Abstract
We develop a general sequence-based clustering method by proposing new sequence representation schemes in association with Markov models. The resulting sequence representations allow for calculation of vector-based distances (dissimilarities) between Web user sessions and thus can be used as inputs of various clustering algorithms. We develop an evaluation framework in which the performances of the algorithms are compared in terms of whether the clusters (groups of Web users who follow the same Markov process) are correctly identified using a replicated clustering approach. A series of experiments is conducted to investigate whether clustering performance is affected by different sequence representations and different distance measures as well as by other factors such as number of actual Web user clusters, number of Web pages, similarity between clusters, minimum session length, number of user sessions, and number of clusters to form. A new, fuzzy ART-enhanced K-means algorithm is also developed and its superior performance is demonstrated.
| Original language | English |
|---|---|
| Pages (from-to) | 512-543 |
| Number of pages | 32 |
| Journal | Data and Knowledge Engineering |
| Volume | 65 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2008 |
Keywords
- Artificial intelligence
- Clustering methods
- Markov chain
- Simulation
- Web usage mining
Fingerprint
Dive into the research topics of 'Sequence-based clustering for Web usage mining: A new experimental framework and ANN-enhanced K-means algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver