Sciweavers

148 search results - page 8 / 30
» Mining top-K frequent itemsets from data streams
Sort
View
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 3 months ago
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun ...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 1 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
14 years 2 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
CIVR
2006
Springer
104views Image Analysis» more  CIVR 2006»
14 years 8 days ago
Video Mining with Frequent Itemset Configurations
Abstract. We present a method for mining frequently occurring objects and scenes from videos. Object candidates are detected by finding recurring spatial arrangements of affine cov...
Till Quack, Vittorio Ferrari, Luc J. Van Gool
SAC
2006
ACM
14 years 2 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht