Sciweavers

4930 search results - page 83 / 986
» Learning minimal abstractions
Sort
View
118
Voted
ICML
1994
IEEE
15 years 4 months ago
Reducing Misclassification Costs
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...
Michael J. Pazzani, Christopher J. Merz, Patrick M...
ICML
1996
IEEE
16 years 1 months ago
Discretizing Continuous Attributes While Learning Bayesian Networks
We introduce a method for learning Bayesian networks that handles the discretization of continuous variables as an integral part of the learning process. The main ingredient in th...
Moisés Goldszmidt, Nir Friedman
GECCO
2003
Springer
115views Optimization» more  GECCO 2003»
15 years 5 months ago
Focusing versus Intransitivity
Abstract. Recently, a minimal domain dubbed the numbers game has been proposed to illustrate well-known issues in co-evolutionary dynamics. The domain
Anthony Bucci, Jordan B. Pollack
APLAS
2007
ACM
15 years 4 months ago
Call-by-Name and Call-by-Value in Normal Modal Logic
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
Yoshihiko Kakutani
ORL
2007
66views more  ORL 2007»
15 years 2 days ago
Linear programming with online learning
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...