Sciweavers

1217 search results - page 43 / 244
» On compressing frequent patterns
Sort
View
130
Voted
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
15 years 8 months ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han
132
Voted
ADMA
2008
Springer
87views Data Mining» more  ADMA 2008»
15 years 5 months ago
Negative Generator Border for Effective Pattern Maintenance
In this paper, we study the maintenance of frequent patterns in the context of the generator representation. The generator representation is a concise and lossless representation o...
Mengling Feng, Jinyan Li, Limsoon Wong, Yap-Peng T...
142
Voted
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
15 years 5 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
127
Voted
JIIS
2011
99views more  JIIS 2011»
14 years 10 months ago
Mining transposed motifs in music
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...
Aída Jiménez, Miguel Molina-Solana, ...
175
Voted
IEAAIE
2009
Springer
15 years 10 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...