Sciweavers

791 search results - page 26 / 159
» Learning Probabilistic Ontologies with Distributed Parameter...
Sort
View
AUSDM
2007
Springer
100views Data Mining» more  AUSDM 2007»
14 years 3 months ago
Determining Termhood for Learning Domain Ontologies using Domain Prevalence and Tendency
In the course of reviewing existing automatic term recognition techniques for applications in ontology learning, we came across four issues which can be improved upon. We proposed...
Wilson Wong, Wei Liu, Mohammed Bennamoun
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 10 months ago
iBOA: the incremental bayesian optimization algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
Martin Pelikan, Kumara Sastry, David E. Goldberg
ICML
2006
IEEE
14 years 9 months ago
Dynamic topic models
A family of probabilistic time series models is developed to analyze the time evolution of topics in large document collections. The approach is to use state space models on the n...
David M. Blei, John D. Lafferty
COLT
2004
Springer
14 years 2 months ago
Learning Classes of Probabilistic Automata
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
François Denis, Yann Esposito
IJAR
2006
89views more  IJAR 2006»
13 years 9 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander