Loading…

Label-aware aggregation on heterophilous graphs for node representation learning

Learning node representation on heterophilous graphs has been challenging due to nodes with diverse labels/attributes being connected. The main idea is to balance contributions between the center node and neighborhoods. However, existing methods failed to make full use of personalized contributions...

Full description

Saved in:
Bibliographic Details
Published in:Displays 2024-09, Vol.84, p.102817, Article 102817
Main Authors: Liu, Linruo, Wang, Yangtao, Xie, Yanzhao, Tan, Xin, Ma, Lizhuang, Tang, Maobin, Fang, Meie
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c185t-a4ee9736d3d605c55cc80bf05307e806d4c6beda5b27a0060c9d8b6c18dc08033
container_end_page
container_issue
container_start_page 102817
container_title Displays
container_volume 84
creator Liu, Linruo
Wang, Yangtao
Xie, Yanzhao
Tan, Xin
Ma, Lizhuang
Tang, Maobin
Fang, Meie
description Learning node representation on heterophilous graphs has been challenging due to nodes with diverse labels/attributes being connected. The main idea is to balance contributions between the center node and neighborhoods. However, existing methods failed to make full use of personalized contributions of different neighborhoods based on whether they own the same label as the center node, making it necessary to explore the distinctive contributions of similar/dissimilar neighborhoods. We reveal that both similar/dissimilar neighborhoods have positive impacts on feature aggregation under different homophily ratios. Especially, dissimilar neighborhoods play a significant role under low homophily ratios. Based on this, we propose LAAH, a label-aware aggregation approach for node representation learning on heterophilous graphs. LAAH separates each center node from its neighborhoods and generates their own node representations. Additionally, for each neighborhood, LAAH records its label information based on whether it belongs to the same class as the center node and then aggregates its effective feature in a weighted manner. Finally, a learnable parameter is used to balance the contributions of each center node and all its neighborhoods, leading to updated representations. Extensive experiments on 8 real-world heterophilous datasets and a synthetic dataset verify that LAAH can achieve competitive or superior accuracy in node classification with lower parameter scale and computational complexity compared with the SOTA methods. The code is released at GitHub: https://github.com/laah123graph/LAAH. •Both similar/dissimilar neighborhoods make a positive impact on feature aggregation.•We propose a label-aware strategy for each similar/dissimilar neighborhood.•We carry out contribution balance between each center node and all its neighborhoods.•Extensive experiments verify our method can achieve the SOTA performance.
doi_str_mv 10.1016/j.displa.2024.102817
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_displa_2024_102817</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0141938224001811</els_id><sourcerecordid>S0141938224001811</sourcerecordid><originalsourceid>FETCH-LOGICAL-c185t-a4ee9736d3d605c55cc80bf05307e806d4c6beda5b27a0060c9d8b6c18dc08033</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhnNQcF39Bx76B7pO-pFmL4IsfiwU9KDnME2m3Sy1KZOq-O_tUs_CwMDMPC_DI8SNhI0EqW6PG-fj2OMmg6yYR5mW1ZlYgSxkus11diEuYzwCzNsqW4nXGhvqU_xGpgS7jqnDyYchmetAE3EYD74PnzHpGMdDTNrAyRAcJUwjU6RhWu57Qh780F2J8xb7SNd_fS3eHx_eds9p_fK0393XqZW6nFIsiLZVrlzuFJS2LK3V0LRQ5lCRBuUKqxpyWDZZhQAK7NbpRs2ws6Ahz9eiWHIthxiZWjOy_0D-MRLMyYQ5msWEOZkwi4kZu1swmn_78sQmWk-DJeeZ7GRc8P8H_AIfwGyx</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Label-aware aggregation on heterophilous graphs for node representation learning</title><source>ScienceDirect Freedom Collection</source><creator>Liu, Linruo ; Wang, Yangtao ; Xie, Yanzhao ; Tan, Xin ; Ma, Lizhuang ; Tang, Maobin ; Fang, Meie</creator><creatorcontrib>Liu, Linruo ; Wang, Yangtao ; Xie, Yanzhao ; Tan, Xin ; Ma, Lizhuang ; Tang, Maobin ; Fang, Meie</creatorcontrib><description>Learning node representation on heterophilous graphs has been challenging due to nodes with diverse labels/attributes being connected. The main idea is to balance contributions between the center node and neighborhoods. However, existing methods failed to make full use of personalized contributions of different neighborhoods based on whether they own the same label as the center node, making it necessary to explore the distinctive contributions of similar/dissimilar neighborhoods. We reveal that both similar/dissimilar neighborhoods have positive impacts on feature aggregation under different homophily ratios. Especially, dissimilar neighborhoods play a significant role under low homophily ratios. Based on this, we propose LAAH, a label-aware aggregation approach for node representation learning on heterophilous graphs. LAAH separates each center node from its neighborhoods and generates their own node representations. Additionally, for each neighborhood, LAAH records its label information based on whether it belongs to the same class as the center node and then aggregates its effective feature in a weighted manner. Finally, a learnable parameter is used to balance the contributions of each center node and all its neighborhoods, leading to updated representations. Extensive experiments on 8 real-world heterophilous datasets and a synthetic dataset verify that LAAH can achieve competitive or superior accuracy in node classification with lower parameter scale and computational complexity compared with the SOTA methods. The code is released at GitHub: https://github.com/laah123graph/LAAH. •Both similar/dissimilar neighborhoods make a positive impact on feature aggregation.•We propose a label-aware strategy for each similar/dissimilar neighborhood.•We carry out contribution balance between each center node and all its neighborhoods.•Extensive experiments verify our method can achieve the SOTA performance.</description><identifier>ISSN: 0141-9382</identifier><identifier>DOI: 10.1016/j.displa.2024.102817</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Heterophilous graphs ; Label-aware aggregation ; Node representation learning</subject><ispartof>Displays, 2024-09, Vol.84, p.102817, Article 102817</ispartof><rights>2024 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c185t-a4ee9736d3d605c55cc80bf05307e806d4c6beda5b27a0060c9d8b6c18dc08033</cites><orcidid>0000-0003-4605-9270</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Liu, Linruo</creatorcontrib><creatorcontrib>Wang, Yangtao</creatorcontrib><creatorcontrib>Xie, Yanzhao</creatorcontrib><creatorcontrib>Tan, Xin</creatorcontrib><creatorcontrib>Ma, Lizhuang</creatorcontrib><creatorcontrib>Tang, Maobin</creatorcontrib><creatorcontrib>Fang, Meie</creatorcontrib><title>Label-aware aggregation on heterophilous graphs for node representation learning</title><title>Displays</title><description>Learning node representation on heterophilous graphs has been challenging due to nodes with diverse labels/attributes being connected. The main idea is to balance contributions between the center node and neighborhoods. However, existing methods failed to make full use of personalized contributions of different neighborhoods based on whether they own the same label as the center node, making it necessary to explore the distinctive contributions of similar/dissimilar neighborhoods. We reveal that both similar/dissimilar neighborhoods have positive impacts on feature aggregation under different homophily ratios. Especially, dissimilar neighborhoods play a significant role under low homophily ratios. Based on this, we propose LAAH, a label-aware aggregation approach for node representation learning on heterophilous graphs. LAAH separates each center node from its neighborhoods and generates their own node representations. Additionally, for each neighborhood, LAAH records its label information based on whether it belongs to the same class as the center node and then aggregates its effective feature in a weighted manner. Finally, a learnable parameter is used to balance the contributions of each center node and all its neighborhoods, leading to updated representations. Extensive experiments on 8 real-world heterophilous datasets and a synthetic dataset verify that LAAH can achieve competitive or superior accuracy in node classification with lower parameter scale and computational complexity compared with the SOTA methods. The code is released at GitHub: https://github.com/laah123graph/LAAH. •Both similar/dissimilar neighborhoods make a positive impact on feature aggregation.•We propose a label-aware strategy for each similar/dissimilar neighborhood.•We carry out contribution balance between each center node and all its neighborhoods.•Extensive experiments verify our method can achieve the SOTA performance.</description><subject>Heterophilous graphs</subject><subject>Label-aware aggregation</subject><subject>Node representation learning</subject><issn>0141-9382</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhnNQcF39Bx76B7pO-pFmL4IsfiwU9KDnME2m3Sy1KZOq-O_tUs_CwMDMPC_DI8SNhI0EqW6PG-fj2OMmg6yYR5mW1ZlYgSxkus11diEuYzwCzNsqW4nXGhvqU_xGpgS7jqnDyYchmetAE3EYD74PnzHpGMdDTNrAyRAcJUwjU6RhWu57Qh780F2J8xb7SNd_fS3eHx_eds9p_fK0393XqZW6nFIsiLZVrlzuFJS2LK3V0LRQ5lCRBuUKqxpyWDZZhQAK7NbpRs2ws6Ahz9eiWHIthxiZWjOy_0D-MRLMyYQ5msWEOZkwi4kZu1swmn_78sQmWk-DJeeZ7GRc8P8H_AIfwGyx</recordid><startdate>202409</startdate><enddate>202409</enddate><creator>Liu, Linruo</creator><creator>Wang, Yangtao</creator><creator>Xie, Yanzhao</creator><creator>Tan, Xin</creator><creator>Ma, Lizhuang</creator><creator>Tang, Maobin</creator><creator>Fang, Meie</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-4605-9270</orcidid></search><sort><creationdate>202409</creationdate><title>Label-aware aggregation on heterophilous graphs for node representation learning</title><author>Liu, Linruo ; Wang, Yangtao ; Xie, Yanzhao ; Tan, Xin ; Ma, Lizhuang ; Tang, Maobin ; Fang, Meie</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c185t-a4ee9736d3d605c55cc80bf05307e806d4c6beda5b27a0060c9d8b6c18dc08033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Heterophilous graphs</topic><topic>Label-aware aggregation</topic><topic>Node representation learning</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Linruo</creatorcontrib><creatorcontrib>Wang, Yangtao</creatorcontrib><creatorcontrib>Xie, Yanzhao</creatorcontrib><creatorcontrib>Tan, Xin</creatorcontrib><creatorcontrib>Ma, Lizhuang</creatorcontrib><creatorcontrib>Tang, Maobin</creatorcontrib><creatorcontrib>Fang, Meie</creatorcontrib><collection>CrossRef</collection><jtitle>Displays</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Linruo</au><au>Wang, Yangtao</au><au>Xie, Yanzhao</au><au>Tan, Xin</au><au>Ma, Lizhuang</au><au>Tang, Maobin</au><au>Fang, Meie</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Label-aware aggregation on heterophilous graphs for node representation learning</atitle><jtitle>Displays</jtitle><date>2024-09</date><risdate>2024</risdate><volume>84</volume><spage>102817</spage><pages>102817-</pages><artnum>102817</artnum><issn>0141-9382</issn><abstract>Learning node representation on heterophilous graphs has been challenging due to nodes with diverse labels/attributes being connected. The main idea is to balance contributions between the center node and neighborhoods. However, existing methods failed to make full use of personalized contributions of different neighborhoods based on whether they own the same label as the center node, making it necessary to explore the distinctive contributions of similar/dissimilar neighborhoods. We reveal that both similar/dissimilar neighborhoods have positive impacts on feature aggregation under different homophily ratios. Especially, dissimilar neighborhoods play a significant role under low homophily ratios. Based on this, we propose LAAH, a label-aware aggregation approach for node representation learning on heterophilous graphs. LAAH separates each center node from its neighborhoods and generates their own node representations. Additionally, for each neighborhood, LAAH records its label information based on whether it belongs to the same class as the center node and then aggregates its effective feature in a weighted manner. Finally, a learnable parameter is used to balance the contributions of each center node and all its neighborhoods, leading to updated representations. Extensive experiments on 8 real-world heterophilous datasets and a synthetic dataset verify that LAAH can achieve competitive or superior accuracy in node classification with lower parameter scale and computational complexity compared with the SOTA methods. The code is released at GitHub: https://github.com/laah123graph/LAAH. •Both similar/dissimilar neighborhoods make a positive impact on feature aggregation.•We propose a label-aware strategy for each similar/dissimilar neighborhood.•We carry out contribution balance between each center node and all its neighborhoods.•Extensive experiments verify our method can achieve the SOTA performance.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.displa.2024.102817</doi><orcidid>https://orcid.org/0000-0003-4605-9270</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0141-9382
ispartof Displays, 2024-09, Vol.84, p.102817, Article 102817
issn 0141-9382
language eng
recordid cdi_crossref_primary_10_1016_j_displa_2024_102817
source ScienceDirect Freedom Collection
subjects Heterophilous graphs
Label-aware aggregation
Node representation learning
title Label-aware aggregation on heterophilous graphs for node representation learning
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T01%3A53%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Label-aware%20aggregation%20on%20heterophilous%20graphs%20for%20node%20representation%20learning&rft.jtitle=Displays&rft.au=Liu,%20Linruo&rft.date=2024-09&rft.volume=84&rft.spage=102817&rft.pages=102817-&rft.artnum=102817&rft.issn=0141-9382&rft_id=info:doi/10.1016/j.displa.2024.102817&rft_dat=%3Celsevier_cross%3ES0141938224001811%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c185t-a4ee9736d3d605c55cc80bf05307e806d4c6beda5b27a0060c9d8b6c18dc08033%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true