{"title":"基于邻近度的图中链接预测方法","authors":"M. Bojanowski, Bartosz Chrol","doi":"10.18061/ASK.V29I1.0002","DOIUrl":null,"url":null,"abstract":"Link prediction is a problem of predicting future edges of an undirected graph based on a single snapshot of data of that graph. Vertex proximity measures are indicies giving numerical scores for every pair of vertices in a graph that can be used for predicting future edges. This short note describes an R package ‘linkprediction’ implementing 20 different vertex similarity and proximity measures from the literature. The article provides the de fi nitions of implemented measures, describes the main user-facing functions, and illustrates the use of the methods with a problem of predicting future co-authorship relations between researchers of the University of Warsaw.","PeriodicalId":33339,"journal":{"name":"Ask","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Proximity-based Methods for Link Prediction in Graphs with R package 'linkprediction'\",\"authors\":\"M. Bojanowski, Bartosz Chrol\",\"doi\":\"10.18061/ASK.V29I1.0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction is a problem of predicting future edges of an undirected graph based on a single snapshot of data of that graph. Vertex proximity measures are indicies giving numerical scores for every pair of vertices in a graph that can be used for predicting future edges. This short note describes an R package ‘linkprediction’ implementing 20 different vertex similarity and proximity measures from the literature. The article provides the de fi nitions of implemented measures, describes the main user-facing functions, and illustrates the use of the methods with a problem of predicting future co-authorship relations between researchers of the University of Warsaw.\",\"PeriodicalId\":33339,\"journal\":{\"name\":\"Ask\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ask\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18061/ASK.V29I1.0002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ask","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18061/ASK.V29I1.0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proximity-based Methods for Link Prediction in Graphs with R package 'linkprediction'
Link prediction is a problem of predicting future edges of an undirected graph based on a single snapshot of data of that graph. Vertex proximity measures are indicies giving numerical scores for every pair of vertices in a graph that can be used for predicting future edges. This short note describes an R package ‘linkprediction’ implementing 20 different vertex similarity and proximity measures from the literature. The article provides the de fi nitions of implemented measures, describes the main user-facing functions, and illustrates the use of the methods with a problem of predicting future co-authorship relations between researchers of the University of Warsaw.