Sciweavers

395 search results - page 25 / 79
» Learning to rank with partially-labeled data
Sort
View
TNN
2010
127views Management» more  TNN 2010»
14 years 8 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
SIGIR
2008
ACM
15 years 1 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
CIKM
2010
Springer
15 years 14 days ago
Online learning for recency search ranking using real-time user feedback
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
Taesup Moon, Lihong Li, Wei Chu, Ciya Liao, Zhaohu...
BMCBI
2010
224views more  BMCBI 2010»
15 years 2 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
ICDE
2009
IEEE
251views Database» more  ICDE 2009»
16 years 3 months ago
Contextual Ranking of Keywords Using Click Data
The problem of automatically extracting the most interesting and relevant keyword phrases in a document has been studied extensively as it is crucial for a number of applications. ...
Utku Irmak, Vadim von Brzeski, Reiner Kraft