5962 search results - page 263 / 1193 » Efficient Clustering for Orders |
186
click to vote
CIS
2008
Springer
15 years 8 months ago
2008
Springer
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
191
click to vote
CIVR
2008
Springer
15 years 8 months ago
2008
Springer
Browsing and finding pictures in large-scale and heterogeneous collections is an important issue, most particularly for online photo sharing applications. Since such services know...
205
click to vote
ESANN
2000
15 years 8 months ago
2000
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
208
click to vote
JMM2
2008
15 years 6 months ago
2008
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
192
click to vote
PAMI
2006
15 years 6 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...