Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ICDM
2005
IEEE

favoriteEmaildiscussreport

134views Data Mining» more ICDM 2005»

A Preference Model for Structured Supervised Learning Tasks

13 years 10 months ago

A Preference Model for Structured Supervised Learning Tasks

Download www.math.unipd.it

The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, such as predicting orders (label and instance ranking), and predicting rates (classiﬁcation and ordinal regression). We show how all these problems can be cast as linear problems in an augmented space, and we propose an on-line method to efﬁciently solve them. Experiments on an ordinal regression task conﬁrm the effectiveness of the approach.

Fabio Aiolli

Real-time Traffic

Data Mining | ICDM 2005 | Ordinal Regression | Ordinal Regression Task | Supervised Learning Problems |

claim paper

Related Content

» Automatic Event Extraction with Structured Preference Modeling

» Learning Probabilistic Hierarchical Task Networks to Capture User Preferences

» MultiTask Transfer Learning for WeaklySupervised Relation Extraction

» Efficient GraphBased SemiSupervised Learning of Structured Tagging Models

» Guiding SemiSupervision with ConstraintDriven Learning

» Competitive generative models with structure learning for NLP classification tasks

» Supervised Learning of a Probabilistic Lexicon of Verb Semantic Classes

» Learning valued preference structures for solving classification problems

» Semisupervised latent variable models for sentencelevel sentiment analysis

Post Info
More Details (n/a)

Added	24 Jun 2010
Updated	24 Jun 2010
Type	Conference
Year	2005
Where	ICDM
Authors	Fabio Aiolli

Comments (0)