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
.
Pattern lattice traversal by selective jumps
2005
Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining - KDD '05
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of the lattice of candidate patterns. We study the existing depth versus breadth traversal approaches for generating candidate patterns and propose in this paper a new traversal approach that jumps in the search space among only promising nodes. Our leaping approach avoids nodes that would not participate in the answer set
doi:10.1145/1081870.1081964
dblp:conf/kdd/ZaianeE05
fatcat:ff3kruf24jg6toqtu4qlfjy2gu