meta - dgi:基于元学习的中心性感知深度图信息嵌入链接预测

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Fatima Ziya, Sanjay Kumar
{"title":"meta - dgi:基于元学习的中心性感知深度图信息嵌入链接预测","authors":"Fatima Ziya,&nbsp;Sanjay Kumar","doi":"10.1002/cpe.70211","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Link prediction is a fundamental task in social and complex network analysis, focused on forecasting the likelihood of unseen or future connections between nodes. Accurate link prediction can enhance understanding of network dynamics, reveal hidden structures, and improve recommendations in social and information networks. This paper proposes a novel Meta-Learning-Based Link Prediction model that utilizes a Centrality-Aware connectivity matrix and incorporates Deep Graph Infomax (DGI) embeddings with the CatBoost classifier. The connectivity matrix is constructed using node centrality measures like closeness centrality, degree centrality, and betweenness centrality by capturing the network's local and global structural properties. The DGI embedding algorithm efficiently learns the network's latent features, while the CatBoost classifier is employed to enhance prediction performance. To address the challenge of imbalanced datasets in social networks, we apply downsampling to create balanced training and testing datasets, ensuring robust model learning. Our framework demonstrates improved accuracy, scalability, and adaptability compared to traditional link prediction methods. Extensive experiments on real-world social network datasets show that the proposed model achieves superior performance in link prediction tasks, making it a promising approach for various network analysis applications.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 21-22","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MetaLP-DGI: Meta-Learning-Based Link Prediction With Centrality-Aware Deep Graph Infomax Embeddings\",\"authors\":\"Fatima Ziya,&nbsp;Sanjay Kumar\",\"doi\":\"10.1002/cpe.70211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Link prediction is a fundamental task in social and complex network analysis, focused on forecasting the likelihood of unseen or future connections between nodes. Accurate link prediction can enhance understanding of network dynamics, reveal hidden structures, and improve recommendations in social and information networks. This paper proposes a novel Meta-Learning-Based Link Prediction model that utilizes a Centrality-Aware connectivity matrix and incorporates Deep Graph Infomax (DGI) embeddings with the CatBoost classifier. The connectivity matrix is constructed using node centrality measures like closeness centrality, degree centrality, and betweenness centrality by capturing the network's local and global structural properties. The DGI embedding algorithm efficiently learns the network's latent features, while the CatBoost classifier is employed to enhance prediction performance. To address the challenge of imbalanced datasets in social networks, we apply downsampling to create balanced training and testing datasets, ensuring robust model learning. Our framework demonstrates improved accuracy, scalability, and adaptability compared to traditional link prediction methods. Extensive experiments on real-world social network datasets show that the proposed model achieves superior performance in link prediction tasks, making it a promising approach for various network analysis applications.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"37 21-22\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70211\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70211","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

链接预测是社会和复杂网络分析中的一项基本任务,重点是预测节点之间未见或未来连接的可能性。准确的链接预测可以增强对网络动态的理解,揭示隐藏的结构,并改善社会和信息网络中的推荐。本文提出了一种新的基于元学习的链接预测模型,该模型利用中心性感知连接矩阵,并将深度图信息(DGI)嵌入与CatBoost分类器相结合。通过捕获网络的局部和全局结构属性,使用节点中心性度量(如接近中心性、度中心性和间中心性)构建连接矩阵。DGI嵌入算法有效地学习网络的潜在特征,而CatBoost分类器用于提高预测性能。为了解决社交网络中不平衡数据集的挑战,我们应用下采样来创建平衡的训练和测试数据集,确保稳健的模型学习。与传统的链路预测方法相比,我们的框架具有更高的准确性、可扩展性和适应性。在真实社会网络数据集上的大量实验表明,所提出的模型在链路预测任务中取得了优异的性能,使其成为各种网络分析应用的一种有前途的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MetaLP-DGI: Meta-Learning-Based Link Prediction With Centrality-Aware Deep Graph Infomax Embeddings

Link prediction is a fundamental task in social and complex network analysis, focused on forecasting the likelihood of unseen or future connections between nodes. Accurate link prediction can enhance understanding of network dynamics, reveal hidden structures, and improve recommendations in social and information networks. This paper proposes a novel Meta-Learning-Based Link Prediction model that utilizes a Centrality-Aware connectivity matrix and incorporates Deep Graph Infomax (DGI) embeddings with the CatBoost classifier. The connectivity matrix is constructed using node centrality measures like closeness centrality, degree centrality, and betweenness centrality by capturing the network's local and global structural properties. The DGI embedding algorithm efficiently learns the network's latent features, while the CatBoost classifier is employed to enhance prediction performance. To address the challenge of imbalanced datasets in social networks, we apply downsampling to create balanced training and testing datasets, ensuring robust model learning. Our framework demonstrates improved accuracy, scalability, and adaptability compared to traditional link prediction methods. Extensive experiments on real-world social network datasets show that the proposed model achieves superior performance in link prediction tasks, making it a promising approach for various network analysis applications.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信