An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

Abstract

Mining frequently appearing patterns in a database is a basic problem in informatics, especially in data mining. Particularly, when the input database is a collection of subsets of an itemset, the problem is called the frequent itemset mining problem, and has been extensively studied. In the real-world use, one of difficulties of frequent itemset mining is… (More)
DOI: 10.1007/978-3-540-75488-6_21

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Uno2007AnEP, title={An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining}, author={Takeaki Uno and Hiroki Arimura}, booktitle={Discovery Science}, year={2007} }