{"title":"Relationships between network's structure features and link prediction algorithms","authors":"J. Jun, Hu Xiao-feng","doi":"10.1109/INFOMAN.2016.7477535","DOIUrl":null,"url":null,"abstract":"The first essential thing on the application of link prediction is how to choose the right prediction algorithm. We experimented with five virtual networks and analyzed the relationship between those networks' structure features and six typical link prediction algorithms by the experiment's data in this paper. We found that if the network's assortativity coefficient is positive and the clustering coefficient is greater than the threshold which is about 0.1, the algorithms based on local information would get higher prediction results, otherwise the based global information would be better. And the clustering coefficient and efficiency are proportional to the accuracy of algorithms based local information and are reverse proportional to the algorithms based global information. These conclusions provide the quantitative basis for selecting the right algorithms in link prediction application.","PeriodicalId":182252,"journal":{"name":"2016 2nd International Conference on Information Management (ICIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Information Management (ICIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOMAN.2016.7477535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The first essential thing on the application of link prediction is how to choose the right prediction algorithm. We experimented with five virtual networks and analyzed the relationship between those networks' structure features and six typical link prediction algorithms by the experiment's data in this paper. We found that if the network's assortativity coefficient is positive and the clustering coefficient is greater than the threshold which is about 0.1, the algorithms based on local information would get higher prediction results, otherwise the based global information would be better. And the clustering coefficient and efficiency are proportional to the accuracy of algorithms based local information and are reverse proportional to the algorithms based global information. These conclusions provide the quantitative basis for selecting the right algorithms in link prediction application.