首页 > AI前沿 > Efficient and Practical Clustering of Variables in Causal Graphs

Efficient and Practical Clustering of Variables in Causal Graphs

arXiv机器学习 2026-11-13 17:58 6 阅读 查看原文

Clustering variables in a graph may improve visual clarity and simplify causal inference. Harnessing the full potential of clustering requires an automated method to detect useful clusters in a graph.

We introduce a novel class of clusters called conduits, and present a sound, complete and efficient algorithm for detecting all conduits in the graph.

In addition to algorithmic detectability, conduits appear naturally in causal graphs stemming from real-world applications, enabling substantial size reduction. Furthermore, the structure of conduits enables the application of known identifiability results regarding clustering. We demonstrate these properties in a simulation study with real-world graphs.