PLWAP sequential mining: Open source code
Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
pre-order linkage, sequential patterns, WAP tree, web usage mining
PLWAP algorithm uses a preorder linked, position coded version of WAP tree and eliminates the need to recursively re-construct intermediate WAP trees during sequential mining as done by WAP tree technique. PLWAP produces significant reduction in response time achieved by the WAP algorithm and provides a position code mechanism for remembering the stored database, thus, eliminating the need to re-scan the original database as would be necessary for applications like those incrementally maintaining mined frequent patterns, performing stream or dynamic mining. This paper presents open source code for both the PLWAP and WAP algorithms describing our implementations and experimental performance analysis of these two algorithms on synthetic data generated with IBM quest data generator. An implementation of the Apriori-like GSP sequential mining algorithm is also discussed and submitted. A web log pre-processor for producing real input to the algorithms is made available too. Copyright 2005 ACM.
Ezeife, C. I.; Lu, Yi; and Liu, Yi. (2005). PLWAP sequential mining: Open source code. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 26-35.