{'fraction_non_alphanumeric': 0.021663778162911613, 'fraction_numerical': 0.0, 'mean_word_length': 5.676300578034682, '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}}
Ensemble learning for the partial label ranking problem

The partial label ranking problem is a general interpretation of the preference learning scenario known as the label ranking problem, the goal of which is to learn preference classifiers able to predict a complete ranking with ties over the finite set of labels of the class variable. In this paper, we use unsupervised discretization techniques (equal‐frequency and equal‐width binning) to heuristically select the threshold for the numerical features in the algorithms based on induction of decision trees (partial label ranking trees algorithm). Moreover, we adapt the most well‐known averaging (bootstrap aggregating and random forests) and boosting (adaptive boosting) ensemble methods to the partial label ranking problem, in order to improve the robustness of the built classifiers. We compare the proposed methods with the nearest neighbors‐based algorithm (instance based partial label ranking) over the standard benchmark datasets, showing that our versions of the ensemble methods are superior in terms of accuracy. Furthermore, they are affordable in terms of computational efficiency.