Sciweavers

1484 search results - page 80 / 297
» Semi-supervised Learning from General Unlabeled Data
Sort
View
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 8 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
ICML
2010
IEEE
13 years 9 months ago
Active Risk Estimation
We address the problem of evaluating the risk of a given model accurately at minimal labeling costs. This problem occurs in situations in which risk estimates cannot be obtained f...
Christoph Sawade, Niels Landwehr, Steffen Bickel, ...
ICML
2002
IEEE
14 years 8 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 10 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
KDD
1998
ACM
106views Data Mining» more  KDD 1998»
14 years 1 days ago
Simultaneous Reliability Evaluation of Generality and Accuracy for Rule Discovery in Databases
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
Einoshin Suzuki