Sciweavers

759 search results - page 42 / 152
» Structured Learning with Approximate Inference
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
GLOBECOM
2010
IEEE
14 years 7 months ago
Cognitive Network Inference through Bayesian Network Analysis
Cognitive networking deals with applying cognition to the entire network protocol stack for achieving stack-wide as well as network-wide performance goals, unlike cognitive radios ...
Giorgio Quer, Hemanth Meenakshisundaram, Tamma Bhe...
100
Voted
CVBIA
2005
Springer
15 years 3 months ago
A Hybrid Framework for Image Segmentation Using Probabilistic Integration of Heterogeneous Constraints
In this paper we present a new framework for image segmentation using probabilistic multinets. We apply this framework to integration of regionbased and contour-based segmentation ...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas
ADCM
2008
136views more  ADCM 2008»
14 years 9 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
AUSAI
2005
Springer
15 years 3 months ago
Global Versus Local Constructive Function Approximation for On-Line Reinforcement Learning
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
Peter Vamplew, Robert Ollington