Oracle Recognition of Oracle Network Based on Ant Colony Algorithm

Recent studies have shown that compared with traditional social networks, networks in which users socialize through interest recommendation have obvious homogeneity characteristics. Recommending topics of interest to users has become one of the main objectives of recommendation systems in such socia...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Xianjin Shi, Xiajiong Shen
Formato:	article
Lenguaje:	EN
Publicado:	Frontiers Media S.A. 2021
Materias:	weak relationships oracle social networks interest-based recommendations ant colony algorithms heterogeneous networks Physics QC1-999
Acceso en línea:	https://doaj.org/article/3f485e24bdc1479b8cf11bc2ff799de1
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:3f485e24bdc1479b8cf11bc2ff799de1
record_format	dspace
spelling	oai:doaj.org-article:3f485e24bdc1479b8cf11bc2ff799de12021-11-08T07:34:42ZOracle Recognition of Oracle Network Based on Ant Colony Algorithm2296-424X10.3389/fphy.2021.768336https://doaj.org/article/3f485e24bdc1479b8cf11bc2ff799de12021-11-01T00:00:00Zhttps://www.frontiersin.org/articles/10.3389/fphy.2021.768336/fullhttps://doaj.org/toc/2296-424XRecent studies have shown that compared with traditional social networks, networks in which users socialize through interest recommendation have obvious homogeneity characteristics. Recommending topics of interest to users has become one of the main objectives of recommendation systems in such social networks, and the widespread data sparsity in such social networks has become the main problem faced by such recommendation systems. Particularly, in the oracle interest network, this problem is more difficult to solve because there are very few people who read and understand the Oracle. To address this problem, we propose an ant colony algorithm based recognition algorithm that can greatly expand the data in the oracle interest network and thus improve the efficiency of oracle interest network recommendation in this paper. Using the one-to-one correspondence between characters and translation in Oracle rubbings, the Oracle recognition problem is transformed into character matching problem, which can skip manual feature engineering experts, so as to realize efficient Oracle recognition. First, the coordinates of each character in the oracle bones are extracted. Then, the matching degree value of each oracle character corresponding to the translation of the oracle rubbings is assigned according to the coordinates. Finally, the maximum matching degree value of each character is searched using the improved ant colony algorithm, and the search result is the Chinese character corresponding to the oracle rubbings. In this paper, through experimental simulation, it is proved that this method is very effective when applied to the field of oracle recognition, and the recognition rate can approach 100% in some special oracle rubbings.Xianjin ShiXianjin ShiXiajiong ShenXiajiong ShenFrontiers Media S.A.articleweak relationshipsoracle social networksinterest-based recommendationsant colony algorithmsheterogeneous networksPhysicsQC1-999ENFrontiers in Physics, Vol 9 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	weak relationships oracle social networks interest-based recommendations ant colony algorithms heterogeneous networks Physics QC1-999
spellingShingle	weak relationships oracle social networks interest-based recommendations ant colony algorithms heterogeneous networks Physics QC1-999 Xianjin Shi Xianjin Shi Xiajiong Shen Xiajiong Shen Oracle Recognition of Oracle Network Based on Ant Colony Algorithm
description	Recent studies have shown that compared with traditional social networks, networks in which users socialize through interest recommendation have obvious homogeneity characteristics. Recommending topics of interest to users has become one of the main objectives of recommendation systems in such social networks, and the widespread data sparsity in such social networks has become the main problem faced by such recommendation systems. Particularly, in the oracle interest network, this problem is more difficult to solve because there are very few people who read and understand the Oracle. To address this problem, we propose an ant colony algorithm based recognition algorithm that can greatly expand the data in the oracle interest network and thus improve the efficiency of oracle interest network recommendation in this paper. Using the one-to-one correspondence between characters and translation in Oracle rubbings, the Oracle recognition problem is transformed into character matching problem, which can skip manual feature engineering experts, so as to realize efficient Oracle recognition. First, the coordinates of each character in the oracle bones are extracted. Then, the matching degree value of each oracle character corresponding to the translation of the oracle rubbings is assigned according to the coordinates. Finally, the maximum matching degree value of each character is searched using the improved ant colony algorithm, and the search result is the Chinese character corresponding to the oracle rubbings. In this paper, through experimental simulation, it is proved that this method is very effective when applied to the field of oracle recognition, and the recognition rate can approach 100% in some special oracle rubbings.
format	article
author	Xianjin Shi Xianjin Shi Xiajiong Shen Xiajiong Shen
author_facet	Xianjin Shi Xianjin Shi Xiajiong Shen Xiajiong Shen
author_sort	Xianjin Shi
title	Oracle Recognition of Oracle Network Based on Ant Colony Algorithm
title_short	Oracle Recognition of Oracle Network Based on Ant Colony Algorithm
title_full	Oracle Recognition of Oracle Network Based on Ant Colony Algorithm
title_fullStr	Oracle Recognition of Oracle Network Based on Ant Colony Algorithm
title_full_unstemmed	Oracle Recognition of Oracle Network Based on Ant Colony Algorithm
title_sort	oracle recognition of oracle network based on ant colony algorithm
publisher	Frontiers Media S.A.
publishDate	2021
url	https://doaj.org/article/3f485e24bdc1479b8cf11bc2ff799de1
work_keys_str_mv	AT xianjinshi oraclerecognitionoforaclenetworkbasedonantcolonyalgorithm AT xianjinshi oraclerecognitionoforaclenetworkbasedonantcolonyalgorithm AT xiajiongshen oraclerecognitionoforaclenetworkbasedonantcolonyalgorithm AT xiajiongshen oraclerecognitionoforaclenetworkbasedonantcolonyalgorithm
_version_	1718442899419430912

Oracle Recognition of Oracle Network Based on Ant Colony Algorithm

Ejemplares similares