Sciweavers

302 search results - page 29 / 61
» Efficient frequent pattern mining over data streams
Sort
View
91
Voted
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
15 years 10 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer
85
Voted
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
15 years 10 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
TKDE
2008
94views more  TKDE 2008»
14 years 9 months ago
DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
Alexandre Termier, Marie-Christine Rousset, Mich&e...
73
Voted
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
15 years 10 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...