Sciweavers

1658 search results - page 214 / 332
» Learning Unknown Graphs
Sort
View
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
14 years 27 days ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
14 years 14 days ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...
TCBB
2011
13 years 3 months ago
Learning Genetic Regulatory Network Connectivity from Time Series Data
Recent experimental advances facilitate the collection of time series data that indicate which genes in a cell are expressed. This paper proposes an efficient method to generate th...
Nathan A. Barker, Chris J. Myers, Hiroyuki Kuwahar...
ESANN
2007
13 years 9 months ago
Causality and communities in neural networks
A recently proposed nonlinear extension of Granger causality is used to map the dynamics of a neural population onto a graph, whose community structure characterizes the collective...
Leonardo Angelini, Daniele Marinazzo, Mario Pellic...
IPL
2008
172views more  IPL 2008»
13 years 8 months ago
Approximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
Valentin Ziegler