Sciweavers

292 search results - page 3 / 59
» Discriminative K-means for Clustering
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 5 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
CORR
2011
Springer
154views Education» more  CORR 2011»
12 years 9 months ago
A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation
— This paper shows that the k-means quantization of a signal can be interpreted both as a crisp indicator function and as a fuzzy membership assignment describing fuzzy clusters ...
Nicolaie Popescu-Bodorin
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 5 months ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin
KES
2007
Springer
13 years 11 months ago
A Hierarchical Clustering Method for Semantic Knowledge Bases
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
Nicola Fanizzi, Claudia d'Amato
AIIA
2007
Springer
13 years 11 months ago
A Hierarchical Clustering Procedure for Semantically Annotated Resources
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito