基于拓扑特征和集成模型的链路预测方法

Shruti Pachaury, Nilesh Kumar, Ayush Khanduri, H. Mittal
{"title":"基于拓扑特征和集成模型的链路预测方法","authors":"Shruti Pachaury, Nilesh Kumar, Ayush Khanduri, H. Mittal","doi":"10.1109/IC3.2018.8530624","DOIUrl":null,"url":null,"abstract":"Online social networking has progressively been the new interdisciplinary research area, especially for developing new strategies of investigating these informal networks containing billions of users. However, such networks might not represent real-world connections among people either due to imperfect procurement forms or not yet reflected on the online platform like friends in real-world might not connect with each other online. To predict these unknown connections in the online community is still an open-ended problem. In this paper, a novel link prediction method is proposed to find the missing connections in the social network graphs. The proposed method extracts topological features from the network graph which are used to train an ensemble learning model i.e., random forest classifier. The trained model is used to predict the missing connections. The experimental evaluation is conducted on two networking dataset namely; ‘Facebook networking dataset’ and the ‘Flickr following dataset’ publicly available on Stanford Network Analysis Project (SNAP) and Koblenz Network Collection (KONECT) respectively. The comparison is done with the prediction results on the same features by the state-of-the-art learning models namely; linear support vector machine (LSVM), K-Nearest Neighbours (KNN), AdaBoost, and Gradient Boost. The performance of the considered methods is defined in terms of accuracy, precision, recall, F1-measure, and AUC value. Additionally, the efficiency of the proposed method is validated against the existing link prediction method. The experimental results conclude that the proposed method is accurate than the compared methods in uncovering the hidden links of a social network.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Link Prediction Method Using Topological Features and Ensemble Model\",\"authors\":\"Shruti Pachaury, Nilesh Kumar, Ayush Khanduri, H. Mittal\",\"doi\":\"10.1109/IC3.2018.8530624\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online social networking has progressively been the new interdisciplinary research area, especially for developing new strategies of investigating these informal networks containing billions of users. However, such networks might not represent real-world connections among people either due to imperfect procurement forms or not yet reflected on the online platform like friends in real-world might not connect with each other online. To predict these unknown connections in the online community is still an open-ended problem. In this paper, a novel link prediction method is proposed to find the missing connections in the social network graphs. The proposed method extracts topological features from the network graph which are used to train an ensemble learning model i.e., random forest classifier. The trained model is used to predict the missing connections. The experimental evaluation is conducted on two networking dataset namely; ‘Facebook networking dataset’ and the ‘Flickr following dataset’ publicly available on Stanford Network Analysis Project (SNAP) and Koblenz Network Collection (KONECT) respectively. The comparison is done with the prediction results on the same features by the state-of-the-art learning models namely; linear support vector machine (LSVM), K-Nearest Neighbours (KNN), AdaBoost, and Gradient Boost. The performance of the considered methods is defined in terms of accuracy, precision, recall, F1-measure, and AUC value. Additionally, the efficiency of the proposed method is validated against the existing link prediction method. The experimental results conclude that the proposed method is accurate than the compared methods in uncovering the hidden links of a social network.\",\"PeriodicalId\":118388,\"journal\":{\"name\":\"2018 Eleventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eleventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2018.8530624\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2018.8530624","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在线社交网络已逐渐成为一个新的跨学科研究领域,特别是对于开发新的策略来调查这些包含数十亿用户的非正式网络。然而,这种网络可能并不代表现实世界中人与人之间的联系,因为采购形式不完善,或者还没有反映在网络平台上,比如现实世界中的朋友可能不会在网上相互联系。预测在线社区中这些未知的联系仍然是一个开放式的问题。本文提出了一种新的链接预测方法,用于寻找社交网络图中缺失的连接。该方法从网络图中提取拓扑特征,用于训练集成学习模型即随机森林分类器。训练后的模型用于预测缺失的连接。在两个网络数据集上进行了实验评估;“Facebook网络数据集”和“Flickr跟踪数据集”分别在斯坦福网络分析项目(SNAP)和科布伦茨网络收集(KONECT)上公开。与目前最先进的学习模型对相同特征的预测结果进行比较;线性支持向量机(LSVM), k近邻(KNN), AdaBoost和梯度增强。所考虑的方法的性能是根据准确度、精密度、召回率、f1测量和AUC值来定义的。此外,对比现有的链路预测方法,验证了所提方法的有效性。实验结果表明,该方法在发现社交网络的隐藏链接方面比其他方法更准确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link Prediction Method Using Topological Features and Ensemble Model
Online social networking has progressively been the new interdisciplinary research area, especially for developing new strategies of investigating these informal networks containing billions of users. However, such networks might not represent real-world connections among people either due to imperfect procurement forms or not yet reflected on the online platform like friends in real-world might not connect with each other online. To predict these unknown connections in the online community is still an open-ended problem. In this paper, a novel link prediction method is proposed to find the missing connections in the social network graphs. The proposed method extracts topological features from the network graph which are used to train an ensemble learning model i.e., random forest classifier. The trained model is used to predict the missing connections. The experimental evaluation is conducted on two networking dataset namely; ‘Facebook networking dataset’ and the ‘Flickr following dataset’ publicly available on Stanford Network Analysis Project (SNAP) and Koblenz Network Collection (KONECT) respectively. The comparison is done with the prediction results on the same features by the state-of-the-art learning models namely; linear support vector machine (LSVM), K-Nearest Neighbours (KNN), AdaBoost, and Gradient Boost. The performance of the considered methods is defined in terms of accuracy, precision, recall, F1-measure, and AUC value. Additionally, the efficiency of the proposed method is validated against the existing link prediction method. The experimental results conclude that the proposed method is accurate than the compared methods in uncovering the hidden links of a social network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信