Sciweavers

686 search results - page 71 / 138
» Minimax Probability Machine
Sort
View
CORR
1998
Springer
106views Education» more  CORR 1998»
13 years 10 months ago
Lower Bounds for Quantum Search and Derandomization
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
Harry Buhrman, Ronald de Wolf
CIKM
2010
Springer
13 years 8 months ago
Clickthrough-based translation models for web search: from word models to phrase models
Web search is challenging partly due to the fact that search queries and Web documents use different language styles and vocabularies. This paper provides a quantitative analysis ...
Jianfeng Gao, Xiaodong He, Jian-Yun Nie
ECAI
2010
Springer
13 years 8 months ago
Describing the Result of a Classifier to the End-User: Geometric-based Sensitivity
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...
Isabelle Alvarez, Sophie Martin, Salma Mesmoudi
ICDM
2009
IEEE
107views Data Mining» more  ICDM 2009»
13 years 8 months ago
Naive Bayes Classification of Uncertain Data
Traditional machine learning algorithms assume that data are exact or precise. However, this assumption may not hold in some situations because of data uncertainty arising from mea...
Jiangtao Ren, Sau Dan Lee, Xianlu Chen, Ben Kao, R...
COLT
2005
Springer
14 years 3 months ago
Trading in Markovian Price Models
We examine a Markovian model for the price evolution of a stock, in which the probability of local upward or downward movement is arbitrarily dependent on the current price itself...
Sham M. Kakade, Michael J. Kearns