Position Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining
Pacific-Asia Conference on Knowledge Discovery and Data Mining
Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively re-constructing intermediate WAP-trees, starting with their suffix subsequences.This paper proposes an efficient approach for using the preorder linked WAP-trees with binary position codes assigned to each node, to mine frequent sequences, which eliminates the need to engage in numerous re-construction of intermediate WAP-trees during mining. Experiments show huge performance advantages for sequential mining using prefix linked WAP-tree technique.
Lu, Y. and Ezeife, C. I.. (2003). Position Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining. Pacific-Asia Conference on Knowledge Discovery and Data Mining, 337-349.