通过节点嵌入和集合学习加强链接预测

IF 2.5 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhongyuan Chen, Yongji Wang
{"title":"通过节点嵌入和集合学习加强链接预测","authors":"Zhongyuan Chen, Yongji Wang","doi":"10.1007/s10115-024-02203-6","DOIUrl":null,"url":null,"abstract":"<p>Social networks, characterized by their dynamic and continually evolving nature, present challenges for effective link prediction (LP) due to the constant addition of nodes and connections. In response to this, we propose a novel approach to LP in social networks through Node Embedding and Ensemble Learning (LP-NEEL). Our method constructs a transition matrix from the network’s adjacency matrix and computes similarity measures between node pairs. Utilizing node2vec embedding, we extract features from nodes and generate edge embeddings by computing the inner product of node embeddings for each edge. This process yields a well-labeled dataset suitable for LP tasks. To mitigate overfitting, we balance the dataset by ensuring an equal number of negative and positive samples edge samples during both the testing and training phases. Leveraging this balanced dataset, we employ the XGBoost machine learning algorithm for final link prediction. Extensive experimentation across six social network datasets validates the efficacy of our approach, demonstrating improved predictive performance compared to existing methods.</p>","PeriodicalId":54749,"journal":{"name":"Knowledge and Information Systems","volume":"9 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing link prediction through node embedding and ensemble learning\",\"authors\":\"Zhongyuan Chen, Yongji Wang\",\"doi\":\"10.1007/s10115-024-02203-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Social networks, characterized by their dynamic and continually evolving nature, present challenges for effective link prediction (LP) due to the constant addition of nodes and connections. In response to this, we propose a novel approach to LP in social networks through Node Embedding and Ensemble Learning (LP-NEEL). Our method constructs a transition matrix from the network’s adjacency matrix and computes similarity measures between node pairs. Utilizing node2vec embedding, we extract features from nodes and generate edge embeddings by computing the inner product of node embeddings for each edge. This process yields a well-labeled dataset suitable for LP tasks. To mitigate overfitting, we balance the dataset by ensuring an equal number of negative and positive samples edge samples during both the testing and training phases. Leveraging this balanced dataset, we employ the XGBoost machine learning algorithm for final link prediction. Extensive experimentation across six social network datasets validates the efficacy of our approach, demonstrating improved predictive performance compared to existing methods.</p>\",\"PeriodicalId\":54749,\"journal\":{\"name\":\"Knowledge and Information Systems\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2024-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Knowledge and Information Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10115-024-02203-6\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge and Information Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10115-024-02203-6","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

社交网络具有动态和持续发展的特点,由于节点和连接的不断增加,为有效的链接预测(LP)带来了挑战。为此,我们提出了一种通过节点嵌入和集合学习(LP-NEEL)在社交网络中进行链接预测的新方法。我们的方法从网络的邻接矩阵中构建过渡矩阵,并计算节点对之间的相似度。利用 node2vec 嵌入,我们从节点中提取特征,并通过计算每条边的节点嵌入的内积生成边嵌入。这一过程产生了适合 LP 任务的标签良好的数据集。为了减少过拟合,我们在测试和训练阶段都确保有相同数量的负样本和正样本边缘样本,以平衡数据集。利用这一平衡数据集,我们采用 XGBoost 机器学习算法进行最终链接预测。在六个社交网络数据集上进行的广泛实验验证了我们方法的有效性,与现有方法相比,我们的预测性能得到了提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Enhancing link prediction through node embedding and ensemble learning

Enhancing link prediction through node embedding and ensemble learning

Social networks, characterized by their dynamic and continually evolving nature, present challenges for effective link prediction (LP) due to the constant addition of nodes and connections. In response to this, we propose a novel approach to LP in social networks through Node Embedding and Ensemble Learning (LP-NEEL). Our method constructs a transition matrix from the network’s adjacency matrix and computes similarity measures between node pairs. Utilizing node2vec embedding, we extract features from nodes and generate edge embeddings by computing the inner product of node embeddings for each edge. This process yields a well-labeled dataset suitable for LP tasks. To mitigate overfitting, we balance the dataset by ensuring an equal number of negative and positive samples edge samples during both the testing and training phases. Leveraging this balanced dataset, we employ the XGBoost machine learning algorithm for final link prediction. Extensive experimentation across six social network datasets validates the efficacy of our approach, demonstrating improved predictive performance compared to existing methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Knowledge and Information Systems
Knowledge and Information Systems 工程技术-计算机:人工智能
CiteScore
5.70
自引率
7.40%
发文量
152
审稿时长
7.2 months
期刊介绍: Knowledge and Information Systems (KAIS) provides an international forum for researchers and professionals to share their knowledge and report new advances on all topics related to knowledge systems and advanced information systems. This monthly peer-reviewed archival journal publishes state-of-the-art research reports on emerging topics in KAIS, reviews of important techniques in related areas, and application papers of interest to a general readership.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信