Sciweavers

1403 search results - page 18 / 281
» Set cover algorithms for very large datasets
Sort
View
IDEAL
2003
Springer
14 years 1 months ago
Association Rule Mining Algorithms for Set-Valued Data
This paper presents an association rule mining system that is capable of handling set-valued attributes. Our previous research has exposed us to a variety of real-world biological ...
Christopher A. Shoemaker, Carolina Ruiz
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
14 years 2 months ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
ICML
2009
IEEE
14 years 9 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 1 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 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