1599 search results - page 238 / 320 » Theoretical Frameworks for Data Mining |
KDD
2008
ACM
14 years 9 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...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
WSDM
2010
ACM
14 years 6 months ago
2010
ACM
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...