Sciweavers

394 search results - page 54 / 79
» Multiclass-Multilabel Classification with More Classes than ...
Sort
View
APAL
2005
119views more  APAL 2005»
13 years 8 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer
ICML
2005
IEEE
14 years 9 months ago
A smoothed boosting algorithm using probabilistic output codes
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
Rong Jin, Jian Zhang
FMLDO
1990
Springer
86views Database» more  FMLDO 1990»
14 years 4 days ago
Views in Object-Oriented Databases
Object-oriented database systems (ooDBMSs) are supposed to offer at least the functionality available in commercial relational DBMSs of today. One important consequence of this is...
Marc H. Scholl, Christian Laasch, Markus Tresch
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
13 years 12 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan