DMCA
On closed constrained frequent pattern mining (2004)
Cached
Download Links
- [www-kdd.isti.cnr.it]
- [www.francescobonchi.com]
- [hpc.isti.cnr.it]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. IEEE Int. Conf. on Data Mining ICDM’04 |
| Citations: | 24 - 3 self |
BibTeX
@INPROCEEDINGS{Bonchi04onclosed,
author = {Francesco Bonchi},
title = {On closed constrained frequent pattern mining},
booktitle = {In Proc. IEEE Int. Conf. on Data Mining ICDM’04},
year = {2004},
pages = {35--42},
publisher = {Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of work has been done with both these paradigms, there is still confusion around the mining problem obtained by joining closed and constrained frequent patterns in a unique framework. In this paper we shed light on this problem by providing a formal definition and a thorough characterization. We also study computational issues and show how to combine the most recent results in both paradigms, providing a very efficient algorithm which exploits the two requirements (satisfying constraints and being closed) together at mining time in order to reduce the computation as much as possible. 1.
