| Literature DB >> 35371194 |
Shengqing Ma1, Fei Hao2, Youwu Lin3, Yinjing Liang4.
Abstract
The traditional E-government big data system fills and classifies algorithms with low accuracy and poor work efficiency. With the development and wide application of big data, the internet of things, and other technologies, the integration of information resources has become the key to information construction. In the process of information resource integration, there are still outstanding problems such as incomplete government information resource system, different standards of government information resource management system construction, and serious threats to network and information security. In order to solve this problem, a new E-government big data system filling and classification algorithm is studied in the cloud computing environment; E-government big data filling is carried out on the basis of complete compatibility theory; and the E-government big data computing intelligence system in the cloud computing environment is constructed and its development impact, so as to parallelize the data, classify the data through decision trees, and realize incremental update decision forest parallelization processing. To verify the effectiveness of the method, comparative experiments are set, and the results demonstrate that experiment one is randomly built into the classification model, and according to the decision forest algorithm, the optimal number of decision trees is 24.Entities:
Mesh:
Year: 2022 PMID: 35371194 PMCID: PMC8970969 DOI: 10.1155/2022/7295060
Source DB: PubMed Journal: Comput Intell Neurosci
Figure 1Principles of government information resource integration.
Figure 2Big data platform system for government services.
Figure 3Big data system for public information.
Figure 4E-government big data system management architecture.
Contents of the UCI data set.
| Serial number | Data set | Number of samples | Attribute | Catalogue |
|---|---|---|---|---|
| 1 | Abalone | 4,045 | 8 | 4 |
| 2 | CMC | 1,276 | 8 | 3 |
| 3 | Nursery | 11,298 | 8 | 3 |
| 4 | Abalone | 4,065 | 9 | 5 |
| 5 | Yeast | 1,439 | 6 | 4 |
HAD platform PC configuration table.
| Name | High-performance PC | Ordinary PC |
|---|---|---|
| CPU processor | I5-2620M | I5-2260M |
| Memory (GB) | 8 | 4 |
| Hard disk (GB) | 1,024 | 512 |
| Operating system | WIN7 | WIN7 |
| Operating environment | HAD-1.11 | HAD-1.11 |
Figure 5Simulation flow.
Figure 6Comparison of the accuracy of filling in missing data sets.
Figure 7Plot of time versus number of decision trees.
Figure 8Number of nodes versus number of decision trees.
Comparison of the classification accuracy of the four algorithms (%).
| Number of iterations | Traditional random forest algorithm | Discrete stochastic forest algorithm | Weakly correlated random forest algorithm | Algorithm in this paper |
|---|---|---|---|---|
| 1 | 78.23 | 76.75 | 80.23 | 95.25 |
| 2 | 78.64 | 78.47 | 79.45 | 98.34 |
| 3 | 86.74 | 80.32 | 81.26 | 94.33 |
| 4 | 69.04 | 74.85 | 80.54 | 95.25 |
| 5 | 71.65 | 79.42 | 83.69 | 96.22 |
| 6 | 80.59 | 75.73 | 80.83 | 94.34 |
| 7 | 75.29 | 76.39 | 79.51 | 96.36 |
| 8 | 75.84 | 77.54 | 78.84 | 94.86 |