A novel algorithm for imbalance data classification based on neighborhood hypergraph.

Area of Science:

• Computer Science
• Data Mining
• Machine Learning

Background:

• Imbalanced data classification is a significant challenge.
• Existing methods, including hypergraphs, have limitations in handling boundary data.
• There is a need for more efficient classification algorithms for imbalanced datasets.

Purpose of the Study:

• To address the limitations of current imbalanced data classification methods.
• To propose a novel classification algorithm using neighborhood hypergraphs.
• To enhance knowledge discovery and classification accuracy for imbalanced data.

Main Methods:

• Developed a neighborhood hypergraph by integrating rough set theory and hypergraph concepts.
• Proposed a three-step classification algorithm: hyperedge initialization, training data classification, and hyperedge substitution.
• Utilized 10-fold cross-validation on 18 diverse datasets for evaluation.

Main Results:

• The proposed neighborhood hypergraph algorithm achieved higher average accuracy compared to other methods.
• Demonstrated the effectiveness of the novel approach in classifying imbalanced data.
• Showcased the algorithm's capability in handling complex data distributions.

Conclusions:

• The neighborhood hypergraph approach offers a more powerful tool for imbalanced data classification.
• The developed algorithm provides a significant improvement over existing techniques.
• This method enhances the potential of hypergraphs in knowledge discovery and classification tasks.