DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, YH | - |
dc.contributor.author | Jun, CH | - |
dc.date.accessioned | 2016-04-01T02:34:44Z | - |
dc.date.available | 2016-04-01T02:34:44Z | - |
dc.date.created | 2010-12-06 | - |
dc.date.issued | 2010-10-01 | - |
dc.identifier.issn | 0167-8655 | - |
dc.identifier.other | 2010-OAK-0000022291 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/25390 | - |
dc.description.abstract | The purpose of a constraint-based causal discovery algorithm (CDA) is to find a directed acyclic graph which is observationally equivalent to the non-interventional data. Limiting the data to follow multivariate Gaussian distribution, existing such algorithms perform conditional independence (Cl) tests to compute the graph structure by comparing pairs of nodes independently. In this paper, however, we propose Multiple Search algorithm which performs Cl tests on multiple pairs of nodes simultaneously. Furthermore, compared to existing CDAs, the proposed algorithm searches a smaller number of conditioning sets because it continuously removes irrelevant nodes, and generates more-reliable solutions by double-checking the graph structures. We show the effectiveness of the proposed algorithm by comparison with Grow-Shrink and Collider Set algorithms through numerical experiments based on six networks. (C) 2010 Elsevier B.V. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | PATTERN RECOGNITION LETTERS | - |
dc.subject | Causal discovery | - |
dc.subject | Conditional independence test | - |
dc.subject | Markov blanket | - |
dc.subject | Multiple regression | - |
dc.title | A causal discovery algorithm using multiple regressions | - |
dc.type | Article | - |
dc.contributor.college | 산업경영공학과 | - |
dc.identifier.doi | 10.1016/J.PATREC.2010.06.013 | - |
dc.author.google | Choi, YH | - |
dc.author.google | Jun, CH | - |
dc.relation.volume | 31 | - |
dc.relation.issue | 13 | - |
dc.relation.startpage | 1924 | - |
dc.relation.lastpage | 1934 | - |
dc.contributor.id | 10070938 | - |
dc.relation.journal | PATTERN RECOGNITION LETTERS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | PATTERN RECOGNITION LETTERS, v.31, no.13, pp.1924 - 1934 | - |
dc.identifier.wosid | 000282146800021 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 1934 | - |
dc.citation.number | 13 | - |
dc.citation.startPage | 1924 | - |
dc.citation.title | PATTERN RECOGNITION LETTERS | - |
dc.citation.volume | 31 | - |
dc.contributor.affiliatedAuthor | Jun, CH | - |
dc.identifier.scopusid | 2-s2.0-77956064221 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 2 | - |
dc.description.scptc | 2 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Causal discovery | - |
dc.subject.keywordAuthor | Conditional independence test | - |
dc.subject.keywordAuthor | Markov blanket | - |
dc.subject.keywordAuthor | Multiple regression | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.