多特征融合标签传播计算机算法在图像搜索与匹配中的应用与研究

Jiale Li
{"title":"多特征融合标签传播计算机算法在图像搜索与匹配中的应用与研究","authors":"Jiale Li","doi":"10.62051/qbfrsc53","DOIUrl":null,"url":null,"abstract":"When analyzing the advantages and disadvantages of common community discovery algorithms, the paper points out that the label propagation algorithm (LPA) has low time complexity, does not need to set the number of communities in advance, and the calculation process is simple. When dealing with large and complex networks, it has high the characteristics of efficiency. However, the algorithm does not consider the similarity of adjacent nodes in the network structure and content in the process of label propagation. Therefore, from the perspective of node similarity, the paper proposes a multi-feature fusion label propagation algorithm. The algorithm first uses the Sim Rank algorithm to calculate the structural similarity of the nodes in the network, and at the same time uses the main body model to obtain the topic distribution of the node content, and calculates the similarity of the topic distribution of different nodes, and finally merges the two similarities to be the label propagated by adjacent nodes, Give the corresponding weight to improve the communication strategy. Experimental comparison shows that this algorithm is better than the traditional label propagation algorithm.","PeriodicalId":509968,"journal":{"name":"Transactions on Computer Science and Intelligent Systems Research","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Application and Research of Multi-Feature Fusion Tag Propagation Computer Algorithm in Image Search and Matching\",\"authors\":\"Jiale Li\",\"doi\":\"10.62051/qbfrsc53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When analyzing the advantages and disadvantages of common community discovery algorithms, the paper points out that the label propagation algorithm (LPA) has low time complexity, does not need to set the number of communities in advance, and the calculation process is simple. When dealing with large and complex networks, it has high the characteristics of efficiency. However, the algorithm does not consider the similarity of adjacent nodes in the network structure and content in the process of label propagation. Therefore, from the perspective of node similarity, the paper proposes a multi-feature fusion label propagation algorithm. The algorithm first uses the Sim Rank algorithm to calculate the structural similarity of the nodes in the network, and at the same time uses the main body model to obtain the topic distribution of the node content, and calculates the similarity of the topic distribution of different nodes, and finally merges the two similarities to be the label propagated by adjacent nodes, Give the corresponding weight to improve the communication strategy. Experimental comparison shows that this algorithm is better than the traditional label propagation algorithm.\",\"PeriodicalId\":509968,\"journal\":{\"name\":\"Transactions on Computer Science and Intelligent Systems Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Computer Science and Intelligent Systems Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.62051/qbfrsc53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Computer Science and Intelligent Systems Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.62051/qbfrsc53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在分析常见社区发现算法的优缺点时,本文指出标签传播算法(LPA)具有时间复杂度低、无需提前设置社区数量、计算过程简单等特点。在处理大型复杂网络时,它具有效率高的特点。但是,该算法在标签传播过程中没有考虑网络结构和内容中相邻节点的相似性。因此,本文从节点相似性的角度出发,提出了一种多特征融合标签传播算法。该算法首先利用 Sim Rank 算法计算网络中节点的结构相似度,同时利用主体模型获取节点内容的话题分布,并计算不同节点话题分布的相似度,最后将两者相似度合并为相邻节点传播的标签,赋予相应权重以改进传播策略。实验对比表明,该算法优于传统的标签传播算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Application and Research of Multi-Feature Fusion Tag Propagation Computer Algorithm in Image Search and Matching
When analyzing the advantages and disadvantages of common community discovery algorithms, the paper points out that the label propagation algorithm (LPA) has low time complexity, does not need to set the number of communities in advance, and the calculation process is simple. When dealing with large and complex networks, it has high the characteristics of efficiency. However, the algorithm does not consider the similarity of adjacent nodes in the network structure and content in the process of label propagation. Therefore, from the perspective of node similarity, the paper proposes a multi-feature fusion label propagation algorithm. The algorithm first uses the Sim Rank algorithm to calculate the structural similarity of the nodes in the network, and at the same time uses the main body model to obtain the topic distribution of the node content, and calculates the similarity of the topic distribution of different nodes, and finally merges the two similarities to be the label propagated by adjacent nodes, Give the corresponding weight to improve the communication strategy. Experimental comparison shows that this algorithm is better than the traditional label propagation algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信