Sciweavers

156 search results - page 24 / 32
» Mining Frequent Itemsets from Secondary Memory
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
14 years 1 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 7 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
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
14 years 7 months ago
Sequential PAttern mining using a bitmap representation
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Y...
SIGSOFT
2005
ACM
14 years 29 days ago
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Programs usually follow many implicit programming rules, most of which are too tedious to be documented by programmers. When these rules are violated by programmers who are unawar...
Zhenmin Li, Yuanyuan Zhou