Can I read Exploiting succinct constraints using FP-trees on EtoBox?

Exploiting succinct constraints using FP-trees by Carson Kai-Sang Leung; Laks V. S. Lakshmanan; Raymond T. Ng is a Computer Science article available to read on EtoBox.

What is Exploiting succinct constraints using FP-trees about?

Since its introduction, frequent-set mining has been generalized to many forms, which include constrained data mining. The use of __constraints__ permits user focus and guidance, enables user exploration and control, and leads to effective pruning of the search space and efficient mining of frequent itemsets. In this paper, we focus on the use of __succinct constraints.__ In particular, we propose a novel algorithm called __FPS__ to mine frequent itemsets satisfying succinct constraints. The FPS algorithm avoids the generate-and-test paradigm by exploiting succinctness properties of the constraints in a FP-tree based framework. In terms of functionality, our algorithm is capable of handling not just the succinct aggregate constraint, but any succinct constraint in general. Moreover, it handles multiple succinct constraints. In terms of performance, our algorithm is more efficient and effective than existing FP-tree based constrained frequent-set mining algorithms.

Who reads Exploiting succinct constraints using FP-trees?

Author

Carson Kai-Sang Leung; Laks V. S. Lakshmanan; Raymond T. Ng

Publisher

ACM

Published

2002

Language

EN

Field

Computer Science (Physical Sciences)