Sciweavers

313 search results - page 14 / 63
» Mining Frequent Itemsets in a Stream
Sort
View
80
Voted
ICANN
2005
Springer
15 years 3 months ago
Principles of Employing a Self-organizing Map as a Frequent Itemset Miner
This work proposes a theoretical guideline in the specific area of Frequent Itemset Mining (FIM). It supports the hypothesis that the use of neural network technology for the prob...
Vicente O. Baez-Monroy, Simon O'Keefe
95
Voted
EDBT
2008
ACM
206views Database» more  EDBT 2008»
15 years 9 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
PAKDD
2007
ACM
148views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Mining Frequent Itemsets from Uncertain Data
Abstract. We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential...
Chun Kit Chui, Ben Kao, Edward Hung
91
Voted
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
15 years 4 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