Sciweavers

24 search results - page 3 / 5
» Towards a theory of incentives in machine learning
Sort
View
ICML
1996
IEEE
14 years 9 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
COLT
2010
Springer
13 years 6 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
PROCEDIA
2010
85views more  PROCEDIA 2010»
13 years 7 months ago
Toward interactive statistical modeling
When solving machine learning problems, there is currently little automated support for easily experimenting with alternative statistical models or solution strategies. This is be...
Sooraj Bhat, Ashish Agarwal, Alexander Gray, Richa...
ICML
2002
IEEE
14 years 9 months ago
Non-Disjoint Discretization for Naive-Bayes Classifiers
Previous discretization techniques have discretized numeric attributes into disjoint intervals. We argue that this is neither necessary nor appropriate for naive-Bayes classifiers...
Ying Yang, Geoffrey I. Webb

Publication
233views
12 years 7 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis