Sciweavers

1897 search results - page 180 / 380
» Sparse Additive Machine
Sort
View
ICML
1999
IEEE
16 years 5 months ago
AdaCost: Misclassification Cost-Sensitive Boosting
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang, Philip...
ICML
1996
IEEE
16 years 5 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
ICML
1995
IEEE
16 years 5 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
ALT
2008
Springer
16 years 2 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
ALT
2007
Springer
16 years 2 months ago
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
Sanjay Jain, Efim B. Kinber