502 search results - page 34 / 101 » Mining Supplemental Frequent Patterns |
JIIS
2011
13 years 4 months ago
2011
The discovery of frequent musical patterns (motifs) is a relevant problem in musicology. This paper introduces an unsupervised algorithm to address this problem in symbolically-rep...
DIS
2004
Springer
14 years 1 months ago
2004
Springer
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
PAKDD
2004
ACM
14 years 3 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
ICTAI
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...