期刊文献+

使用监督学习技术在学术社交网络中进行链路预测 被引量:2

Predicting the links in academic social networks with supervised learning technique
下载PDF
导出
摘要 链路预测是社交网络研究中最核心、最本质的研究问题。文章基于学术合作关系社交网络,采用多种现有的经典机器学习算法进行链路预测。针对现有监督学习算法中特征集使用不够全面的问题,抽取了三大类别的特征。针对数据高度偏斜问题,采用了欠采样的方式使模型不对主要类别过度偏斜,以此保证分类器的有效性。实验结果表明,Adaboost和多层前馈神经网络模型在精确率、召回率以及F1-measure指标上优于其他监督学习方法,而朴素贝叶斯方法在本问题上表现最差。 Link prediction is the core and essential research issue in social networks research. Based on the academic co-authorship networks, eight existing classical machine learning algorithms are used for link prediction. Three categories of features are extracted for link prediction to solve the problem that the features don’t be used comprehensively in the existing supervised learning algorithms. And the under-sampling is used for the problem of high skewness of data, to overcome the model skewness and to ensure the validity of the classifiers. Experimental results show that Adaboost and Multi-Layer Perceptron model are superior to the other six models in Precision, Recall and F1-measure. However, Naive Bayesian performs the worst.
作者 赵素芬 Zhao Sufen(School of Computer, Central China Normal University, Wuhan, Hubei 430079, China;School of Computer Science, Wuhan University)
出处 《计算机时代》 2019年第1期39-42,45,共5页 Computer Era
基金 国家自然科学基金(61170026) 国家重点研发计划(2017YFB0503700 2016YFB0501801) 国家标准研究计划(2016BZYJ-WG7-001) 华中师范大学中央高校基本科研业务费青年教师创新项目(CCNU18QN019)
关键词 社交网络 链路预测 机器学习 监督学习 数据偏斜 social networks link prediction machine learning supervised learning data skewness
  • 相关文献

参考文献1

二级参考文献130

  • 1Aiello L M, Barrat A, Schifanella R, et al. Friendship prediction and homophily in social media. ACM Trans Web, 2012, 6: 9.
  • 2Mori J, Kajikawa Y, Kashima H, et al. Machine learning approach for finding business partners and building reciprocal relationships. Expert Syst Appl, 2012, 39: 10402-10407.
  • 3Wu S, Sun J, Tang J. Patent partner recommendation in enterprise social networks. In: Proceedings of the 6th ACM International Conference on Web Search and Data Mining (WSDM'13), Rome, 2013. 43-52.
  • 4Akcora C G, Carminati B, Ferrari E. Network and profile based measures for user similarities on social networks. In: Proceedings of the 12th IEEE International Conference on Information Reuse and Integration, Las Vegas, 2011. 292-298.
  • 5Tang J, Wu S, Sun J M, et al. Cross-domain collaboration recommendation. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'12), Beijing, 2012. 1285-1293.
  • 6Pavlov M, Ichise R. Finding experts by link prediction in co-authorship networks. In: Proceedings of the 2nd International ISWC+ASWC Workshop on Finding Experts on the Web with Semantics (FEWS), Busan, 2007. 42-55.
  • 7Wohlfarth T, Ichise R. Semantic and event-based approach for link prediction. In: Proceedings of the 7th International Conference on Practical Aspects of Knowledge Management (PAKM'08), Yokohama, 2008. 50-61.
  • 8Raeder T, Lizardo O, Hachen D, et al. Predictors of short-term decay of cell phone contacts in a large scale communication network. Soc Netw, 2011, 33: 245-257.
  • 9Marchette D J, Priebe C E. Predicting unobserved links in incompletely observed networks. Comput Stat Data Anal, 2008, 52: 1373-1386.
  • 10Kim M, Leskovec J. The network completion problem: inferring missing nodes and edges in networks. In: Proceedings of the 11th SIAM International Conference on Data Mining (SDM'11), Mesa, 2011. 47-58.

共引文献52

同被引文献23

引证文献2

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部