Sciweavers

36 search results - page 1 / 8
» A Novel Spectral Clustering Method Based on Pairwise Distanc...
Sort
View
JISE
2010
52views more  JISE 2010»
12 years 11 months ago
A Novel Spectral Clustering Method Based on Pairwise Distance Matrix
Chi-Fang Chin, Arthur Chun-Chieh Shih, Kuo-Chin Fa...
DIS
2006
Springer
13 years 8 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
CVPR
2008
IEEE
14 years 6 months ago
Constrained spectral clustering through affinity propagation
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
Miguel Á. Carreira-Perpiñán, ...
PRL
2008
135views more  PRL 2008»
13 years 4 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
ICPR
2010
IEEE
13 years 2 months ago
Speaker Change Detection Based on the Pairwise Distance Matrix
Speaker change detection is most commonly done by statistically determining whether the two adjacent segments of a speech stream are significantly different or not. In this paper, ...
Jin S. Seo