Sciweavers

779 search results - page 47 / 156
» Information-theoretic Competitive Learning
Sort
View
IS
2008
13 years 10 months ago
Mining relational data from text: From strictly supervised to weakly supervised learning
This paper approaches the relation classification problem in information extraction framework with different machine learning strategies, from strictly supervised to weakly superv...
Zhu Zhang
AR
2004
84views more  AR 2004»
13 years 9 months ago
Reinforcement learning of humanoid rhythmic walking parameters based on visual information
This paper presents a method for learning the parameters of rhythmic walking to generate purposive humanoid motions. The controller consists of the two layers: rhythmic walking is...
Masaki Ogino, Yutaka Katoh, Masahiro Aono, Minoru ...
ML
1998
ACM
136views Machine Learning» more  ML 1998»
13 years 9 months ago
Co-Evolution in the Successful Learning of Backgammon Strategy
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
Jordan B. Pollack, Alan D. Blair
TNN
1998
76views more  TNN 1998»
13 years 9 months ago
Multiobjective genetic algorithm partitioning for hierarchical learning of high-dimensional pattern spaces: a learning-follows-d
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
Rajeev Kumar, Peter Rockett
ICML
2007
IEEE
14 years 10 months ago
Multiple instance learning for sparse positive bags
We present a new approach to multiple instance learning (MIL) that is particularly effective when the positive bags are sparse (i.e. contain few positive instances). Unlike other ...
Razvan C. Bunescu, Raymond J. Mooney