Sciweavers

136 search results - page 4 / 28
» CloseGraph: mining closed frequent graph patterns
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 8 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
14 years 9 months ago
Mining Colossal Frequent Patterns by Core Pattern Fusion
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, H...
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
14 years 1 months ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
DIS
2004
Springer
13 years 11 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: 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...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
14 years 1 months ago
TSP: Mining Top-K Closed Sequential Patterns
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the min...
Petre Tzvetkov, Xifeng Yan, Jiawei Han