Sciweavers

199 search results - page 17 / 40
» Accuracy of distance metric learning algorithms
Sort
View
92
Voted
NPL
2002
103views more  NPL 2002»
15 years 3 days ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang
IMR
2003
Springer
15 years 5 months ago
Geodesic-based Surface Remeshing
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
Oren Sifri, Alla Sheffer, Craig Gotsman
101
Voted
TKDE
2008
112views more  TKDE 2008»
15 years 11 days ago
IDD: A Supervised Interval Distance-Based Method for Discretization
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...
111
Voted
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
16 years 5 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg
BMCBI
2011
14 years 4 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto