Approaching feature matrix: To solve two issues in link prediction
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Yeojun | - |
dc.contributor.author | Cho, Yoon-Sik | - |
dc.date.accessioned | 2024-01-09T06:06:48Z | - |
dc.date.available | 2024-01-09T06:06:48Z | - |
dc.date.issued | 2023-12 | - |
dc.identifier.issn | 0957-4174 | - |
dc.identifier.issn | 1873-6793 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/69982 | - |
dc.description.abstract | With the increase of graph-structure data, link prediction has become an active research topic. Recent progress in link prediction involves learning graph embeddings through graph neural networks. Graph autoencoders(GAE), variational graph autoencoders(VGAE), and their variants such as graph normalized autoencoders(GNAE) try to learn graph embeddings in an unsupervised setting and show promising results in link prediction. However, they suffer from degraded performance with two issues; they tend to assign close to-zero embedding on nodes with zero degree (i.e., isolated node problem) and the issue caused by random negative sampling has not been addressed in link prediction experiments. As the two issues affect only links and not feature information, we propose a generic learning method based on the property of feature information that alleviates both issues and outperforms strong baselines across benchmark datasets. | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Approaching feature matrix: To solve two issues in link prediction | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.eswa.2023.120985 | - |
dc.identifier.bibliographicCitation | EXPERT SYSTEMS WITH APPLICATIONS, v.234 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 001052817500001 | - |
dc.identifier.scopusid | 2-s2.0-85169917233 | - |
dc.citation.title | EXPERT SYSTEMS WITH APPLICATIONS | - |
dc.citation.volume | 234 | - |
dc.type.docType | Article | - |
dc.publisher.location | 영국 | - |
dc.subject.keywordAuthor | Link prediction | - |
dc.subject.keywordAuthor | Graph embedding | - |
dc.subject.keywordAuthor | Isolated node | - |
dc.subject.keywordAuthor | Random negative sampling | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.