Observation points classifier ensemble for high‐dimensional imbalanced classification
In this paper, an Observation Points Classifier Ensemble (OPCE) algorithm is proposed to deal with High‐Dimensional Imbalanced Classification (HDIC) problems based on data processed using the Multi‐Dimensional Scaling (MDS) feature extraction technique. First, dimensionality of the original imbalanc...
Gespeichert in:
Veröffentlicht in: | CAAI Transactions on Intelligence Technology 2023-06, Vol.8 (2), p.500-517 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, an Observation Points Classifier Ensemble (OPCE) algorithm is proposed to deal with High‐Dimensional Imbalanced Classification (HDIC) problems based on data processed using the Multi‐Dimensional Scaling (MDS) feature extraction technique. First, dimensionality of the original imbalanced data is reduced using MDS so that distances between any two different samples are preserved as well as possible. Second, a novel OPCE algorithm is applied to classify imbalanced samples by placing optimised observation points in a low‐dimensional data space. Third, optimization of the observation point mappings is carried out to obtain a reliable assessment of the unknown samples. Exhaustive experiments have been conducted to evaluate the feasibility, rationality, and effectiveness of the proposed OPCE algorithm using seven benchmark HDIC data sets. Experimental results show that (1) the OPCE algorithm can be trained faster on low‐dimensional imbalanced data than on high‐dimensional data; (2) the OPCE algorithm can correctly identify samples as the number of optimised observation points is increased; and (3) statistical analysis reveals that OPCE yields better HDIC performances on the selected data sets in comparison with eight other HDIC algorithms. This demonstrates that OPCE is a viable algorithm to deal with HDIC problems. |
---|---|
ISSN: | 2468-2322 2468-2322 |
DOI: | 10.1049/cit2.12100 |