A Distance Correlation-based Kernel for Nonlinear Causal Clustering in Heterogeneous Populations
We consider the problem of causal structure learning in the setting of heterogeneous populations, i.e., populations in which a single causal structure does not adequately represent all population members, as is common in biological and social sciences. To this end, we introduce a distance covariance-based kernel designed specifically to measure the similarity between the underlying nonlinear causal structures of different samples.This kernel enables us to perform clustering to identify the homogeneous subpopulations. Indeed, we prove the corresponding feature map is a statistically consistent estimator of nonlinear independence structure, rendering the kernel itself a statistical test for the hypothesis that sets of samples come from different generating causal structures. We can then use existing methods to learn a causal structure for each of these subpopulations. We demonstrate using our kernel for causal clustering with an application in genetics, allowing us to reason about the latent transcription factor networks regulating measured gene expression levels.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
A Distance Covariance-based Kernel for Nonlinear Causal Clustering in Heterogeneous Populations
We consider the problem of causal structure learning in the setting of heterogeneous populations, i.e., populations in which a single causal structure does not adequately represent all population members, as is common in…
ClusteringCausal Learning for Heterogeneous Subgroups Based on Nonlinear Causal Kernel Clustering
Due to the challenge posed by multi-source and heterogeneous data collected from diverse environments, causal relationships among features can exhibit variations influenced by different time spans, regions, or strategies…
ClusteringDiversityNonlinear Markov Clustering by Minimum Curvilinear Sparse Similarity
The development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm that simulates stochastic flows on a networ…
ClusteringKernel Wasserstein Distance
The Wasserstein distance is a powerful metric based on the theory of optimal transport. It gives a natural measure of the distance between two distributions with a wide range of applications. In contrast to a number of t…
ClusteringNon-linear correlation analysis in financial markets using hierarchical clustering
Distance correlation coefficient (DCC) can be used to identify new associations and correlations between multiple variables. The distance correlation coefficient applies to variables of any dimension, can be used to dete…
Clustering