IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i17p3691-d1226701.html
   My bibliography  Save this article

DAG: Dual Attention Graph Representation Learning for Node Classification

Author

Listed:
  • Siyi Lin

    (School of Statistics and Mathematics, Zhongnan University of Economics and Law, Wuhan 430073, China)

  • Jie Hong

    (Institute of Artificial Intelligence and Blockchain, Guangzhou University, Guangzhou 510006, China
    These authors contributed equally to this work.)

  • Bo Lang

    (Department of Computer Science and Engineering, Lehigh University, Bethlehem, PA 18015, USA)

  • Lin Huang

    (Department of Engineering and Engineering Technology, Metropolitan State University of Denver, Denver, CO 80217-3362, USA
    These authors contributed equally to this work.)

Abstract

Transformer-based graph neural networks have accomplished notable achievements by utilizing the self-attention mechanism for message passing in various domains. However, traditional methods overlook the diverse significance of intra-node representations, focusing solely on internode interactions. To overcome this limitation, we propose a DAG (Dual Attention Graph), a novel approach that integrates both intra-node and internode dynamics for node classification tasks. By considering the information exchange process between nodes from dual branches, DAG provides a holistic understanding of information propagation within graphs, enhancing the interpretability of graph-based machine learning applications. The experimental evaluations demonstrate that DAG excels in node classification tasks, outperforming current benchmark models across ten datasets.

Suggested Citation

  • Siyi Lin & Jie Hong & Bo Lang & Lin Huang, 2023. "DAG: Dual Attention Graph Representation Learning for Node Classification," Mathematics, MDPI, vol. 11(17), pages 1-16, August.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:17:p:3691-:d:1226701
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/17/3691/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/17/3691/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yi Luo & Guangchun Luo & Ke Yan & Aiguo Chen, 2022. "Inferring from References with Differences for Semi-Supervised Node Classification on Graphs," Mathematics, MDPI, vol. 10(8), pages 1-16, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:17:p:3691-:d:1226701. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.