{'fraction_non_alphanumeric': 0.019024970273483946, 'fraction_numerical': 0.005945303210463734, 'mean_word_length': 4.6891891891891895, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Incremental Learning Algorithm of Data Complexity Based on KNN Classifier

In practice, new data are constantly generated, and the existing data complexity algorithms are based on the idea of batch learning. In the face of the dynamic increase of data scale, how to measure the characteristic information of data has become an urgent problem to be solved in the field of data mining. This paper focuses on this problem and further studies its incremental learning function on the basis of in-depth discussion of data complexity proposed by TK Ho et al. Among them, N3 and N4 are the complexity indexes based on KNN classifier (K=1). In this paper, the incremental learning algorithm I1NN was proposed on the basis of 1-NN classifier, and its feasibility and validity were verified on both the artificial data set and the UCI public data set.