Sciweavers

888 search results - page 28 / 178
» Learning to Select a Ranking Function
Sort
View
WSDM
2010
ACM
245views Data Mining» more  WSDM 2010»
14 years 5 months ago
Improving Quality of Training Data for Learning to Rank Using Click-Through Data
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work ha...
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li, Elbi...
ICML
2005
IEEE
14 years 8 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 3 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...
HICSS
2006
IEEE
163views Biometrics» more  HICSS 2006»
14 years 1 months ago
Learning Ranking vs. Modeling Relevance
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...
Dmitri Roussinov, Weiguo Fan
ICML
2003
IEEE
14 years 8 months ago
Weighted Order Statistic Classifiers with Large Rank-Order Margin
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
Reid B. Porter, Damian Eads, Don R. Hush, James Th...