310 search results - page 9 / 62 » High-Dimensional Similarity Joins |
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
APWEB
2006
Springer
14 years 11 days ago
2006
Springer
Clustering is to identify densely populated subgroups in data, while correlation analysis is to find the dependency between the attributes of the data set. In this paper, we combin...
BTW
2009
Springer
13 years 12 months ago
2009
Springer
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
SDM
2004
SIAM
13 years 10 months ago
2004
SIAM
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
UAI
2000
13 years 10 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...