Support vector machine with hypergraph-based pairwise constraints.

Area of Science:

• Machine Learning
• Computer Science
• Data Mining

Background:

• Support Vector Machines (SVM) are effective for classification and regression but do not fully leverage correlations between data points.
• Existing methods often overlook higher-order relationships within datasets.

Purpose of the Study:

• To propose a novel classifier, Support Vector Machine with Hypergraph-based Pairwise Constraints (SVM-HPC).
• To improve classical SVM performance by incorporating a new regularization term based on hypergraph learning and pairwise constraints.
• To enhance the exploitation of underlying data point correlations.

Main Methods:

• Development of a new regularization term using hypergraph-based pairwise constraints (HPC).
• Integration of hypergraph learning to capture high-order relationships between samples.
• Combining discrimination metric with hypergraph learning for improved prior distribution knowledge acquisition.

Main Results:

• The proposed SVM-HPC classifier successfully acquires high-order relationships between samples.
• A more effective discriminative regularization term is presented by combining discrimination metric and hypergraph learning.
• Experimental results on twenty-five datasets demonstrate the validity and advantage of the SVM-HPC approach over classical SVM.

Conclusions:

• The SVM-HPC classifier effectively improves upon classical SVM by leveraging hypergraph-based pairwise constraints.
• The novel approach enhances the learning of structural information and prior distribution knowledge within datasets.
• The method shows significant advantages in pattern classification tasks, validated across multiple datasets.