New permutation algorithms for causal discovery using ICA

Authors:
Patrik O. Hoyer;Shohei Shimizu;Aapo Hyvärinen;Yutaka Kano;Antti J. Kerminen
Affiliations:
HIIT Basic Research Unit, Dept. of Comp. Science, University of Helsinki, Finland;HIIT Basic Research Unit, Dept. of Comp. Science, University of Helsinki, Finland;HIIT Basic Research Unit, Dept. of Comp. Science, University of Helsinki, Finland;Graduate School of Engineering Science, Osaka University, Japan;HIIT Basic Research Unit, Dept. of Comp. Science, University of Helsinki, Finland
Venue:
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Year:
2006

Citing 2
Cited 2

Independent component analysis, a new concept?

Signal Processing - Special issue on higher order statistics
Causality: models, reasoning, and inference

Causality: models, reasoning, and inference

A Linear Non-Gaussian Acyclic Model for Causal Discovery

The Journal of Machine Learning Research
Structure learning by pruning in independent component analysis

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

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.