2842 search results - page 320 / 569 » Expansion and Search in Networks |
203
Voted
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
200
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
186
click to vote
ICMLA
2007
15 years 8 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
172
click to vote
UAI
1993
15 years 8 months ago
1993
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL ...
197
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
A key feature in population based optimization algorithms is the ability to explore a search space and make a decision based on multiple solutions. In this paper, an incremental le...