Sciweavers

702 search results - page 73 / 141
» Learning Probabilistic Models of Relational Structure
Sort
View
PAMI
2011
14 years 7 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 4 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
BMCBI
2006
119views more  BMCBI 2006»
15 years 19 days ago
Hidden Markov Model Variants and their Application
Markov statistical methods may make it possible to develop an unsupervised learning process that can automatically identify genomic structure in prokaryotes in a comprehensive way...
Stephen Winters-Hilt
112
Voted
KCAP
2005
ACM
15 years 6 months ago
AutoFeed: an unsupervised learning system for generating webfeeds
The AutoFeed system automatically extracts data from semistructured web sites. Previously, researchers have developed two types of supervised learning approaches for extracting we...
Bora Gazen, Steven Minton
AI
2002
Springer
15 years 13 days ago
Learning Bayesian networks from data: An information-theory based approach
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
Jie Cheng, Russell Greiner, Jonathan Kelly, David ...