{"title":"基于特征的链路预测","authors":"Saoussen Aouay, Salma Jamoussi, F. Gargouri","doi":"10.1109/AICCSA.2014.7073243","DOIUrl":null,"url":null,"abstract":"Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Feature based link prediction\",\"authors\":\"Saoussen Aouay, Salma Jamoussi, F. Gargouri\",\"doi\":\"10.1109/AICCSA.2014.7073243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.\",\"PeriodicalId\":412749,\"journal\":{\"name\":\"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICCSA.2014.7073243\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2014.7073243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.