Sciweavers

311 search results - page 12 / 63
» Learning to rank: from pairwise approach to listwise approac...
Sort
View
AAAI
2012
11 years 11 months ago
Learning the Kernel Matrix with Low-Rank Multiplicative Shaping
Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) ...
Tomer Levinboim, Fei Sha
IR
2010
13 years 7 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu
ICML
2008
IEEE
14 years 9 months ago
A reproducing kernel Hilbert space framework for pairwise time series distances
A good distance measure for time series needs to properly incorporate the temporal structure, and should be applicable to sequences with unequal lengths. In this paper, we propose...
Zhengdong Lu, Todd K. Leen, Yonghong Huang, Deniz ...
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
14 years 2 months ago
Ensemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
Kees Jong, Jérémie Mary, Antoine Cor...
SAC
2008
ACM
13 years 8 months ago
Pattern ranking for semi-automatic ontology construction
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
Eva Blomqvist