Sciweavers

3395 search results - page 190 / 679
» Learning to efficiently rank
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 3 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
MHCI
2009
Springer
15 years 10 months ago
Automatic mobile menu customization based on user operation history
Mobile devices are becoming more and more difficult to use due to the sheer number of functions now supported. In this paper, we propose a menu customization system that ranks fun...
Yusuke Fukazawa, Mirai Hara, Masashi Onogi, Hideto...
135
Voted
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 7 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
156
Voted
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
15 years 10 months ago
Unsupervised Face Annotation by Mining the Web
Searching for images of people is an essential task for image and video search engines. However, current search engines have limited capabilities for this task since they rely on ...
Duy-Dinh Le, Shin'ichi Satoh
135
Voted
NIPS
2004
15 years 5 months ago
Confidence Intervals for the Area Under the ROC Curve
In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
Corinna Cortes, Mehryar Mohri