A novel algorithm for text classification based on KNN and chaotic binary particle swarm optimization

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The main problem of chinese text classification is the high dimensional feature space. A novel algorithm for text classification based on KNN and chaotic particle swarm optimization is proposed. The algorithm utilizes chaotic particle swarm algorithm to traverse the feature space of training set and selects feature subspace, then utilizes KNN algorithm to classify text in feature subspace. In the particle swarm's iterative process, chaotic map is used to guide swarms for chaotic search. It makes the algorithm out of local optimum, and expands the ability of finding global optimal solution. Experimental results show that the novel algorithm for chinese text classification is effective, the classification accuracy and recall rate are better than KNN algorithm. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Xu, H., Lu, S., & Zhou, S. (2013). A novel algorithm for text classification based on KNN and chaotic binary particle swarm optimization. In Lecture Notes in Electrical Engineering (Vol. 211 LNEE, pp. 619–627). https://doi.org/10.1007/978-3-642-34522-7_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free