Sciweavers

4177 search results - page 60 / 836
» On the Performance of Ant-based Clustering
Sort
View
MLMTA
2007
15 years 7 months ago
A Novel Hybrid Neural Network for Data Clustering
- Clustering plays an indispensable role for data analysis. Many clustering algorithms have been developed. However, most of them suffer either poor performance of unsupervised lea...
Donghai Guan, Andrey Gavrilov, Weiwei Yuan, Young-...
UAI
1998
15 years 7 months ago
An Experimental Comparison of Several Clustering and Initialization Methods
We examine methods for clustering in high dimensions. In the first part of the paper, we perform an experimental comparison between three batch clustering algorithms: the Expectat...
Marina Meila, David Heckerman
JMLR
2010
225views more  JMLR 2010»
15 years 28 days ago
Hartigan's Method: k-means Clustering without Voronoi
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
Matus Telgarsky, Andrea Vattani
HPDC
2012
IEEE
13 years 8 months ago
VNET/P: bridging the cloud and high performance computing through fast overlay networking
networking with a layer 2 abstraction provides a powerful model for virtualized wide-area distributed computing resources, including for high performance computing (HPC) on collec...
Lei Xia, Zheng Cui, John R. Lange, Yuan Tang, Pete...
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
15 years 10 months ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette