Sciweavers

165 search results - page 15 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 3 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
TKDE
2008
94views more  TKDE 2008»
13 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...
MDAI
2010
Springer
13 years 7 months ago
Pattern Mining on Stars with FP-Growth
Abstract. Most existing data mining (DM) approaches look for patterns in a single table. Multi-relational DM approaches, on the other hand, look for patterns that involve multiple ...
Andreia Silva, Cláudia Antunes
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 10 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh