Evidence map›Paper›PMID 30012940›Full record

ArticleMolecules (Basel, Switzerland)2018

Causal Discovery Combining K2 with Brain Storm Optimization Algorithm.

Yinghan Hong, Zhifeng Hao, Guizhen Mai, Han Huang, Arun Kumar Sangaiah

Abstract read
In one paragraph

Article in Molecules (Basel, Switzerland), 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Yinghan HongSchool of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China. honyinghan@163.com.
Zhifeng HaoSchool of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China. zfhao@gdut.edu.cn.
Guizhen MaiSchool of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China. mgz0323@126.com.ORCID 0000-0001-9433-7883
Han HuangSchool of Software Engineering, South China University of Technology, Guangzhou 510006, China. hhan@scut.edu.cn.
Arun Kumar SangaiahSchool of Computing Science and Engineering, Vellore Institute of Technology, Vellore-632014, Tamil Nadu, India. sarunkumar@vit.ac.in.ORCID 0000-0002-0229-2460

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Exploring and detecting the causal relations among variables have shown huge practical values in recent years, with numerous opportunities for scientific discovery, and have been commonly seen as the core of data science. Among all possible causal discovery methods, causal discovery based on a constraint approach could recover the causal structures from passive observational data in general cases, and had shown extensive prospects in numerous real world applications. However, when the graph was sufficiently large, it did not work well. To alleviate this problem, an improved causal structure learning algorithm named brain storm optimization (BSO), is presented in this paper, combining K2 with brain storm optimization (K2-BSO). Here BSO is used to search optimal topological order of nodes instead of graph space. This paper assumes that dataset is generated by conforming to a causal diagram in which each variable is generated from its parent based on a causal mechanism. We designed an elaborate distance function for clustering step in BSO according to the mechanism of K2. The graph space therefore was reduced to a smaller topological order space and the order space can be further reduced by an efficient clustering method. The experimental results on various real-world datasets showed our methods outperformed the traditional search and score methods and the state-of-the-art genetic algorithm-based methods.

Indexed as

AlgorithmsMachine LearningModels, TheoreticalHumansBayesian causal modelbrain storm optimizationcausal direction learningK2

Identifiers

PMID30012940
PMCPMC6100085

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.