Sciweavers

476 search results - page 33 / 96
» Learning a Distance Metric from Relative Comparisons
Sort
View
ICDM
2005
IEEE
117views Data Mining» more  ICDM 2005»
14 years 2 months ago
On Learning Asymmetric Dissimilarity Measures
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measure...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
CVPR
2010
IEEE
14 years 1 months ago
The Automatic Design of Feature Spaces for Local Image Descriptors using an Ensemble of Non-linear Feature Extractors
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
Gustavo Carneiro
ACL
2012
11 years 11 months ago
Labeling Documents with Timestamps: Learning from their Time Expressions
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
Nathanael Chambers
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
14 years 11 days ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
ICML
2006
IEEE
14 years 9 months ago
Local distance preservation in the GP-LVM through back constraints
The Gaussian process latent variable model (GP-LVM) is a generative approach to nonlinear low dimensional embedding, that provides a smooth probabilistic mapping from latent to da...
Joaquin Quiñonero Candela, Neil D. Lawrence