Sciweavers

17 search results - page 3 / 4
» Auto-supervised learning in the Bayesian Programming Framewo...
Sort
View
IDA
2009
Springer
13 years 11 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
ML
2006
ACM
122views Machine Learning» more  ML 2006»
13 years 4 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant
ICRA
2005
IEEE
146views Robotics» more  ICRA 2005»
13 years 10 months ago
Probabilistic Gaze Imitation and Saliency Learning in a Robotic Head
— Imitation is a powerful mechanism for transferring knowledge from an instructor to a na¨ıve observer, one that is deeply contingent on a state of shared attention between the...
Aaron P. Shon, David B. Grimes, Chris Baker, Matth...
KDD
1999
ACM
128views Data Mining» more  KDD 1999»
13 years 9 months ago
Towards Automated Synthesis of Data Mining Programs
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
Wray L. Buntine, Bernd Fischer 0002, Thomas Pressb...
COLT
1999
Springer
13 years 9 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon