{'fraction_non_alphanumeric': 0.01828681424446583, 'fraction_numerical': 0.0, 'mean_word_length': 5.459627329192546, '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}}
On new sequential hard c-means and its kernelization

This paper presents a new sequential clustering algorithm based on sequential hard c-means clustering. The word sequential cluster extraction means that the algorithm extract one cluster at a time. The sequential hard c-means is one of the typical and conventional sequential clustering methods. The proposed new sequential clustering algorithm is based on Dave's noise clustering approach. A characteristic parameter which is called noise parameter is applied in Dave's approach. We construct a new sequential hard c-means algorithm by introducing another new parameter which controls a number of extracting objects and considering the noise parameter as a variables in optimization problem. First, the optimization problem of new sequential hard c-means clustering is introduced. Next, the sequential clustering algorithm and its kernelization are constructed based on above optimization problem. Moreover, the effectiveness of proposed method is shown through numerical experiments.