Sciweavers

2245 search results - page 40 / 449
» Metrics that Learn Relevance
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Learning Metrics via Discriminant Kernels and Multidimensional Scaling: Toward Expected Euclidean Representation
Distance-based methods in machine learning and pattern recognition have to rely on a metric distance between points in the input space. Instead of specifying a metric a priori, we...
Zhihua Zhang
ACE
2004
162views Education» more  ACE 2004»
13 years 9 months ago
Computing Theory With Relevance
In computer science education, the topic of computing theory is one that is commonly not well received by students. Career-oriented students often view the topic as irrelevant, an...
Wayne Brookes
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 9 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
CVPR
2012
IEEE
11 years 10 months ago
Learning hierarchical similarity metrics
Categories in multi-class data are often part of an underlying semantic taxonomy. Recent work in object classification has found interesting ways to use this taxonomy structure t...
Nakul Verma, Dhruv Mahajan, Sundararajan Sellamani...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 8 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu