Information Classification Algorithm based on Project-based Learning Data-driven and Stochastic Grid
The adaptive partitioning algorithm of information set in simulation laboratory based on project-based learning data-driven and random grid is studied to effectively preprocess the information set and improve the adaptive partitioning effect of the information set. Using the improved fuzzy C-means c...
Saved in:
| Published in: | International journal of advanced computer science & applications Vol. 13; no. 9 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
West Yorkshire
Science and Information (SAI) Organization Limited
2022
|
| Subjects: | |
| ISSN: | 2158-107X, 2156-5570 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The adaptive partitioning algorithm of information set in simulation laboratory based on project-based learning data-driven and random grid is studied to effectively preprocess the information set and improve the adaptive partitioning effect of the information set. Using the improved fuzzy C-means clustering algorithm driven by project-based learning data, the fuzzy partition of information set in simulation laboratory is carried out to complete preprocessing of information set; The pre-processing information set space is roughly divided by the grid partitioning algorithm based on the data histogram; A random mesh generation algorithm based on uniformity is used to finely divide the coarse mesh cells; Taking the representative points of grid cells as the clustering center, the pre-processing information set is clustered by the density peak clustering algorithm to complete the adaptive partitioning of the information set in simulation laboratory. Experimental results show that this algorithm can effectively preprocess and adaptively partition the information set of simulation laboratory; For different dimension information sets, the evaluation index values of Rand index, Purity, standard mutual information, interval and Dunn index of the algorithm are all high, and the evaluation index values of compactness and Davidson's banding index are all low, so the algorithm has a high accuracy of adaptive partitioning of information sets. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2158-107X 2156-5570 |
| DOI: | 10.14569/IJACSA.2022.01309114 |