Title | ||
---|---|---|
Improving Efficiency of Sequence Mining by Combining First Occurrence Forest (FOF) Strategy and Sibling Principle |
Abstract | ||
---|---|---|
Sequential pattern mining is one of the basic problems in data mining and it has many applications in web mining. The WAP-Tree (Web Access Pattern Tree) data structure provides a compact representation of single-item sequence databases. WAP-Tree based algorithms have shown notable execution time and memory consumption performance on mining single-item sequence databases. We propose a new algorithm FOF-SP, a WAP-Tree based algorithm which combines an early prunning strategy called \"Sibling Principle\" from the literature and FOF (First Occurrence Forest) strategy. Experimental results revealed that FOF-SP finds patterns faster than previous WAP-Tree based algorithms PLWAP and FOF. Moreover, FOF-SP can mine patterns faster than PrefixSpan and as fast as LAPIN on real sequence databases from web usage mining and bioinformatics. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1145/2611040.2611061 | WIMS |
Keywords | Field | DocType |
fof,database applications,algorithms,experimentation,sibling principle,wap-tree,sequence mining,fof-sp,performance | PrefixSpan,Data structure,Data mining,Web mining,Computer science,Web access pattern,Execution time,Sequential Pattern Mining | Conference |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kezban Dilek Onal | 1 | 10 | 2.52 |
Pinar Karagoz | 2 | 154 | 28.34 |