Sciweavers

573 search results - page 34 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
14 years 2 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
14 years 29 days ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
14 years 8 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
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 5 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
KDD
2002
ACM
189views Data Mining» more  KDD 2002»
14 years 8 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...