Sciweavers

211 search results - page 18 / 43
» Restricting the IDM for Classification
Sort
View
SIAMCOMP
2008
140views more  SIAMCOMP 2008»
13 years 7 months ago
The Forgetron: A Kernel-Based Perceptron on a Budget
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
PRIS
2008
13 years 9 months ago
Comparison of Adaboost and ADTboost for Feature Subset Selection
Abstract. This paper addresses the problem of feature selection within classification processes. We present a comparison of a feature subset selection with respect to two boosting ...
Martin Drauschke, Wolfgang Förstner
AAAI
2006
13 years 9 months ago
Optimizing Similarity Assessment in Case-Based Reasoning
The definition of accurate similarity measures is a key issue of every Case-Based Reasoning application. Although some approaches to optimize similarity measures automatically hav...
Armin Stahl, Thomas Gabel
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
CP
2006
Springer
13 years 11 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh