Sciweavers

732 search results - page 5 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
ICML
1998
IEEE
14 years 8 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
ICML
2009
IEEE
14 years 8 months ago
A least squares formulation for a class of generalized eigenvalue problems in machine learning
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...
Liang Sun, Shuiwang Ji, Jieping Ye
INCDM
2010
Springer
138views Data Mining» more  INCDM 2010»
13 years 6 months ago
Learning Discriminative Distance Functions for Case Retrieval and Decision Support
The importance of learning distance functions is gradually being acknowledged by the machine learning community, and different techniques are suggested that can successfully learn ...
Alexey Tsymbal, Martin Huber, Shaohua Kevin Zhou
ECML
2007
Springer
14 years 1 months ago
Graph-Based Domain Mapping for Transfer Learning in General Games
A general game player is an agent capable of taking as input a description of a game’s rules in a formal language and proceeding to play without any subsequent human input. To do...
Gregory Kuhlmann, Peter Stone
IJCAI
2003
13 years 9 months ago
Constructing Diverse Classifier Ensembles using Artificial Training Examples
Ensemble methods like bagging and boosting that combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity of the memb...
Prem Melville, Raymond J. Mooney