Sciweavers

743 search results - page 51 / 149
» Solving the Multiple-Instance Problem: A Lazy Learning Appro...
Sort
View
IJAIT
2002
81views more  IJAIT 2002»
13 years 8 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
JMLR
2010
129views more  JMLR 2010»
13 years 3 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
ALT
2004
Springer
14 years 5 months ago
Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
Steffen Lange, Sandra Zilles
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 8 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
DAGM
2004
Springer
14 years 2 months ago
Learning with Distance Substitution Kernels
Abstract. During recent years much effort has been spent in incorporating problem specific a-priori knowledge into kernel methods for machine learning. A common example is a-prior...
Bernard Haasdonk, Claus Bahlmann