Sciweavers

5595 search results - page 300 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
BMCBI
2008
117views more  BMCBI 2008»
15 years 6 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 8 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 1 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
ECCV
2004
Springer
16 years 8 months ago
Image Clustering with Metric, Local Linear Structure, and Affine Symmetry
Abstract. This paper addresses the problem of clustering images of objects seen from different viewpoints. That is, given an unlabelled set of images of n objects, we seek an unsup...
Jongwoo Lim, Jeffrey Ho, Ming-Hsuan Yang, Kuang-Ch...
ICANN
2009
Springer
15 years 11 months ago
A Two Stage Clustering Method Combining Self-Organizing Maps and Ant K-Means
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...