2018 37th Chinese Control Conference (CCC) 2018
DOI: 10.23919/chicc.2018.8483049
|View full text |Cite
|
Sign up to set email alerts
|

Structure Learning of Bayesian Networks Based On the LARS-MMPC Ordering Search Method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…Deterministic approaches, on the other hand, are vulnerable to finding local optima, are said to be weak at generalizing, and may be wide in their quest space (Shahab Wahhab Kareem, Mehmet Cudi Okur, 2019). When a local maximum has been reached, an easy solution to the problem is to use a stochastic approach this paper introduces complex Bayesian networks using particle swarm optimization (PSO) (He, C.-C., & Gao, X.-G, 2018, July 25-27). The authors choose that as a result of the job.…”
Section: Analysis Of Findingsmentioning
confidence: 99%
“…Deterministic approaches, on the other hand, are vulnerable to finding local optima, are said to be weak at generalizing, and may be wide in their quest space (Shahab Wahhab Kareem, Mehmet Cudi Okur, 2019). When a local maximum has been reached, an easy solution to the problem is to use a stochastic approach this paper introduces complex Bayesian networks using particle swarm optimization (PSO) (He, C.-C., & Gao, X.-G, 2018, July 25-27). The authors choose that as a result of the job.…”
Section: Analysis Of Findingsmentioning
confidence: 99%
“…An additional difficulty with missing data is that it operates as a closed form with comprehensive data, though not limited to that. What's needed for learning a database structure from incomplete data is entirely is much more effort than what's required for a well-structured database (He et al 2018). from 1998 onward, the use of DBN (Structural EM), can be seen in latent variable models.…”
Section: Table1 Findings From Related Previous Researchmentioning
confidence: 99%
“…from 1998 onward, the use of DBN (Structural EM), can be seen in latent variable models. Deterministic approaches, on the other hand, are vulnerable to finding local optima, are said to be weak at generalizing, may be wide in their quest space [33]. When a local maximum has been reached, an easy solution to the problem is to use a stochastic approach this paper introduces complex Bayesian networks using particle swarm optimization (PSO) [34].…”
Section: Table1 Findings From Related Previous Researchmentioning
confidence: 99%
“…The information-theoretic score is implemented in techniques such as the Akaike information criterion (AIC), log-likelihood (LL), minimum description length (MDL), Bayesian information criterion (BIC), mutual information test (MIT), and normalized minimum likelihood (NML) [3]. There are various techniques of a research strategy that are intended to improve the problem of structural learning; these include particle swarm intelligence [4], the ant colony optimization algorithm [27], bee colony [13], the hybrid algorithm ( [11,15,21]), the simulated annealing algorithm [26], bacterial foraging optimization [33], genetic algorithms [19], the gene-pool optimal mixing evolutionary algorithm (GOMEA) [24], the breeding swarm algorithm [18], the binary encoding water cycle [32], pigeon-inspired optimization [16], tightening bounds [6], A* search algorithms [34], scatter search documents [5], the cuckoo optimization algorithm [1], quasi-determinism screening [25], and the minimum spanning tree algorithm [28]. Another additional metaheuristic technique that can be applied to learn the structure of Bayesian networks is falcon optimization.…”
Section: Introductionmentioning
confidence: 99%