![]() |
Volumn , Issue , 2008, Pages 99-106
|
A boosting algorithm for learning bipartite ranking functions with partially labeled data
|
Author keywords
Boosting; Information routing; Learning to rank with partially labeled data
|
Indexed keywords
INFORMATION RETRIEVAL;
INFORMATION SERVICES;
PROBABILITY DENSITY FUNCTION;
RESEARCH AND DEVELOPMENT MANAGEMENT;
BOOSTING;
BOOSTING ALGORITHMS;
DATA COLLECTIONS;
INFORMATION ROUTING;
LEARNING TO RANK WITH PARTIALLY LABELED DATA;
MEAN PRECISIONS;
OHSUMED;
PARTIALLY LABELED DATUMS;
RANKING ALGORITHMS;
RANKING FUNCTIONS;
RANKING MEASURES;
REUTERS;
SUPERVISED CLASSIFICATIONS;
TEST POINTS;
UNLABELED DATUMS;
LEARNING ALGORITHMS;
|
EID: 57349154278
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/1390334.1390354 Document Type: Conference Paper |
Times cited : (64)
|
References (24)
|