Sciweavers

843 search results - page 15 / 169
» Learning aspect models with partially labeled data
Sort
View
AI
2008
Springer
13 years 7 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
ICML
2010
IEEE
13 years 8 months ago
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...
ICGI
2004
Springer
14 years 23 days ago
Partial Learning Using Link Grammars Data
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
Erwan Moreau
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
AAAI
2008
13 years 9 months ago
Hidden Dynamic Probabilistic Models for Labeling Sequence Data
We propose a new discriminative framework, namely Hidden Dynamic Conditional Random Fields (HDCRFs), for building probabilistic models which can capture both internal and external...
Xiaofeng Yu, Wai Lam