Sciweavers

3837 search results - page 262 / 768
» Learning Approximate Consistencies
Sort
View
IWINAC
2007
Springer
16 years 1 months ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
ECML
2006
Springer
15 years 11 months ago
PAC-Learning of Markov Models with Hidden State
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
Ricard Gavaldà, Philipp W. Keller, Joelle P...
AAAI
2010
15 years 8 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou
ESANN
2003
15 years 8 months ago
Improving iterative repair strategies for scheduling with the SVM
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
Kai Gersmann, Barbara Hammer
ICML
2010
IEEE
15 years 8 months ago
Improved Local Coordinate Coding using Local Tangents
Local Coordinate Coding (LCC), introduced in (Yu et al., 2009), is a high dimensional nonlinear learning method that explicitly takes advantage of the geometric structure of the d...
Kai Yu, Tong Zhang