Shruti Pachaury, Nilesh Kumar, Ayush Khanduri, H. Mittal
{"title":"基于拓扑特征和集成模型的链路预测方法","authors":"Shruti Pachaury, Nilesh Kumar, Ayush Khanduri, H. Mittal","doi":"10.1109/IC3.2018.8530624","DOIUrl":null,"url":null,"abstract":"Online social networking has progressively been the new interdisciplinary research area, especially for developing new strategies of investigating these informal networks containing billions of users. However, such networks might not represent real-world connections among people either due to imperfect procurement forms or not yet reflected on the online platform like friends in real-world might not connect with each other online. To predict these unknown connections in the online community is still an open-ended problem. In this paper, a novel link prediction method is proposed to find the missing connections in the social network graphs. The proposed method extracts topological features from the network graph which are used to train an ensemble learning model i.e., random forest classifier. The trained model is used to predict the missing connections. The experimental evaluation is conducted on two networking dataset namely; ‘Facebook networking dataset’ and the ‘Flickr following dataset’ publicly available on Stanford Network Analysis Project (SNAP) and Koblenz Network Collection (KONECT) respectively. The comparison is done with the prediction results on the same features by the state-of-the-art learning models namely; linear support vector machine (LSVM), K-Nearest Neighbours (KNN), AdaBoost, and Gradient Boost. The performance of the considered methods is defined in terms of accuracy, precision, recall, F1-measure, and AUC value. Additionally, the efficiency of the proposed method is validated against the existing link prediction method. The experimental results conclude that the proposed method is accurate than the compared methods in uncovering the hidden links of a social network.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Link Prediction Method Using Topological Features and Ensemble Model\",\"authors\":\"Shruti Pachaury, Nilesh Kumar, Ayush Khanduri, H. Mittal\",\"doi\":\"10.1109/IC3.2018.8530624\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online social networking has progressively been the new interdisciplinary research area, especially for developing new strategies of investigating these informal networks containing billions of users. However, such networks might not represent real-world connections among people either due to imperfect procurement forms or not yet reflected on the online platform like friends in real-world might not connect with each other online. To predict these unknown connections in the online community is still an open-ended problem. In this paper, a novel link prediction method is proposed to find the missing connections in the social network graphs. The proposed method extracts topological features from the network graph which are used to train an ensemble learning model i.e., random forest classifier. The trained model is used to predict the missing connections. The experimental evaluation is conducted on two networking dataset namely; ‘Facebook networking dataset’ and the ‘Flickr following dataset’ publicly available on Stanford Network Analysis Project (SNAP) and Koblenz Network Collection (KONECT) respectively. The comparison is done with the prediction results on the same features by the state-of-the-art learning models namely; linear support vector machine (LSVM), K-Nearest Neighbours (KNN), AdaBoost, and Gradient Boost. The performance of the considered methods is defined in terms of accuracy, precision, recall, F1-measure, and AUC value. Additionally, the efficiency of the proposed method is validated against the existing link prediction method. The experimental results conclude that the proposed method is accurate than the compared methods in uncovering the hidden links of a social network.\",\"PeriodicalId\":118388,\"journal\":{\"name\":\"2018 Eleventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eleventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2018.8530624\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2018.8530624","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Link Prediction Method Using Topological Features and Ensemble Model
Online social networking has progressively been the new interdisciplinary research area, especially for developing new strategies of investigating these informal networks containing billions of users. However, such networks might not represent real-world connections among people either due to imperfect procurement forms or not yet reflected on the online platform like friends in real-world might not connect with each other online. To predict these unknown connections in the online community is still an open-ended problem. In this paper, a novel link prediction method is proposed to find the missing connections in the social network graphs. The proposed method extracts topological features from the network graph which are used to train an ensemble learning model i.e., random forest classifier. The trained model is used to predict the missing connections. The experimental evaluation is conducted on two networking dataset namely; ‘Facebook networking dataset’ and the ‘Flickr following dataset’ publicly available on Stanford Network Analysis Project (SNAP) and Koblenz Network Collection (KONECT) respectively. The comparison is done with the prediction results on the same features by the state-of-the-art learning models namely; linear support vector machine (LSVM), K-Nearest Neighbours (KNN), AdaBoost, and Gradient Boost. The performance of the considered methods is defined in terms of accuracy, precision, recall, F1-measure, and AUC value. Additionally, the efficiency of the proposed method is validated against the existing link prediction method. The experimental results conclude that the proposed method is accurate than the compared methods in uncovering the hidden links of a social network.