Sciweavers

259 search results - page 27 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
CIKM
2008
Springer
14 years 11 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
117
Voted
ESANN
2006
14 years 11 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
FOCS
2008
IEEE
15 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ECCV
2000
Springer
15 years 11 months ago
Egomotion Estimation Using Quadruples of Collinear Image Points
This paper considers a fundamental problem in visual motion perception, namely the problem of egomotion estimation based on visual input. Many of the existing techniques for solvin...
Manolis I. A. Lourakis
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 2 days ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...