Sciweavers

256 search results - page 28 / 52
» Approximation Algorithms for Hamming Clustering Problems
Sort
View
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 1 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
CVPR
2006
IEEE
15 years 11 months ago
Recursive estimation of generative models of video
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
Nemanja Petrovic, Aleksandar Ivanovic, Nebojsa Joj...
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
14 years 13 days ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
ICDM
2005
IEEE
146views Data Mining» more  ICDM 2005»
15 years 3 months ago
Merging Interface Schemas on the Deep Web via Clustering Aggregation
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
Wensheng Wu, AnHai Doan, Clement T. Yu
PAMI
2011
14 years 4 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...