期刊文献+

基于结构深度网络嵌入模型的节点标签分类算法 被引量:2

Node Label Classification Algorithm Based on Structural Depth Network Embedding Model
下载PDF
导出
摘要 在海量数据呈现爆炸增长态势的互联网时代,传统算法已无法满足处理大规模、多类型数据的需求。近年来最新的图嵌入算法通过学习图网络特征,在链路预测、网络重构和节点分类实践中普遍取得了极佳的效果。文中基于传统自动编码器模型,创新地提出了一种融合Sdne算法与链路预测相似度矩阵的新算法,通过在反向传播过程中引入高阶损失函数,依据自编码器的新特征调整性能,改进传统算法中以单一方式判定节点相似度这一方法存在的弊端,并建立简易模型分析证明优化的合理性。对比最新研究中效果最好的Sdne算法,该算法在Micro-F1和Macro-F1两种评价指标上的提升效果均接近1%,可视化分类效果表现良好。与此同时,研究发现高阶损失函数超参的最优值大致处于1~10范围内,数值的变化依旧能够基本稳定维持整体网络的鲁棒性。 In the era of Internet,where massive data is growing explosively,traditional algorithms have been unable to meet the needs of processing large-scale and multi type data.In recent years,the latest graph embedding algorithm has achieved excellent results in link prediction,network reconstruction and node classification by learning graph network characteristics.Based on the traditional automatic encoder model,a new algorithm combining Sdne algorithm and link prediction similarity matrix is proposed.By introducing a high-order loss function in the process of back-propagation,the performance is adjusted according to the new characteristics of the auto-encoder.The disadvantages of traditional algorithm in determining node similarity in a single way are improved.A simple model is established to analyze and prove the rationality of the optimization.Compared with the most effective Sdne algorithm in the latest research,the improvement effect of this algorithm on Micro-F1and Macro-F1two evaluation indicators is close to 1%,and the visual classification effect is good.At the same time,it is found that the optimal value of the hyperparameter of the higher-order loss function is approximately in the range of 1~10,and the change of the numerical value can basically maintain the robustness of the whole network.
作者 陈世聪 袁得嵛 黄淑华 杨明 CHEN Shi-cong;YUAN De-yu;HUANG Shu-hua;and YANG Ming(School of Information and Cyber Security,People’s Public Security University of China,Beijing 100038,China;Key Laboratory of Safety Precautions and Risk Assessment,Ministry of Public Security,Beijing 100038,China)
出处 《计算机科学》 CSCD 北大核心 2022年第3期105-112,共8页 Computer Science
基金 国家社会科学基金重点项目(20AZD114) 中国人民公安大学基本科研业务费项目(2021JKF215) 中国人民公安大学公共安全行为科学实验室开放课题(2020SYS03) 警务物联网应用技术公安部重点实验室开放课题。
关键词 网络嵌入 深度学习 节点分类 自动编码器 复杂网络 Network embedding Deep learning Node classification Auto-encoder Complex network
  • 相关文献

参考文献1

二级参考文献28

  • 1Baeza-Yates R,Ribeiro-Neto B.Modern Information Retrieval[M].New York:ACM press,1999.
  • 2Manning C D,Schütze H.Foundations of Statistical NaturalLanguage Processing [M].Cambridge:MIT press,1999.
  • 3Hwang M,Choi C,Youn B,et al.Word Sense Disambiguation Based on Relation Structure[C]∥International Conference on Advanced Language Processing and Web Information Technology.2008:15-20.
  • 4Wang X,Mccallum A,Wei X.Topical N-Grams:Phrase andTopic Discovery,with an Application to Information Retrieval [C]∥IEEE International Conference on Data Mining.IEEE Computer Society,2007:697-702.
  • 5Haruechaiyasak C,Jitkrittum W,Sangkeettrakarn C,et al.Im-plementing News Article Category Browsing Based on Text Categorization Technique [C]∥2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.IEEE Computer Society,2008:143-146.
  • 6Mikolov T,Sutskever I,Chen K,et al.Distributed Representations of Words and Phrases and their Compositionality [J].Advances in Neural Information Processing Systems,2013,26:3111-3119.
  • 7Mikolov T,Chen K,Corrado G,et al.Efficient Estimation of Word Representations in Vector Space [C]∥ICLR 2013.2013.
  • 8Joachims T.A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization [M].Springer US,1997:143-151.
  • 9Hinton G E.Learning distributed representations of concepts[C]∥Proceedings of CogSci.1986:1-12.
  • 10Socher R,Bauer J,Manning C D,et al.Parsing with Compositional Vector Grammars [C]∥Meeting of the Association for Computational Linguistics.2013:455-465.

共引文献136

同被引文献12

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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