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:...
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...
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...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
—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...
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopul...