A Novel Scheme for Recruitment Text Categorization Based on KNN Algorithm

With the rapid development of the Internet, online recruitment has gradually become mainstream. However, job seekers need to spend a lot of time to find a suitable job when there are a large variety of job information, which will seriously affect their efficiency, so it is necessary to carry out more detailed and efficient classification of the recruitment documents. Currently, common text classification algorithms include KNN (k-Nearest Neighbor), SVM (Support Vector Machine) and Naive Bayes. Particularly, KNN algorithm is widely used in text classification for its simple implementation and accurate classification. But KNN algorithm has been criticized for its inefficiency in the face of large-scale recruitment. This paper improves the original KNN algorithm and proposes RS-KNN algorithm to achieve rapid refinement and classification of recruitment information. Experiments show that the improved algorithm has higher efficiency and less time consumption than the original algorithm.

[1]  Daphne Koller,et al.  Support Vector Machine Active Learning with Applications to Text Classification , 2000, J. Mach. Learn. Res..

[2]  Xiaolong Wu,et al.  Chinese Text Classification Review , 2018, 2018 9th International Conference on Information Technology in Medicine and Education (ITME).

[3]  Keke Gai,et al.  A Classification Algorithm Based on Ensemble Feature Selections for Imbalanced-Class Dataset , 2016, 2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS).

[4]  Peng Li,et al.  Semantic Clustering-Based Deep Hypergraph Model for Online Reviews Semantic Classification in Cyber-Physical-Social Systems , 2018, IEEE Access.

[5]  Keke Gai,et al.  Energy-aware task assignment for mobile cyber-enabled applications in heterogeneous cloud computing , 2018, J. Parallel Distributed Comput..

[6]  Haoran Xie,et al.  Top K representative: a method to select representative samples based on K nearest neighbors , 2019, Int. J. Mach. Learn. Cybern..

[7]  Rossitza Setchi,et al.  Feature selection using Joint Mutual Information Maximisation , 2015, Expert Syst. Appl..

[8]  Keke Gai,et al.  An Empirical Study on Preprocessing High-Dimensional Class-Imbalanced Data for Classification , 2015, 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conference on Embedded Software and Systems.

[9]  Stephen E. Fienberg,et al.  The Use of Chi‐Squared Statistics for Categorical Data Problems , 1979 .

[10]  Zhihui Lu,et al.  Fusion of Cognitive Wireless Networks and Edge Computing , 2019, IEEE Wireless Communications.

[11]  Jun Zhao,et al.  Recurrent Convolutional Neural Networks for Text Classification , 2015, AAAI.

[12]  Xun Wang,et al.  Research and Implementation of a Multi-label Learning Algorithm for Chinese Text Classification , 2017, 2017 3rd International Conference on Big Data Computing and Communications (BIGCOM).

[14]  Tomas Mikolov,et al.  Enriching Word Vectors with Subword Information , 2016, TACL.

[15]  Meikang Qiu,et al.  Reinforcement Learning-based Content-Centric Services in Mobile Sensing , 2018, IEEE Network.

[16]  Yali Wang,et al.  KNN-based Kalman filter: An efficient and non-stationary method for Gaussian process regression , 2016, Knowl. Based Syst..

[17]  Yan Zhao,et al.  Improved KNN text classification algorithm with MapReduce implementation , 2017, 2017 4th International Conference on Systems and Informatics (ICSAI).

[18]  Yaochu Jin,et al.  Feature selection for high-dimensional classification using a competitive swarm optimizer , 2016, Soft Computing.

[19]  Marc Najork,et al.  Mercator: A scalable, extensible Web crawler , 1999, World Wide Web.