Title: A data classification algorithm for ideological and political teaching resources integrating density peak clustering and random forest

Authors: Liping Xu; Qinghua Zhang

Addresses: School of Civil Engineering, Hunan City University, Yiyang, 413000, Hunan, China ' School of Materials and Chemical Engineering, Hunan City University, Yiyang, 413000, Hunan, China

Abstract: In this paper, a data classification algorithm for ideological and political teaching resources that integrates density peak clustering and random forest is proposed. Firstly, process missing and outlier values through data cleaning steps to ensure data quality. Next, using correlation analysis and information gain based methods, important features for classification are selected to reduce the dimensionality of the data. Subsequently, the density peak clustering method was used to automatically discover the clustering structure in the data through adaptive distance measurement and local density calculation. Finally, the random forest algorithm is used for classification, and through a dynamic weighted voting mechanism, the voting weight of each decision tree is determined based on its classification accuracy on the validation set to optimise the classification performance. The experimental results show that this method effectively improves the efficiency and accuracy of data classification.

Keywords: density peak clustering; random forest; teaching resources; dynamic weighted voting.

DOI: 10.1504/IJCAT.2026.153110

International Journal of Computer Applications in Technology, 2026 Vol.78 No.3, pp.204 - 212

Received: 04 Dec 2024
Accepted: 22 Apr 2025
Published online: 22 Apr 2026 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article