利用特征融合和局部离群因子改进网络表示学习中的链路预测

A. Al-furas, M. Alrahmawy, W. M. Al-Adrousy, S. Elmougy
{"title":"利用特征融合和局部离群因子改进网络表示学习中的链路预测","authors":"A. Al-furas, M. Alrahmawy, W. M. Al-Adrousy, S. Elmougy","doi":"10.54216/fpa.120210","DOIUrl":null,"url":null,"abstract":"Complex networks are a diverse set of networks found in various fields, such as social, technological, and biological networks. One important task in complex network analysis is link prediction, which involves detecting missing links or predicting future link formation. Many methods based on network structure analysis have been developed for link prediction, including network representation learning (NRL) models that represent nodes in a low-dimensional space. Fusion-based attributed NRL methods are particularly effective, as they capture both content and structure information. However, NRL models for link prediction are binary classification models, which face challenges in identifying negative links and prioritizing predicted links. To address these challenges, we propose a novel approach that treats link prediction as a novelty detection problem. Our approach uses the Local Outlier Factor (LOF) algorithm to quantify the novelty of non-existent links based on the representations of existing links. Our experimental results show that our proposed approach outperforms existing methods, particularly when used with fusion-based attributed NRL models","PeriodicalId":269527,"journal":{"name":"Fusion: Practice and Applications","volume":"260 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improving Link Prediction in Network Representation Learning with Feature Fusion and Local Outlier Factor\",\"authors\":\"A. Al-furas, M. Alrahmawy, W. M. Al-Adrousy, S. Elmougy\",\"doi\":\"10.54216/fpa.120210\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Complex networks are a diverse set of networks found in various fields, such as social, technological, and biological networks. One important task in complex network analysis is link prediction, which involves detecting missing links or predicting future link formation. Many methods based on network structure analysis have been developed for link prediction, including network representation learning (NRL) models that represent nodes in a low-dimensional space. Fusion-based attributed NRL methods are particularly effective, as they capture both content and structure information. However, NRL models for link prediction are binary classification models, which face challenges in identifying negative links and prioritizing predicted links. To address these challenges, we propose a novel approach that treats link prediction as a novelty detection problem. Our approach uses the Local Outlier Factor (LOF) algorithm to quantify the novelty of non-existent links based on the representations of existing links. Our experimental results show that our proposed approach outperforms existing methods, particularly when used with fusion-based attributed NRL models\",\"PeriodicalId\":269527,\"journal\":{\"name\":\"Fusion: Practice and Applications\",\"volume\":\"260 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fusion: Practice and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.54216/fpa.120210\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fusion: Practice and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54216/fpa.120210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

复杂网络是在社会、技术和生物网络等各个领域中发现的各种网络。链路预测是复杂网络分析中的一项重要任务,它包括检测缺失链路或预测未来的链路形成。许多基于网络结构分析的链路预测方法已经被开发出来,包括在低维空间中表示节点的网络表示学习(NRL)模型。基于融合的属性NRL方法特别有效,因为它们同时捕获内容和结构信息。然而,用于链路预测的NRL模型是二元分类模型,在识别负面链路和确定预测链路的优先级方面面临挑战。为了解决这些挑战,我们提出了一种将链接预测视为新颖性检测问题的新方法。我们的方法使用局部离群因子(LOF)算法,根据现有链接的表示来量化不存在链接的新颖性。我们的实验结果表明,我们提出的方法优于现有的方法,特别是当使用基于融合的属性NRL模型时
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving Link Prediction in Network Representation Learning with Feature Fusion and Local Outlier Factor
Complex networks are a diverse set of networks found in various fields, such as social, technological, and biological networks. One important task in complex network analysis is link prediction, which involves detecting missing links or predicting future link formation. Many methods based on network structure analysis have been developed for link prediction, including network representation learning (NRL) models that represent nodes in a low-dimensional space. Fusion-based attributed NRL methods are particularly effective, as they capture both content and structure information. However, NRL models for link prediction are binary classification models, which face challenges in identifying negative links and prioritizing predicted links. To address these challenges, we propose a novel approach that treats link prediction as a novelty detection problem. Our approach uses the Local Outlier Factor (LOF) algorithm to quantify the novelty of non-existent links based on the representations of existing links. Our experimental results show that our proposed approach outperforms existing methods, particularly when used with fusion-based attributed NRL models
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.00
自引率
0.00%
发文量
0
×
引用
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学术官方微信