Sciweavers

94 search results - page 10 / 19
» Efficient Frequent Itemsets Mining by Sampling
Sort
View
KAIS
2008
114views more  KAIS 2008»
14 years 9 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
PPOPP
2005
ACM
15 years 3 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 3 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
15 years 9 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
LWA
2004
14 years 10 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist