30 search results - page 2 / 6 » Efficient clustering of high-dimensional data sets with appl... |
KDD
2008
ACM
14 years 5 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
CGF
2010
13 years 2 months ago
2010
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
SDM
2008
SIAM
13 years 6 months ago
2008
SIAM
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
BTW
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...