Sciweavers

2695 search results - page 324 / 539
» Learning Graph Matching
Sort
View
ECAI
2000
Springer
15 years 7 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
130
Voted
UAI
2003
15 years 4 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
ICML
2007
IEEE
16 years 4 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ICML
2007
IEEE
16 years 4 months ago
Spectral feature selection for supervised and unsupervised learning
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
Zheng Zhao, Huan Liu
CVPR
2010
IEEE
15 years 11 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr