Sciweavers

395 search results - page 6 / 79
» Learning to rank with partially-labeled data
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 6 days 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
ICCV
2009
IEEE
14 years 9 months ago
Efficient multi-label ranking for multi-class learning: Application to object recognition
Multi-label learning is useful in visual object recognition when several objects are present in an image. Conventional approaches implement multi-label learning as a set of binary...
Serhat Selcuk Bucak, Pavan Kumar Mallapragada, Ron...
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
13 years 7 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
ECML
2007
Springer
15 years 5 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
119
Voted
AAAI
2012
13 years 2 months ago
Learning the Kernel Matrix with Low-Rank Multiplicative Shaping
Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) ...
Tomer Levinboim, Fei Sha