New permutation algorithms for causal discovery using ICA

5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Causal discovery is the task of finding plausible causal relationships from statistical data [1,2]. Such methods rely on various assumptions about the data generating process to identify it from uncontrolled observations. We have recently proposed a causal discovery method based on independent component analysis (ICA) called LiNGAM [3], showing how to completely identify the data generating process under the assumptions of linearity, non-gaussianity, and no hidden variables. In this paper, after briefly recapitulating this approach, we focus on the algorithmic problems encountered when the number of variables considered is large. Thus we extend the applicability of the method to data sets with tens of variables or more. Experiments confirm the performance of the proposed algorithms, implemented as part of the latest version of our freely available Matlab/Octave LiNGAM package. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Hoyer, P. O., Shimizu, S., Hyvärinen, A., Kano, Y., & Kerminen, A. J. (2006). New permutation algorithms for causal discovery using ICA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3889 LNCS, pp. 115–122). https://doi.org/10.1007/11679363_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free