Name
Abstract | ||
|---|---|---|
Abstract In this paper, we describe the concept of rst- occurrence and present a web access pattern mining algorithm based on it using a novel rst-occurrence linked WAP-tree (FLWAP-tree). The rst-occurrences of all symbols in the base WAP-tree of the database can be found by a pre-order traversal of a portion of the WAP-tree. The frequent patterns and their projec- tion databases can be found quickly by following the rst-occurrence links rather than following the links of the whole WAP-tree as in the PLWAP-tree mining (1). The performance evaluation shows that our FLWAP- tree mining outperforms the PLWAP-tree mining (1) consistently and signicantly. |
Year | Venue | Keywords |
|---|---|---|
2007 | SEDE | web accessibility |
Field | DocType | Citations |
Data mining,World Wide Web,Web mining,Tree traversal,Computer science,Web access,Web access pattern,Data mining algorithm,Database | Conference | 9 |
PageRank | References | Authors |
0.75 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peiyi Tang | 1 | 297 | 47.98 |
| Markus P. Turkia | 2 | 18 | 2.52 |
| Kyle Gallivan | 3 | 889 | 154.22 |