{"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}
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.