Cargando…
Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm
Each Chinese region has its own ancient opera, which is a treasure of folk culture and a living fossil for studying the historical origins of a local culture. It has significant academic value and historical significance at the national and local levels, whether from the perspective of promoting and...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9283029/ https://www.ncbi.nlm.nih.gov/pubmed/35845894 http://dx.doi.org/10.1155/2022/6679237 |
_version_ | 1784747244327534592 |
---|---|
author | Li, Cenxi Liu, Boya |
author_facet | Li, Cenxi Liu, Boya |
author_sort | Li, Cenxi |
collection | PubMed |
description | Each Chinese region has its own ancient opera, which is a treasure of folk culture and a living fossil for studying the historical origins of a local culture. It has significant academic value and historical significance at the national and local levels, whether from the perspective of promoting and disseminating national culture or from the perspective of protecting the world's intangible cultural heritage. Based on this practical significance, this paper conducts a study using the particle swarm algorithm to manage the marketing archives of drama intangible cultural heritage. The article employs the PSO algorithm to test the particle swarm optimization algorithm's convergence and conditions. The effectiveness of the algorithm is analysed in the Sphere function, Rosenbrock function, Griewanks function, and Rastrigin noncont function, and then the algorithm is compared, including the calculation speed comparison between the algorithm in this paper and the three optimal fitness functions. The experimental results show that the PSO algorithm has the highest four items in the statistics of the Schwefel function experimental results. About 45.0379 is the best value and 70.5878 is the maximum precision. The optimal average value is 6.1524, while the average value is 56.15245. In comparison to the QPSO and PSO algorithms, the algorithm in this paper has a faster convergence speed and better search accuracy. The topic of the intersection of the disciplines of drama, intangible cultural heritage marketing, and archive management using the particle swarm algorithm is well-developed. |
format | Online Article Text |
id | pubmed-9283029 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Hindawi |
record_format | MEDLINE/PubMed |
spelling | pubmed-92830292022-07-15 Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm Li, Cenxi Liu, Boya Comput Intell Neurosci Research Article Each Chinese region has its own ancient opera, which is a treasure of folk culture and a living fossil for studying the historical origins of a local culture. It has significant academic value and historical significance at the national and local levels, whether from the perspective of promoting and disseminating national culture or from the perspective of protecting the world's intangible cultural heritage. Based on this practical significance, this paper conducts a study using the particle swarm algorithm to manage the marketing archives of drama intangible cultural heritage. The article employs the PSO algorithm to test the particle swarm optimization algorithm's convergence and conditions. The effectiveness of the algorithm is analysed in the Sphere function, Rosenbrock function, Griewanks function, and Rastrigin noncont function, and then the algorithm is compared, including the calculation speed comparison between the algorithm in this paper and the three optimal fitness functions. The experimental results show that the PSO algorithm has the highest four items in the statistics of the Schwefel function experimental results. About 45.0379 is the best value and 70.5878 is the maximum precision. The optimal average value is 6.1524, while the average value is 56.15245. In comparison to the QPSO and PSO algorithms, the algorithm in this paper has a faster convergence speed and better search accuracy. The topic of the intersection of the disciplines of drama, intangible cultural heritage marketing, and archive management using the particle swarm algorithm is well-developed. Hindawi 2022-07-07 /pmc/articles/PMC9283029/ /pubmed/35845894 http://dx.doi.org/10.1155/2022/6679237 Text en Copyright © 2022 Cenxi Li and Boya Liu. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Article Li, Cenxi Liu, Boya Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm |
title | Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm |
title_full | Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm |
title_fullStr | Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm |
title_full_unstemmed | Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm |
title_short | Marketing Archive Management of Drama Intangible Cultural Heritage Based on Particle Swarm Algorithm |
title_sort | marketing archive management of drama intangible cultural heritage based on particle swarm algorithm |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9283029/ https://www.ncbi.nlm.nih.gov/pubmed/35845894 http://dx.doi.org/10.1155/2022/6679237 |
work_keys_str_mv | AT licenxi marketingarchivemanagementofdramaintangibleculturalheritagebasedonparticleswarmalgorithm AT liuboya marketingarchivemanagementofdramaintangibleculturalheritagebasedonparticleswarmalgorithm |