Sciweavers

1839 search results - page 102 / 368
» Feature Selection in Clustering Problems
Sort
View
PRIS
2004
15 years 4 months ago
Comparison of Combination Methods using Spectral Clustering Ensembles
We address the problem of the combination of multiple data partitions, that we call a clustering ensemble. We use a recent clustering approach, known as Spectral Clustering, and th...
André Lourenço, Ana L. N. Fred
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
15 years 9 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
CCGRID
2006
IEEE
15 years 9 months ago
A Failure-Aware Scheduling Strategy in Large-Scale Cluster System
As the scale is expanding, node failure becomes a commonplace feature of large-scale cluster systems. As an important part of cluster operating system software, job scheduling tak...
Linping Wu, Dan Meng, Jianfeng Zhan, Wang Lei, Bib...
ICALP
2004
Springer
15 years 8 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
DATAMINE
1999
140views more  DATAMINE 1999»
15 years 2 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...