1013 search results - page 15 / 203 » Comparisons Between Data Clustering Algorithms |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
CLASSIFICATION
2010
13 years 5 months ago
2010
: The issue of determining "the right number of clusters" in K-Means has attracted considerable interest, especially in the recent years. Cluster intermix appears to be a...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....