Sciweavers

255 search results - page 4 / 51
» On Online Learning of Decision Lists
Sort
View
ICML
1994
IEEE
13 years 10 months ago
Reducing Misclassification Costs
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...
Michael J. Pazzani, Christopher J. Merz, Patrick M...
COLING
1996
13 years 8 months ago
Learning to Recognize Names Across Languages
The development of natural language proccssing (NLP) systems that perform machine translation (MT) and information retrieval (IR) has highlighted the need for the automatic recogn...
Anthony F. Gallippi
ALT
2008
Springer
14 years 4 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 8 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon