NPC: Neighbors Progressive Competition Algorithm for Classification of Imbalanced Data Sets
Soroush Saryazdi, Bahareh Nikpour, Hossein Nezamabadi-pour

TL;DR
This paper introduces NPC, a new classifier that progressively considers neighbors and uses a novel grading method to effectively address class imbalance in datasets without manual parameters.
Contribution
The paper presents NPC, a novel imbalance classification algorithm that differs from k-NN by progressively considering neighbors and employing a new grading method based on local and global info.
Findings
NPC outperforms five benchmark algorithms on fifteen datasets.
The method effectively handles severe class imbalance.
No manual parameter tuning required for NPC.
Abstract
Learning from many real-world datasets is limited by a problem called the class imbalance problem. A dataset is imbalanced when one class (the majority class) has significantly more samples than the other class (the minority class). Such datasets cause typical machine learning algorithms to perform poorly on the classification task. To overcome this issue, this paper proposes a new approach Neighbors Progressive Competition (NPC) for classification of imbalanced datasets. Whilst the proposed algorithm is inspired by weighted k-Nearest Neighbor (k-NN) algorithms, it has major differences from them. Unlike k- NN, NPC does not limit its decision criteria to a preset number of nearest neighbors. In contrast, NPC considers progressively more neighbors of the query sample in its decision making until the sum of grades for one class is much higher than the other classes. Furthermore, NPC uses…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
