Sciweavers

168 search results - page 12 / 34
» Optimal Search on Clustered Structural Constraint for Learni...
Sort
View
UAI
2001
13 years 8 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo
EMNLP
2006
13 years 8 months ago
Competitive generative models with structure learning for NLP classification tasks
In this paper we show that generative models are competitive with and sometimes superior to discriminative models, when both kinds of models are allowed to learn structures that a...
Kristina Toutanova
AAAI
2008
13 years 9 months ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
Jianqiang Shen, Lida Li, Weng-Keen Wong
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
PAMI
2011
13 years 2 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