2512 search results - page 89 / 503 » Learning from Highly Structured Data by Decomposition |
UAI
1998
14 years 11 months ago
1998
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
Learning good image priors is of utmost importance for the study of vision, computer vision and image processing applications. Learning priors and optimizing over whole images can...
JCDL
2006
ACM
15 years 3 months ago
2006
ACM
Describes the MARC Content Designation Utilization Project, which is examining a very large set of metadata records as artifacts of the library cataloging enterprise. This is the ...
EMNLP
2007
14 years 11 months ago
2007
Recognizing polarity requires a list of polar words and phrases. For the purpose of building such lexicon automatically, a lot of studies have investigated (semi-) unsupervised me...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...