| Literature DB >> 36089976 |
Lina Deng1, Fuguo Zhang1, Bo Yang2.
Abstract
Popularizing contemporary Chinese Marxism is urgently needed in order to support the ongoing development of socialism with Chinese characteristics as well as the inherent necessity of Marxism. This essay views the popularization of Marxism as a turning point in the new media environment. It examines the necessity and reality of this popularization in the new media era, considers the new development needs of the popularization of Marxism in propaganda, and further unearths the original construction concepts of the popularization of the Marxism propaganda network. In parallel, a Marxist learning platform is built using data mining technology. Studies reveal that this algorithm has a high clustering accuracy and a recall rate that is about 6% higher than DECluster's. Additionally, this algorithm takes less time to execute under the same scale transaction set. This demonstrates the superior performance of this algorithm. The user's learning record and learning interests can be formed into an intuitive law using the algorithm presented in this study, which can be used to analyze and calculate the user's learning content related to Marxism. This law can then be used to assist the user in creating a customized learning plan for Marxism.Entities:
Mesh:
Year: 2022 PMID: 36089976 PMCID: PMC9458409 DOI: 10.1155/2022/1231601
Source DB: PubMed Journal: J Environ Public Health ISSN: 1687-9805
Figure 1Educational data mining process.
Figure 2Marxist learning platform model.
System development environment of this study.
| Serial number | Hardware environment | Pentium D CPU 2.8 GHz, 1 GB RAM |
|---|---|---|
| 1 | Operating system | Windows XP |
| 2 | Development platform | Microsoft ASP.Net |
| 3 | Web server | IIS5.1 |
| 4 | Programming language | C# |
| 5 | Database system | Access2003 |
Figure 3Comparison of clustering accuracy of different algorithms on iris data set.
Figure 4Comparison of clustering accuracy of different algorithms on wine dataset.
Figure 5Recall results of different algorithms.
Aprori algorithm test results.
| Transaction number | Support degree | |||
|---|---|---|---|---|
| 0.2 | 0.3 | 0.5 | 0.7 | |
| 500 | 0.0310 | 0.0180 | 0.0110 | 0.0050 |
| 1000 | 0.0410 | 0.0200 | 0.0190 | 0.0100 |
| 2000 | 0.0890 | 0.0680 | 0.0510 | 0.0310 |
Test results of this algorithm.
| Transaction number | Support degree | |||
|---|---|---|---|---|
| 0.2 | 0.3 | 0.5 | 0.7 | |
| 500 | 0.0180 | 0.0150 | 0.0090 | 0.0030 |
| 1000 | 0.0250 | 0.0180 | 0.0170 | 0.0080 |
| 2000 | 0.0410 | 0.0350 | 0.0290 | 0.0210 |
Figure 6Execution time of algorithm under different support levels.
Figure 7Execution time of different algorithms for transaction sets of different sizes.