Sciweavers

113 search results - page 15 / 23
» Locally adaptive metrics for clustering high dimensional dat...
Sort
View
ICCV
2009
IEEE
15 years 10 days ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 1 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
NIPS
2004
13 years 8 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
DEXAW
1999
IEEE
152views Database» more  DEXAW 1999»
13 years 11 months ago
Advanced Metrics for Class-Driven Similarity Search
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
Paolo Avesani, Enrico Blanzieri, Francesco Ricci
CF
2006
ACM
13 years 9 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander