期刊文献+

符号网络预测准确度及时间代价的优化 被引量:2

Research about Optimizing Prediction Accuracy and Time Complexity in Signed Networks
下载PDF
导出
摘要 符号网络的预测准确度越来越高,但是时间复杂度也越来越难以接受。必须寻找有效预测方法,既保证算法预测准确度高,同时时间复杂度低。本文设计了一个优化算法,使用平衡环算法预测符号,利用函数拟合方法分别拟合预测准确度与步长、时间复杂度与步长的函数关系,分析随步长增加预测准确度与时间复杂度的关系并提出优化方案。实验显示,本文的优化算法能够有效获得预测准确度与时间复杂度的关系。本文可供设计符号预测算法的研究者参考。 In signed networks, different sign predicting algorithms have been proposed. The prediction accuracy of the algorithm is improving, but the time complexity is also increasing. A way must be found to reduce the time complexity. In order to ensure the high predict.ion accuracy and low time complexity, an optimization algorithm is designed to analyze the relation between prediction accuracy and time complexity with increasing steps and an optimization scheme is also proposed through using the balanced cycle algorithm for predicting sign at first and then fitting the function of prediction accuracy and step, time complexity and step respectively. Experiments show that the optimization algorithm can effectively obtain the relation between prediction accuracy and time complexity. This research can be used in working out design symbol prediction algorithms.
出处 《工业工程》 2017年第1期59-64,共6页 Industrial Engineering Journal
基金 国家自然科学基金资助项目(61402118) 广东省科技计划资助项目(2013B090200017 2013B010401029 2013B010401034 2016B010108007 2015B090901016 201508010067) 广州市科技计划资助项目(201508010067 2013J4500028 2013J4100004 2016201604030034 201604020145) 广东省教育厅资助项目(粤教高函2015[133]号 粤教高函[2014]97号 ZYGX008)
关键词 符号网络 符号预测 时间复杂度 优化 signed networks sign prediction time complexity optimization
  • 相关文献

参考文献3

二级参考文献10

  • 1Yao Ping HOU.Bounds for the Least Laplacian Eigenvalue of a Signed Graph[J].Acta Mathematica Sinica,English Series,2005,21(4):955-960. 被引量:5
  • 2Guha R, Kumar R, Raghavan P, et al. Propagation of trust and distrust[ C] //Proceedings of the 13th Interna- tional Conference on World Wide Web (WWW). USA: ACM Press, 2004: 403-412.
  • 3Kunegis J, Lnmmatzseh A, Bauekhage C. The slashdot zoo: mining a social network with negative edges [ C ] //Proceedings of the 18'h International Conference on World Wide Web(WWW). ESP: ACM Press, 2009: 741-750.
  • 4Liu Haifeng, Lira E P, Lauw H W, et al. Predicting trusts among users of online communities: an epinions case study[ C]// Proceedings of the 9'~ ACM Conference on Electronic Commerce. USA: ACM Press, 2008: 310- 319.
  • 5Leskovec J, Huttenlocher D, Kleinberg J. Predicting positive and negative links in online social networks [ C ] //Proceedings of the 19'h International Conference on World Wide Web (WWW). USA: ACM Press, 2010: 641-650.
  • 6Chiang K Y, Natarajan N, Tewari A, et al. Exploiting longer cycles for link prediction in signed networks[ C]// Proceedings of the 20~h ACM International Conference on Information and Knowledge Management( CIKM). USA : ACM Press, 2011: 1157-1162.
  • 7De Kerchove C, Van Dooren P. The PageTrust algo- rithm: how to rank web pages when negative links are al- lowed[ C]//SIAM International Conference on Data M in- ing(SDM). USA: ACM Press, 2008: 346-352.
  • 8Chang Chihchung, Lin Chihjen. LIBSVM: a library for support vector machines[ J]. ACM Transactions on Intel- ligent Systems and Technology, 2011, 2: 1-27.
  • 9孔令旗,杨梦龙.符号网络聚类算法FEC的改进[J].计算机应用,2011,31(5):1395-1399. 被引量:5
  • 10程苏琦,沈华伟,张国清,程学旗.符号网络研究综述[J].软件学报,2014,25(1):1-15. 被引量:44

共引文献50

同被引文献17

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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