Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree
Data Mining and Knowledge Discovery
Mining frequent itemsets from uncertain data
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
A tree-based approach for frequent pattern mining from uncertain data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Discovering frequent itemsets on uncertain data: a systematic review
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
| Hi-index | 0.00 |
This paper proposes (1) modeling uncertainty in web log sequences using the most recent periodic web log which attaches computed existential probabilities between 0 and 1, to events in the sequences, (2) using the newly proposed uncertain PLWAP web sequential miner for these uncertain access sequences. While PLWAP only considers a session of web logs, U-PLWAP takes more sessions of web logs from which existential probabilities are generated and there is the need to traverse each suffix tree from the root in order to scan for existential probabilities of items already found along the path. Experiments show that U-PLWAP is faster than U-Apriori, and UF-growth.