Classification of imbalanced data with a geometric digraph family

DOI10.48550/ARXIV.1904.04564zbMATH Open1392.62190arXiv1904.04564MaRDI QIDQ158226FDOQ158226

Authors: Artür Manukyan, Elvan Ceyhan 

Publication date: 9 April 2019

Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Abstract: We use a geometric digraph family called class cover catch digraphs (CCCDs) to tackle the class imbalance problem in statistical classification. CCCDs provide graph theoretic solutions to the class cover problem and have been employed in classification. We assess the classification performance of CCCD classifiers by extensive Monte Carlo simulations, comparing them with other classifiers commonly used in the literature. In particular, we show that CCCD classifiers perform relatively well when one class is more frequent than the other in a two-class setting, an example of the class imbalance problem. We also point out the relationship between class imbalance and class overlapping problems, and their influence on the performance of CCCD classifiers and other classification methods as well as some state-of-the-art algorithms which are robust to class imbalance by construction. Experiments on both simulated and real data sets indicate that CCCD classifiers are robust to the class imbalance problem. CCCDs substantially undersample from the majority class while preserving the information on the discarded points during the undersampling process. Many state-of-the-art methods, however, keep this information by means of ensemble classifiers, but CCCDs yield only a single classifier with the same property, making it both appealing and fast.

Full work available at URL: https://arxiv.org/abs/1904.04564

Recommendations

• Classification using proximity catch digraphs
• A new family of proximity graphs: class cover catch digraphs
• scientific article; zbMATH DE number 2101406
• High dimensional classifiers in the imbalanced case
• \(2v\)-SSPC: a new classification method for class-imbalanced data

zbMATH Keywords

class cover catch digraphsclass cover problemclass imbalance problemclass overlapping problemgraph dominationprototype selectionsupport estimation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Monte Carlo methods (65C05) Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20)

Cited In (6)

• Classification using class cover catch digraphs
• Domination number of an interval catch digraph family and its use for testing uniformity
• Law of large numbers for a two-dimensional class cover problem
• A new family of proximity graphs: class cover catch digraphs
• Classification using proximity catch digraphs
• rcccd

Uses Software

• R
• UCI-ml
• JStatCom
• LIBSVM
• KEEL
• e1071
• AdaBoost.MH
• C4.5
• dd_tools
• cccd

This page was built for publication: Classification of imbalanced data with a geometric digraph family

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q158226)