{"title":"基于simmrank和蚁群优化的社交网站好友推荐算法","authors":"Lian-ju NING, Hai-yan DUAN","doi":"10.1016/S1005-8885(14)60508-2","DOIUrl":null,"url":null,"abstract":"<div><p>We put forward an algorithm on friend-recommendation of social networking sites based on SimRank and ant colony optimization, which broadens the appliance of the algorithm in this academic question. The algorithm focuses on the existing relationships between the members as the initial measurement and constructs artificial ants’ completed routing graph. Finally, an ordered and limited list of personalized recommendations through recursive optimization is produced. In the end, we verify the algorithm's rationality and validity through simulation and the result shows that it can improve the precision of friend-recommendation.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 79-87"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60508-2","citationCount":"3","resultStr":"{\"title\":\"An algorithm for friend-recommendation of social networking sites based on SimRank and ant colony optimization\",\"authors\":\"Lian-ju NING, Hai-yan DUAN\",\"doi\":\"10.1016/S1005-8885(14)60508-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We put forward an algorithm on friend-recommendation of social networking sites based on SimRank and ant colony optimization, which broadens the appliance of the algorithm in this academic question. The algorithm focuses on the existing relationships between the members as the initial measurement and constructs artificial ants’ completed routing graph. Finally, an ordered and limited list of personalized recommendations through recursive optimization is produced. In the end, we verify the algorithm's rationality and validity through simulation and the result shows that it can improve the precision of friend-recommendation.</p></div>\",\"PeriodicalId\":35359,\"journal\":{\"name\":\"Journal of China Universities of Posts and Telecommunications\",\"volume\":\"21 \",\"pages\":\"Pages 79-87\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60508-2\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of China Universities of Posts and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1005888514605082\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of China Universities of Posts and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1005888514605082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
An algorithm for friend-recommendation of social networking sites based on SimRank and ant colony optimization
We put forward an algorithm on friend-recommendation of social networking sites based on SimRank and ant colony optimization, which broadens the appliance of the algorithm in this academic question. The algorithm focuses on the existing relationships between the members as the initial measurement and constructs artificial ants’ completed routing graph. Finally, an ordered and limited list of personalized recommendations through recursive optimization is produced. In the end, we verify the algorithm's rationality and validity through simulation and the result shows that it can improve the precision of friend-recommendation.