Sciweavers

745 search results - page 21 / 149
» A Preference Model for Structured Supervised Learning Tasks
Sort
View
NIPS
2008
14 years 11 months ago
Supervised Exponential Family Principal Component Analysis via Convex Optimization
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
Yuhong Guo
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
15 years 3 months ago
Preference Networks: Probabilistic Models for Recommendation Systems
Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Prefer...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh
NLPRS
2001
Springer
15 years 2 months ago
A Bayesian Approach to Semi-Supervised Learning
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
Rebecca F. Bruce
IJCAI
2003
14 years 11 months ago
When Discriminative Learning of Bayesian Network Parameters Is Easy
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...
Hannes Wettig, Peter Grünwald, Teemu Roos, Pe...
ICML
2010
IEEE
14 years 10 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan