Mining Top-K Click Stream Sequences Patterns

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 consum...

Full description

Saved in:
Bibliographic Details
Main Authors: Haj Ali, MEHDI (Author), Zhu, Qun-Xiong (Author), He, Yan-Lin (Author)
Format: EJournal Article
Published: Institute of Advanced Engineering and Science, 2016-12-01.
Subjects:
Online Access:Get fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02432 am a22003013u 4500
001 ijeecs6013_5388
042 |a dc 
100 1 0 |a Haj Ali, MEHDI  |e author 
700 1 0 |a Zhu, Qun-Xiong  |e author 
700 1 0 |a He, Yan-Lin  |e author 
245 0 0 |a Mining Top-K Click Stream Sequences Patterns 
260 |b Institute of Advanced Engineering and Science,   |c 2016-12-01. 
500 |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/6013 
520 |a 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. 
540 |a Copyright (c) 2016 Indonesian Journal of Electrical Engineering and Computer Science 
540 |a http://creativecommons.org/licenses/by-nc-nd/4.0 
546 |a eng 
690 |a Information-technology , computer Engineering 
690 |a Pattern mining ; stream sequence ; Sequence database; Top-k; Data mining 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |2 local 
786 0 |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 4, No 3: December 2016; 655-664 
786 0 |n 2502-4760 
786 0 |n 2502-4752 
786 0 |n 10.11591/ijeecs.v4.i3 
787 0 |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/6013/5388 
856 4 1 |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/6013/5388  |z Get fulltext