R. Yadav, Shashi Prakash Tripathi, A. K. Rai, R. Tewari
{"title":"基于混合特征的社交网络系统好友推荐方法","authors":"R. Yadav, Shashi Prakash Tripathi, A. K. Rai, R. Tewari","doi":"10.1504/ijwbc.2020.10024150","DOIUrl":null,"url":null,"abstract":"Link prediction is an effective technique to be applied on graph-based models due to its wide range of applications. It helps to understand associations between nodes in social communities. The social networking systems use link prediction techniques to recommend new friends to their users. In this paper, we design two time efficient algorithms for finding all paths of length-2 and length-3 between every pair of vertices in a network which are further used in computation of final similarity scores in the proposed method. Further, we define a hybrid feature-based node similarity measure for link prediction that captures both local and global graph features. The designed similarity measure provides friend recommendations by traversing only paths of limited length, which causes more faster and accurate friend recommendations. Experimental results show adequate level of accuracy in friend recommendations within considerable computing time.","PeriodicalId":39041,"journal":{"name":"International Journal of Web Based Communities","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hybrid Feature Based Approach for Recommending Friends in Social Networking Systems\",\"authors\":\"R. Yadav, Shashi Prakash Tripathi, A. K. Rai, R. Tewari\",\"doi\":\"10.1504/ijwbc.2020.10024150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction is an effective technique to be applied on graph-based models due to its wide range of applications. It helps to understand associations between nodes in social communities. The social networking systems use link prediction techniques to recommend new friends to their users. In this paper, we design two time efficient algorithms for finding all paths of length-2 and length-3 between every pair of vertices in a network which are further used in computation of final similarity scores in the proposed method. Further, we define a hybrid feature-based node similarity measure for link prediction that captures both local and global graph features. The designed similarity measure provides friend recommendations by traversing only paths of limited length, which causes more faster and accurate friend recommendations. Experimental results show adequate level of accuracy in friend recommendations within considerable computing time.\",\"PeriodicalId\":39041,\"journal\":{\"name\":\"International Journal of Web Based Communities\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web Based Communities\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijwbc.2020.10024150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Based Communities","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijwbc.2020.10024150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Social Sciences","Score":null,"Total":0}
Hybrid Feature Based Approach for Recommending Friends in Social Networking Systems
Link prediction is an effective technique to be applied on graph-based models due to its wide range of applications. It helps to understand associations between nodes in social communities. The social networking systems use link prediction techniques to recommend new friends to their users. In this paper, we design two time efficient algorithms for finding all paths of length-2 and length-3 between every pair of vertices in a network which are further used in computation of final similarity scores in the proposed method. Further, we define a hybrid feature-based node similarity measure for link prediction that captures both local and global graph features. The designed similarity measure provides friend recommendations by traversing only paths of limited length, which causes more faster and accurate friend recommendations. Experimental results show adequate level of accuracy in friend recommendations within considerable computing time.