{'fraction_non_alphanumeric': 0.03067484662576687, 'fraction_numerical': 0.0, 'mean_word_length': 5.838323353293413, '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}}
Hyperspectral Imbalanced Datasets Classification Using Filter-Based Forest Methods

A large variety of algorithms have been proposed for hyperspectral data classification in the literature. Among them, classical forest methods, such as bagged tree, random forest, oblique random forest, and rotation forest, have received much attention, thanks to their efficiency. Recently, two filter-based forest methods, called balanced filter-based forest (BFF) and cost-sensitive filter-based forest (CFF), have been proposed for high-dimensional data classification. These methods also have the solutions for imbalanced data problem. In this paper, these two methods were examined and compared with the classical forest methods for the classification of several well-known imbalanced hyperspectral datasets. The results indicated higher efficiency and reliability of the filter-based forests as compared to the classical forests. Moreover, they were smaller and sparser ensembles than the competitors. Furthermore, these two forests (especially BFF) were generally more successful for the classification of minority classes in hyperspectral datasets.