{'fraction_non_alphanumeric': 0.015053763440860216, 'fraction_numerical': 0.0, 'mean_word_length': 5.3744292237442925, '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}}
Optimal threshold value determination for land change detection

Recently data mining techniques have emerged as an important technique to detect land change by detecting the sudden change and/or gradual change in time series of vegetation index dataset. In this technique, the algorithms takes the vegetation index time series data set as input and provides a list of change scores as output and each change score corresponding to a particular location. If the change score of a location is greater than some threshold value, then that location is considered as change. In this paper, we proposed a two step process for threshold determination: first step determine the upper and lower boundary for threshold and second step find the optimal point between upper and lower boundary, for change detection algorithm. Further, by engaging this process, we determine the threshold value for both Recursive Merging Algorithm and Recursive Search Algorithm and presented a comparative study of these algorithms for detecting changes in time series data. These techniques are evaluated quantitatively using synthetic dataset, which is analogous to vegetation index time series data set. The quantitative evaluation of the algorithms shows that the Recursive Merging (RM) method performs reasonably well, but the Recursive Search Algorithm (RSA) significantly outperforms in the presence of cyclic data.