Sciweavers

791 search results - page 64 / 159
» Learning Probabilistic Ontologies with Distributed Parameter...
Sort
View
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
ICPR
2004
IEEE
14 years 10 months ago
Joint Spatial and Temporal Structure Learning for Task based Control
We present an example of a joint spatial and temporal task learning algorithm that results in a generative model that has applications for on-line visual control. We review work o...
Hilary Buxton, Kingsley Sage
ICANN
2007
Springer
14 years 3 months ago
Generalized Softmax Networks for Non-linear Component Extraction
Abstract. We develop a probabilistic interpretation of non-linear component extraction in neural networks that activate their hidden units according to a softmaxlike mechanism. On ...
Jörg Lücke, Maneesh Sahani
ISNN
2005
Springer
14 years 2 months ago
Post-nonlinear Blind Source Separation Using Neural Networks with Sandwiched Structure
Abstract. This paper proposes a novel algorithm based on informax for postnonlinear blind source separation. The demixing system culminates to a neural network with sandwiched stru...
Chunhou Zheng, Deshuang Huang, Zhan-Li Sun, Li Sha...
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
14 years 3 days ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin