Mining Top-K Click Stream Sequences Patterns release_uhtd7pcrejcjbckpzmis3jqmam

by MEHDI Haj Ali, Qun-Xiong Zhu, Yan-Lin He

Published in Indonesian Journal of Electrical Engineering and Computer Science by Institute of Advanced Engineering and Science.

p655 (2016)

Abstract

<em>Sequential pattern mining, it  is not just important in data mining field , but  it is the basis of many applications .However, running applications cost time and memory, especially when dealing with dense of the dataset. Setting the proper minimum support threshold is one of the factors that consume more memory and time. However ,  it is difficult for users to get the appropriate patterns, it may present too many sequential patterns  and makes it difficult for users to comprehend the results. The problem becomes worse and worse when dealing with long click stream sequences or huge dataset. As a solution, we developed an efficient algorithm, called TopK (Top-K click stream sequence pattern mining), which employs the output as top-k patterns , K is the most important and relevant frequencies (with a high support) . However ,our algorithm based on pseudo-projection to avoid consuming more time and memory, and uses several efficient search space pruning methods together with BI-Directional Extension. Our extensive study and experiments on real click stream datasets show TopK significantly outperforms the previous algorithms.</em>
In application/xml+jats format

Archived Files and Locations

application/pdf  778.2 kB
file_gijxdtzggjb53dvjc7yilfo3oy
www.iaescore.com (web)
web.archive.org (webarchive)
Read Archived PDF
Archived
Type  article-journal
Stage   published
Date   2016-12-18
Journal Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  2502-4752
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3c57acdc-afc3-49ad-855b-517e9cac7765
API URL: JSON