Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/102337
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computingen_US
dc.creatorXiao, Jen_US
dc.creatorDai, Qen_US
dc.creatorXie, Xen_US
dc.creatorLam, Jen_US
dc.creatorKwok, KWen_US
dc.date.accessioned2023-10-18T07:51:17Z-
dc.date.available2023-10-18T07:51:17Z-
dc.identifier.issn0950-7051en_US
dc.identifier.urihttp://hdl.handle.net/10397/102337-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rights© 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).en_US
dc.rightsThe following publication Xiao, J., Dai, Q., Xie, X., Lam, J., & Kwok, K. W. (2023). Adversarially regularized graph attention networks for inductive learning on partially labeled graphs. Knowledge-Based Systems, 268, 110456 is availale at https://doi.org/10.1016/j.knosys.2023.110456.en_US
dc.subjectAdversarial regularizationen_US
dc.subjectAttention mechanismen_US
dc.subjectGraph neural networksen_US
dc.subjectGraph-based semi-supervised learningen_US
dc.subjectInductive learningen_US
dc.titleAdversarially regularized graph attention networks for inductive learning on partially labeled graphsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume268en_US
dc.identifier.doi10.1016/j.knosys.2023.110456en_US
dcterms.abstractThe high cost of data labeling often results in node label shortage in real applications. To improve node classification accuracy, graph-based semi-supervised learning leverages the ample unlabeled nodes to train together with the scarce available labeled nodes. However, most existing methods require the information of all nodes, including those to be predicted, during model training, which is not practical for dynamic graphs with newly added nodes. To address this issue, an adversarially regularized graph attention model is proposed to classify newly added nodes in a partially labeled graph. An attention-based aggregator is designed to generate the representation of a node by aggregating information from its neighboring nodes, thus naturally generalizing to previously unseen nodes. In addition, adversarial training is employed to improve the model's robustness and generalization ability by enforcing node representations to match a prior distribution. Experiments on real-world datasets demonstrate the effectiveness of the proposed method in comparison with the state-of-the-art methods. The code is available at https://github.com/JiarenX/AGAIN.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationKnowledge-based systems, 23 May 2023, v. 268, 110456en_US
dcterms.isPartOfKnowledge-based systemsen_US
dcterms.issued2023-05-23-
dc.identifier.scopus2-s2.0-85150242423-
dc.identifier.artn110456en_US
dc.description.validate202310 bcvcen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOS-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextCentre for Transformative Garment Production; Innovation and Technology Commissionen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
1-s2.0-S095070512300206X-main.pdf1.1 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

111
Last Week
1
Last month
Citations as of Nov 9, 2025

Downloads

59
Citations as of Nov 9, 2025

SCOPUSTM   
Citations

6
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

5
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.