2827 search results - page 47 / 566 » Robustness of PSPACE-complete sets |
CSDA
2004
13 years 7 months ago
2004
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
AAAI
2010
13 years 9 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper evaluates the robustness of learning from implicit feedback in web search. In particular, we create a model of user behavior by drawing upon user studies in laboratory ...
ESANN
2003
13 years 9 months ago
2003
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
BMCBI
2007
13 years 7 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...