A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
PLWAP sequential mining
2005
Proceedings of the 1st international workshop on open source data mining frequent pattern mining implementations - OSDM '05
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
doi:10.1145/1133905.1133910
fatcat:xofhr5zqy5hgfjqda34lkr5qre