Sciweavers

7215 search results - page 974 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
EWRL
2008
15 years 8 months ago
Markov Decision Processes with Arbitrary Reward Processes
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
Jia Yuan Yu, Shie Mannor, Nahum Shimkin
EUSFLAT
2007
129views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Dealing with Incompleteness of Preferences in Group Decision Making Problems
While considering processes of decision making we often encounter the problem of incomplete information. In group decision making (GDM) problems each decision maker is supposed to...
Anna Pankowska
EMNLP
2008
15 years 8 months ago
It's a Contradiction - no, it's not: A Case Study using Functional Relations
Contradiction Detection (CD) in text is a difficult NLP task. We investigate CD over functions (e.g., BornIn(Person)=Place), and present a domain-independent algorithm that automa...
Alan Ritter, Stephen Soderland, Doug Downey, Oren ...
HIS
2008
15 years 8 months ago
Evolutionary Training Set Selection to Optimize C4.5 in Imbalanced Problems
Classification in imbalanced domains is a recent challenge in machine learning. We refer to imbalanced classification when data presents many examples from one class and few from ...
Salvador García, Francisco Herrera
IJCAI
2007
15 years 8 months ago
Occam's Razor Just Got Sharper
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
Saher Esmeir, Shaul Markovitch