Research on sensitive text classification detection and classification based on improved artificial neural network

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Haisheng Gu, Qing Li, Duanming Shen
{"title":"Research on sensitive text classification detection and classification based on improved artificial neural network","authors":"Haisheng Gu, Qing Li, Duanming Shen","doi":"10.1007/s10878-023-01085-8","DOIUrl":null,"url":null,"abstract":"<p>With the rapid development of information technology, a large number of sensitive words have appeared, which has brought great harm to network security and social stability. Therefore, how to identify and classify these sensitive information accurately has become an important issue. Combined with the improved artificial network algorithm, an adaptive classification algorithm is proposed in the experiment, which can provide local intelligent classification service according to the classification results. At the same time, the algorithm transforms the clustering model structure of the traditional network algorithm, introduces the classification information, so that it can be applied to the classification problem, and expands the application field of the data field theory. The experimental results show that: (1) From the experimental results of different text quantities, the SOM algorithm assigns the classification task to different levels of nodes, and realizes the modularization of detection. (2) The overall mean results show that the highest recall rate is 87%, which has met the basic grading criteria, and the detection accuracy of sensitive words will also be improved. (3) The experimental results show that the algorithm can accurately classify the sensitive and speed up the parameter optimization, and is superior to the comparison algorithm in many indicators. (4) From the simulation results, compared with the traditional neural network algorithm, the precision and recall of the algorithm are maintained at more than 90% and the loss is less than 0.11.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-023-01085-8","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

Abstract

With the rapid development of information technology, a large number of sensitive words have appeared, which has brought great harm to network security and social stability. Therefore, how to identify and classify these sensitive information accurately has become an important issue. Combined with the improved artificial network algorithm, an adaptive classification algorithm is proposed in the experiment, which can provide local intelligent classification service according to the classification results. At the same time, the algorithm transforms the clustering model structure of the traditional network algorithm, introduces the classification information, so that it can be applied to the classification problem, and expands the application field of the data field theory. The experimental results show that: (1) From the experimental results of different text quantities, the SOM algorithm assigns the classification task to different levels of nodes, and realizes the modularization of detection. (2) The overall mean results show that the highest recall rate is 87%, which has met the basic grading criteria, and the detection accuracy of sensitive words will also be improved. (3) The experimental results show that the algorithm can accurately classify the sensitive and speed up the parameter optimization, and is superior to the comparison algorithm in many indicators. (4) From the simulation results, compared with the traditional neural network algorithm, the precision and recall of the algorithm are maintained at more than 90% and the loss is less than 0.11.

Abstract Image

基于改进人工神经网络的敏感文本分类检测与分类研究
随着信息技术的飞速发展,出现了大量的敏感词,给网络安全和社会稳定带来了极大的危害。因此,如何准确识别和分类这些敏感信息就成为一个重要问题。实验中结合改进的人工网络算法,提出了一种自适应分类算法,可以根据分类结果提供局部智能分类服务。同时,该算法改变了传统网络算法的聚类模型结构,引入了分类信息,使其能够应用于分类问题,拓展了数据场理论的应用领域。实验结果表明:(1)从不同文本量的实验结果来看,SOM算法将分类任务分配给不同级别的节点,实现了检测的模块化。(2) 总体均值结果显示,最高召回率为87%,已达到基本分级标准,敏感词的检测准确率也将提高。(3) 实验结果表明,该算法能够准确地对敏感点进行分类,加快参数优化速度,在许多指标上都优于比较算法。(4) 从仿真结果来看,与传统的神经网络算法相比,该算法的精度和召回率保持在90%以上,损失小于0.11。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信