Sciweavers

625 search results - page 11 / 125
» Projective Clustering Ensembles
Sort
View
CVPR
2003
IEEE
14 years 12 months ago
Robust Data Clustering
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
Ana L. N. Fred, Anil K. Jain
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 10 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
DIS
2006
Springer
14 years 1 months ago
A Novel Framework for Discovering Robust Cluster Results
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
Hye-Sung Yoon, Sang-Ho Lee, Sung-Bum Cho, Ju Han K...
DAGM
2008
Springer
13 years 11 months ago
Boosting for Model-Based Data Clustering
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
Amir Saffari, Horst Bischof
ICDAR
2011
IEEE
12 years 9 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...