Sciweavers

395 search results - page 60 / 79
» Learning to rank with partially-labeled data
Sort
View
CORR
2006
Springer
118views Education» more  CORR 2006»
14 years 11 months ago
Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well kn...
Filip Radlinski, Thorsten Joachims
148
Voted
PAMI
2012
13 years 2 months ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre
WWW
2004
ACM
16 years 12 days ago
Is question answering an acquired skill?
We present a question answering (QA) system which learns how to detect and rank answer passages by analyzing questions and their answers (QA pairs) provided as training data. We b...
Ganesh Ramakrishnan, Soumen Chakrabarti, Deepa Par...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 5 months ago
Stability of Feature Selection Algorithms
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
142
Voted
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 2 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich