1013 search results - page 37 / 203 » Comparisons Between Data Clustering Algorithms |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper deals with overlapping clustering, a trade off between crisp and fuzzy clustering. It has been motivated by recent applications in various domains such as information r...
EWSN
2004
Springer
14 years 7 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
ICDM
2002
IEEE
14 years 19 days ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
IV
2005
IEEE
14 years 1 months ago
2005
IEEE
Do we judge similarity between two objects to be the same using touch and vision? We investigated this using psychophysical experiments in which subjects rated the similarity betw...