基于模型分割和特征集成的新媒体事件预警系统研究

Li Wen
{"title":"基于模型分割和特征集成的新媒体事件预警系统研究","authors":"Li Wen","doi":"10.1145/3510858.3511363","DOIUrl":null,"url":null,"abstract":"In recent years, with the increasing number of Internet users and mobile phone users in China, various social contradictions have been discussed locally from the real world to the global discussion of the virtual world. In order to distinguish new media events in time and accurately, based on the analysis of common clustering algorithms, a hybrid K-means genetic algorithm suitable for clustering new media events is proposed by combining genetic algorithm with K-means algorithm. The algorithm uses the optimal preservation strategy, single-point crossover and single-point mutation to ensure the convergence of the hybrid K-means genetic algorithm to a greater extent. Multi-round merging based on dynamic weights is adopted to make segmentation results suitable for retrieval requirements, and the retrieval method of feature integration is improved. On the basis of the initial weights, the weight knowledge base can be stabilized through a certain number of user feedback training processes. Finally, according to the weights in the knowledge base, different features are integrated for retrieval. Experimental results show that the algorithm is effective.","PeriodicalId":6757,"journal":{"name":"2021 IEEE 3rd International Conference on Civil Aviation Safety and Information Technology (ICCASIT)","volume":"72 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Early Warning System of New Media Events Based on Model Segmentation and Feature Integration\",\"authors\":\"Li Wen\",\"doi\":\"10.1145/3510858.3511363\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, with the increasing number of Internet users and mobile phone users in China, various social contradictions have been discussed locally from the real world to the global discussion of the virtual world. In order to distinguish new media events in time and accurately, based on the analysis of common clustering algorithms, a hybrid K-means genetic algorithm suitable for clustering new media events is proposed by combining genetic algorithm with K-means algorithm. The algorithm uses the optimal preservation strategy, single-point crossover and single-point mutation to ensure the convergence of the hybrid K-means genetic algorithm to a greater extent. Multi-round merging based on dynamic weights is adopted to make segmentation results suitable for retrieval requirements, and the retrieval method of feature integration is improved. On the basis of the initial weights, the weight knowledge base can be stabilized through a certain number of user feedback training processes. Finally, according to the weights in the knowledge base, different features are integrated for retrieval. Experimental results show that the algorithm is effective.\",\"PeriodicalId\":6757,\"journal\":{\"name\":\"2021 IEEE 3rd International Conference on Civil Aviation Safety and Information Technology (ICCASIT)\",\"volume\":\"72 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 3rd International Conference on Civil Aviation Safety and Information Technology (ICCASIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3510858.3511363\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 3rd International Conference on Civil Aviation Safety and Information Technology (ICCASIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3510858.3511363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,随着中国互联网用户和手机用户数量的不断增加,各种社会矛盾从现实世界的局部讨论到虚拟世界的全球讨论。为了及时准确地区分新媒体事件,在分析常用聚类算法的基础上,将遗传算法与K-means算法相结合,提出了一种适用于新媒体事件聚类的混合K-means遗传算法。该算法采用最优保存策略、单点交叉和单点突变,更大程度上保证了混合k均值遗传算法的收敛性。采用基于动态权值的多轮合并,使分割结果符合检索要求,改进了特征集成检索方法。在初始权值的基础上,通过一定次数的用户反馈训练过程,可以稳定权值知识库。最后,根据知识库中的权重,整合不同的特征进行检索。实验结果表明,该算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Early Warning System of New Media Events Based on Model Segmentation and Feature Integration
In recent years, with the increasing number of Internet users and mobile phone users in China, various social contradictions have been discussed locally from the real world to the global discussion of the virtual world. In order to distinguish new media events in time and accurately, based on the analysis of common clustering algorithms, a hybrid K-means genetic algorithm suitable for clustering new media events is proposed by combining genetic algorithm with K-means algorithm. The algorithm uses the optimal preservation strategy, single-point crossover and single-point mutation to ensure the convergence of the hybrid K-means genetic algorithm to a greater extent. Multi-round merging based on dynamic weights is adopted to make segmentation results suitable for retrieval requirements, and the retrieval method of feature integration is improved. On the basis of the initial weights, the weight knowledge base can be stabilized through a certain number of user feedback training processes. Finally, according to the weights in the knowledge base, different features are integrated for retrieval. Experimental results show that the algorithm is effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信