Sciweavers

576 search results - page 7 / 116
» Structured metric learning for high dimensional problems
Sort
View
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
14 years 2 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro
ICML
2009
IEEE
14 years 8 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
13 years 12 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
IPCO
1992
112views Optimization» more  IPCO 1992»
13 years 8 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
CGF
2011
12 years 11 months ago
Visualizing High-Dimensional Structures by Dimension Ordering and Filtering using Subspace Analysis
High-dimensional data visualization is receiving increasing interest because of the growing abundance of highdimensional datasets. To understand such datasets, visualization of th...
Bilkis J. Ferdosi, Jos B. T. M. Roerdink