Computer-based probabilistic-network construction
Computer-based probabilistic-network construction
Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
Causality: models, reasoning, and inference
Causality: models, reasoning, and inference
Learning Bayesian networks from data: an information-theory based approach
Artificial Intelligence
On the influence of the kernel on the consistency of support vector machines
The Journal of Machine Learning Research
Efficient svm training using low-rank kernel representations
The Journal of Machine Learning Research
Kernel independent component analysis
The Journal of Machine Learning Research
Optimal structure identification with greedy search
The Journal of Machine Learning Research
Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces
The Journal of Machine Learning Research
On the incompatibility of faithfulness and monotone DAG faithfulness
Artificial Intelligence
Statistical Consistency of Kernel Canonical Correlation Analysis
The Journal of Machine Learning Research
Measuring statistical dependence with hilbert-schmidt norms
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Distribution-Free Learning of Bayesian Network Structure
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Neural Computation
Hi-index | 0.00 |
We describe a causal learning method, which employs measuring the strength of statistical dependences in terms of the Hilbert-Schmidt norm of kernel-based cross-covariance operators. Following the line of the common faithfulness assumption of constraint-based causal learning, our approach assumes that a variable Z is likely to be a common effect of X and Y, if conditioning on Z increases the dependence between X and Y. Based on this assumption, we collect "votes" for hypothetical causal directions and orient the edges by the majority principle. In most experiments with known causal structures, our method provided plausible results and outperformed the conventional constraint-based PC algorithm.