679 search results - page 31 / 136 » Scaling Clustering Algorithms to Large Databases |
SPIESR
2004
13 years 10 months ago
2004
To allow efficient browsing of large image collections, we have to provide a summary of its visual content. We present in this paper a robust approach to organize image databases:...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
IJCNN
2008
IEEE
14 years 2 months ago
2008
IEEE
—Normalization before clustering is often needed for proximity indices, such as Euclidian distance, which are sensitive to differences in the magnitude or scales of the attribute...
SIGMOD
1998
ACM
14 years 22 days ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...