基于三元闭包的节点相似性链路预测算法
TP391; 链路预测作为复杂网络分析的基本方法被应用到很多领域,完全基于拓扑结构信息的复杂网络链路预测仍然是一个具有挑战性的问题.三元闭包作为网络中最小局部结构,具有结构平衡和稳定的特征.提出了一种基于三元闭包的节点相似性链路预测算法,通过计算出每个节点在网络中所占三元闭包的权重,并将该权重用于节点相似性指标中,提出了3个相似性指标TWCN、TWAA、TWRA和具有调节参数的3个相似性指标TWCN*、TWAA*、TWRA*.在10个不同的网络数据集上的实验结果表明,所提算法能够提高链路预测的精度.不仅如此,通过分析实验结果,发现在社交网络中拥有较多三元闭包的节点具有局部稳定性,不倾向于建立更...
Saved in:
| Published in | 计算机科学与探索 Vol. 11; no. 5; pp. 822 - 832 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | Chinese |
| Published |
安徽大学计算机科学与技术学院,合肥,230601
2017
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1673-9418 |
| DOI | 10.3778/j.issn.1673-9418.1605039 |
Cover
Loading…
| Abstract | TP391; 链路预测作为复杂网络分析的基本方法被应用到很多领域,完全基于拓扑结构信息的复杂网络链路预测仍然是一个具有挑战性的问题.三元闭包作为网络中最小局部结构,具有结构平衡和稳定的特征.提出了一种基于三元闭包的节点相似性链路预测算法,通过计算出每个节点在网络中所占三元闭包的权重,并将该权重用于节点相似性指标中,提出了3个相似性指标TWCN、TWAA、TWRA和具有调节参数的3个相似性指标TWCN*、TWAA*、TWRA*.在10个不同的网络数据集上的实验结果表明,所提算法能够提高链路预测的精度.不仅如此,通过分析实验结果,发现在社交网络中拥有较多三元闭包的节点具有局部稳定性,不倾向于建立更多的新链接;相反,拥有较少三元闭包的节点具有局部不稳定性,倾向于建立更多的新链接.这种现象也符合社会学中有关弱关系产生链接的现象. |
|---|---|
| AbstractList | TP391; 链路预测作为复杂网络分析的基本方法被应用到很多领域,完全基于拓扑结构信息的复杂网络链路预测仍然是一个具有挑战性的问题.三元闭包作为网络中最小局部结构,具有结构平衡和稳定的特征.提出了一种基于三元闭包的节点相似性链路预测算法,通过计算出每个节点在网络中所占三元闭包的权重,并将该权重用于节点相似性指标中,提出了3个相似性指标TWCN、TWAA、TWRA和具有调节参数的3个相似性指标TWCN*、TWAA*、TWRA*.在10个不同的网络数据集上的实验结果表明,所提算法能够提高链路预测的精度.不仅如此,通过分析实验结果,发现在社交网络中拥有较多三元闭包的节点具有局部稳定性,不倾向于建立更多的新链接;相反,拥有较少三元闭包的节点具有局部不稳定性,倾向于建立更多的新链接.这种现象也符合社会学中有关弱关系产生链接的现象. |
| Abstract_FL | Link prediction is a fundamental method for analyzing complex network which has been widely used in many domains.Link prediction in complex network based on solely topological information is a challenging problem.As one of the basic local structure,triadic closure has the characteristics of structural balance and stability.This paper proposes a link prediction algorithm to measure the similarity of nodes based on triadic closure.By calculating the weight of each node in the network according to the triadic closure,and using the weights in the node similarity index,this paper proposes three similarity indexes of TWCN,TWAA,TWRA and the other three similarity indexes of TWCN*,TWAA*,TWRA* with adjustment parameter.The experimental results on ten real network datasets demonstrate that the new method can improve the accuracy of link prediction.Moreover,by analyzing the experiment results,this paper finds that the network with more triadic closure nodes tends to be more stable.In other words,a network with less triadic closure nodes is less stable,and it is more likely to establish a new link with others.This phenomenon is also consistent with some related phenomenon in sociology on weak relations to generate links. |
| Author | 钱付兰 赵姝 高杨 张燕平 |
| AuthorAffiliation | 安徽大学计算机科学与技术学院,合肥,230601 |
| AuthorAffiliation_xml | – name: 安徽大学计算机科学与技术学院,合肥,230601 |
| Author_FL | QIAN Fulan GAO Yang ZHANG Yanping ZHAO Shu |
| Author_FL_xml | – sequence: 1 fullname: GAO Yang – sequence: 2 fullname: ZHANG Yanping – sequence: 3 fullname: QIAN Fulan – sequence: 4 fullname: ZHAO Shu |
| Author_xml | – sequence: 1 fullname: 高杨 – sequence: 2 fullname: 张燕平 – sequence: 3 fullname: 钱付兰 – sequence: 4 fullname: 赵姝 |
| BookMark | eNo9j7tKA0EARaeIYIz5B1uLXec9s6UEXxCwSR9m1hnJKhNwFLWTmBQ-sBEJaCHYWKmFiDEEv2azm_0LFxSreznFPdwFUHFdZwBYQjAkQsiVJOx470LEBQkiimTZIIMkqoDqP5sHde87GjJKMRJcVgGfPo7T8U06upgOzovhy_R6kN_3Z5e9vPeVP4zSySQ7ey5uv2efb8VTP_u4yl-H2fvdIpizat-b-l_WQGt9rdXYDJrbG1uN1WYQc0wDzrSRVBtiNGHQYExwbDRTxAhmKLdKI0KlxVpzzneotSzWymqJolhgzQSpgeXf2WPlrHK77aR7dOBKYTvxyd7J6aHHEInyJqLkB_ZOYBQ |
| ClassificationCodes | TP391 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3778/j.issn.1673-9418.1605039 |
| DatabaseName | Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| DocumentTitle_FL | Link Prediction Algorithm Based on Node Similarity of Triadic Closure |
| EndPage | 832 |
| ExternalDocumentID | jsjkxyts201705014 |
| GrantInformation_xml | – fundername: The National Natural Science Foundation of China under Grant Nos.61175046,61402006; the Natural Science Foundation of Anhui Province under Grant No.1508085MF113; the Humanities and Social Science Foundation of the Ministry of Education of China under Grant No.1508085MF113 |
| GroupedDBID | 2B. 4A8 92I 93N ALMA_UNASSIGNED_HOLDINGS M~E PSX TCJ |
| ID | FETCH-LOGICAL-c624-65be84be3eb350e2232ceb5a3e75e46fab1348f2bb666d4ff5cbafb819c72b573 |
| ISSN | 1673-9418 |
| IngestDate | Thu May 29 04:00:17 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | node weight 节点权重 triadic closure link prediction 链路预测 complex networks 复杂网络 三元闭包 |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c624-65be84be3eb350e2232ceb5a3e75e46fab1348f2bb666d4ff5cbafb819c72b573 |
| PageCount | 11 |
| ParticipantIDs | wanfang_journals_jsjkxyts201705014 |
| PublicationCentury | 2000 |
| PublicationDate | 2017 |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – year: 2017 text: 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | 计算机科学与探索 |
| PublicationTitle_FL | Journal of Frontiers of Computer Science & Technology |
| PublicationYear | 2017 |
| Publisher | 安徽大学计算机科学与技术学院,合肥,230601 |
| Publisher_xml | – name: 安徽大学计算机科学与技术学院,合肥,230601 |
| SSID | ssib054421768 ssib002040941 ssib002423894 ssib051375751 ssib023646573 ssib036438069 ssib002040926 |
| Score | 2.0615568 |
| Snippet | TP391;... |
| SourceID | wanfang |
| SourceType | Aggregation Database |
| StartPage | 822 |
| Title | 基于三元闭包的节点相似性链路预测算法 |
| URI | https://d.wanfangdata.com.cn/periodical/jsjkxyts201705014 |
| Volume | 11 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1Na9RANNR68SKKit8UcY6pyWQ-j8l2liLU0wq9lZ1solRYwd2C9iBS24MfeFCkoAfBiyf1IGItxV-zH-2_8L3JbjatCrWwDJM3b968jyTvZXbejOdd5zLKsxbnvqaC-8zq0LdhzvwgS3lL2xbNFCYnL9wS87fZzUW-OHXsdWXV0krXzqarf80rOYpVAQZ2xSzZ_7BsSRQAUAf7QgkWhvJQNiaGE10nSUwMw1IZV1FEaWxS8IuI0URLEs85SA2BRhINyIwYwIQKRQiUiXZNCVJAOjX8GYGLIWLp6EQkMdgrAYJ1hMTU0REkAeIJdo8NDoeQiBQHW45jX-wIrXG4D03XHP8Sh9AhMgmsxmIsiHEMGBwIcBIGlfE94sZPiFaODHRSkxaOrMeBEwzocgfRwFO1swaRQzdQQcVpLAkmKArFSlxn5G6uOkVS5IK629m1m5HSQUGJ03XMnNZKeY4sfIwGKJBR6SUOCOAMQGvuPgiIUs6ilMSc4NFYuAlOxekIGfmajfzQ2CuFlaePV1yMKvK4x9FKMTt80BFGUirnCHGA2XIAnEvkQbF71IFtxpc7y_cePup2qNtgKcCz4Y9TKUNcJrvw2ExCOnjr6-onKV6zfbnREAOX73g8n0DwSYgMl5EKRBlC8zCS-Ndfec0YfCQXGaxjrosFeCjSjX8J5FLu2nmzfacSHTZOeSdHn3UzcfGMnvamVu-e8UT_w3Zv-1Vv61l_4-ne5uf-y43hu_Xd52vDtZ_D91u9nZ3Bk097b37t_vi693F98P3F8Mvm4Nvbs16jbhq1eX90TomfCsp8wW2mmM2izEY8yCDepmlmeTPKJM-YyJs2jJjKqbVCiBbLc57aZm4hFE8ltaCbc950-347O-_NoLtlTWFZajWzSqs8D6hupSGg5ywVF7xrIzGXRq-hztIfhrt4GKRL3gmsF5OJl73p7oOV7AqE11171dn7NzqQmd4 |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8E%E4%B8%89%E5%85%83%E9%97%AD%E5%8C%85%E7%9A%84%E8%8A%82%E7%82%B9%E7%9B%B8%E4%BC%BC%E6%80%A7%E9%93%BE%E8%B7%AF%E9%A2%84%E6%B5%8B%E7%AE%97%E6%B3%95&rft.jtitle=%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%A7%91%E5%AD%A6%E4%B8%8E%E6%8E%A2%E7%B4%A2&rft.au=%E9%AB%98%E6%9D%A8&rft.au=%E5%BC%A0%E7%87%95%E5%B9%B3&rft.au=%E9%92%B1%E4%BB%98%E5%85%B0&rft.au=%E8%B5%B5%E5%A7%9D&rft.date=2017&rft.pub=%E5%AE%89%E5%BE%BD%E5%A4%A7%E5%AD%A6%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%A7%91%E5%AD%A6%E4%B8%8E%E6%8A%80%E6%9C%AF%E5%AD%A6%E9%99%A2%2C%E5%90%88%E8%82%A5%2C230601&rft.issn=1673-9418&rft.volume=11&rft.issue=5&rft.spage=822&rft.epage=832&rft_id=info:doi/10.3778%2Fj.issn.1673-9418.1605039&rft.externalDocID=jsjkxyts201705014 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fjsjkxyts%2Fjsjkxyts.jpg |