ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

خوارزميات اكتشاف السببية (PC، FCI، LiNGAM)×DBSCAN×شبكة الانتباه الرسومية×
المجالالاستدلال السببيتعلم الآلةالتعلم العميق
العائلةRegression modelMachine learningMachine learning
سنة النشأة200019962018
صاحب الطريقةSpirtes, Glymour & Scheines (PC/FCI); Shimizu et al. (LiNGAM)Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.Veličković, P. et al.
النوعCausal structure learningDensity-based clustering algorithmGraph neural network (attention-based)
المصدر التأسيسيSpirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0262194402Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗
الأسماء البديلةPC algorithm, FCI algorithm, LiNGAM, causal structure learningDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network
ذات صلة534
الملخصCausal discovery is a family of algorithms that automatically learn a directed acyclic graph (DAG) describing causal structure directly from observational data. The constraint-based PC and FCI algorithms were developed by Spirtes, Glymour and Scheines (2000), while the LiNGAM model of Shimizu et al. (2006) exploits linear non-Gaussian structure to orient edges.DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN).
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Causal Discovery Algorithms · DBSCAN · Graph Attention Network. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare