Sciweavers

812 search results - page 133 / 163
» Preference-based learning to rank
Sort
View
AAAI
2004
13 years 9 months ago
Text Classification by Labeling Words
Traditionally, text classifiers are built from labeled training examples. Labeling is usually done manually by human experts (or the users), which is a labor intensive and time co...
Bing Liu, Xiaoli Li, Wee Sun Lee, Philip S. Yu
MM
2010
ACM
219views Multimedia» more  MM 2010»
13 years 8 months ago
A framework for photo-quality assessment and enhancement based on visual aesthetics
We present an interactive application that enables users to improve the visual aesthetics of their digital photographs using spatial recomposition. Unlike earlier work that focuse...
Subhabrata Bhattacharya, Rahul Sukthankar, Mubarak...
ML
2000
ACM
185views Machine Learning» more  ML 2000»
13 years 8 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
CIKM
2011
Springer
12 years 8 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 9 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen