Swarm Intelligence, Focus on Ant and Particle Swarm Optimization 2007
DOI: 10.5772/5120
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Particle Swarm Optimization for Structural Bayesian Network Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0
2

Year Published

2008
2008
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 33 publications
0
6
0
2
Order By: Relevance
“…Xing- Chen et al (2007a) and Heng et al (2006) have applied this in the case of normal Bayesian networks and also in the case of DBNs Xing- Chen et al (2007b). Other approaches include those by Li et al (2006), who use a memory binary particle swarm optimization technique and by Sahin and Devasia (2007) who use a distributed particle swarm optimization approach.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Xing- Chen et al (2007a) and Heng et al (2006) have applied this in the case of normal Bayesian networks and also in the case of DBNs Xing- Chen et al (2007b). Other approaches include those by Li et al (2006), who use a memory binary particle swarm optimization technique and by Sahin and Devasia (2007) who use a distributed particle swarm optimization approach.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Discrete search spaces are not differentiable, therefore it is not possible to use the usual definition of velocity and inertia for them. The approach proposed by Binary PSO, used by [16], changes the search space to a continuous multi-dimensional space where each variable may be on the interval [0, 1], and this value is the likelihood of a certain discrete feature on the search space. On the other side, some authors try to adapt the operations done with position and velocity according to the specific solution domain [14], [15].…”
Section: Introductionmentioning
confidence: 99%
“…Authors have adopted two main approaches for adapting Particle Swarm Optimization for the problem of learning a Bayesian network structure: one is directly adapt the concepts of PSO to the network structure learning problem, such as [14] and [15]; and the other is to use more general-purpose discrete adaptations of PSO, such as Binary PSO [16], where there is a translation of network representations to the representations required in these PSO methods. The main question behind these different approaches is the interpretation of the concepts of velocity and movement of particles in a discrete search space.…”
Section: Introductionmentioning
confidence: 99%
“…Nas áreas de aprendizagem estrutural de redes Bayesianas baseada em heurísticas, recentemente vários métodos de otimização têm sido adaptados -como os evolutivos (Villanueva e Maciel, 2010, baseados em simulated annealing (Ye et al, 2008), otimização por colônia de formigas (ACO) (Daly e Shen, 2009) e por enxame de partículas (PSO) (Sahin e Devasia, 2007). No entanto, em todos estes casos as heurísticas são utilizadas para a otimização de uma função de pontuação, que utiliza diretamente os dados fornecidos para o treinamento, e não medidas de transferência de informação como informação mútua e transferência de entropia.…”
Section: Aprendizado Estrutural Greedyunclassified