Sciweavers

701 search results - page 70 / 141
» Self Bounding Learning Algorithms
Sort
View
ICML
2003
IEEE
14 years 8 months ago
The Use of the Ambiguity Decomposition in Neural Network Ensemble Learning Methods
We analyze the formal grounding behind Negative Correlation (NC) Learning, an ensemble learning technique developed in the evolutionary computation literature. We show that by rem...
Gavin Brown, Jeremy L. Wyatt
COLT
1994
Springer
13 years 11 months ago
Efficient Reinforcement Learning
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
Claude-Nicolas Fiechter
SIGIR
2008
ACM
13 years 7 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
JMLR
2002
75views more  JMLR 2002»
13 years 7 months ago
Stability and Generalization
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
Olivier Bousquet, André Elisseeff
IJCNN
2006
IEEE
14 years 1 months ago
Behavior of Fatigable SOM and its Application to Clustering
Abstract— The Self-Organizing Map (SOM) is popular algorithm for unsupervised learning and visualization introduced by Teuvo Kohonen. One of the most attractive applications of S...
Masato Tomita, Haruna Matsushita, Yoshifumi Nishio