Sciweavers

1340 search results - page 115 / 268
» Structure learning of Bayesian networks using constraints
Sort
View
ACCV
2010
Springer
14 years 11 months ago
Efficient Structured Support Vector Regression
Support Vector Regression (SVR) has been a long standing problem in machine learning, and gains its popularity on various computer vision tasks. In this paper, we propose a structu...
Ke Jia, Lei Wang, Nianjun Liu
JAIR
2010
145views more  JAIR 2010»
15 years 2 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JAIR
2008
93views more  JAIR 2008»
15 years 4 months ago
A Rigorously Bayesian Beam Model and an Adaptive Full Scan Model for Range Finders in Dynamic Environments
This paper proposes and experimentally validates a Bayesian network model of a range finder adapted to dynamic environments. All modeling assumptions are rigorously explained, and...
Tinne De Laet, Joris De Schutter, Herman Bruyninck...
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 2 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
15 years 7 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp