{'fraction_non_alphanumeric': 0.01990049751243781, 'fraction_numerical': 0.0008291873963515755, 'mean_word_length': 6.1420118343195265, '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}}
Towards the Constraint Learning and Optimization Approach to Document Clustering

This research proposed autonomous constraint learning from a document collection to incorporate these constraints into an effective document clustering process. Constraint Clustering is based on semi-supervised approach towards document clustering, where some prior knowledge about the collection is readily available for clustering. The paper proposes algorithms based on sampling to find three different kind of constraints from the document collection (i) instance level (ii) cluster level and (iii) corpus level. The constraints integrated into constraint K-Mean produced multiple clusters satisfying the constraints. A boosting method is suggested to adaptively learn the constraint's priorities, constraint satisfaction criteria and optimal clustering solution from multiple possible solutions. The proposed algorithms are implemented and tested over standard text mining dataset. The evaluation measures for testing the algorithm involves purity, entropy, and F-measure. This experimental studies achieved encouraging results for constraint learning and on average, 6% improvements are achieved on clustering results.