Depth first generation of long patterns
Lists
Only you see this
Abstract
ABSTRACT In this paper we present an algorithm for mining long patterns in databases. The algorithm nds large itemsets by using depth rst search on a lexicographic tree of itemsets. The focus of this paper is to develop CPU-e cient algorithms for nding frequent itemsets in the cases when the database contains patterns which are very wide. We refer to this algorithm as DepthProject, and it achieves more than one order of magnitude speedup over the recently proposed MaxMiner algorithm for nding long patterns. These techniques may be quite useful for applications in areas such as computational biology in which the number of records is relatively small, but the itemsets are very long. This necessitates the discovery of patterns using algorithms which are especially tailored to the nature of such domains.
BibTeX
@inproceedings{agarwal2000depth,
author = {Ramesh C. Agarwal and Charu C. Aggarwal and V. V. V. Prasad},
title = {{Depth first generation of long patterns}},
booktitle = {ACM SIGKDD Conference on Knowledge Discovery and Data Mining},
year = {2000},
doi = {10.1145/347090.347114},
}Loading related content...