Sciweavers

Share
33 search results - page 1 / 7
» Solving cluster ensemble problems by bipartite graph partiti...
Sort
View
ICML
2004
IEEE
12 years 2 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
12 years 1 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
ICDM
2010
IEEE
198views Data Mining» more  ICDM 2010»
10 years 11 months ago
Hierarchical Ensemble Clustering
Ensemble clustering has emerged as an important elaboration of the classical clustering problems. Ensemble clustering refers to the situation in which a number of different (input)...
Li Zheng, Tao Li, Chris H. Q. Ding
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
11 years 8 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
JMMA
2010
162views more  JMMA 2010»
10 years 8 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
books