atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Evolutionary Classifier Chain for Multi-Dimensional Classification

AAAI 2025 · Label-efficient and robust learning › Recognition and long-tail · approach: Group-robust classification · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes ECCO, an evolutionary (two-subpopulation genetic algorithm) method that jointly optimizes classifier-chain order and dimension-specific feature selection for multi-dimensional classification with SVM base classifiers.

Problem

Multi-dimensional classification (MDC) classifier chains rely on greedy or random chain orders that often fit incorrect class dependencies, and they feed all input features to each classifier, so irrelevant features mislead predictions.

Approach

Encode chain order and per-dimension binary feature masks into one individual and evolve them with a two-subpopulation co-evolutionary GA (Pareto dominance plus Tchebycheff decomposition), minimizing feature ratio and (1 - Hamming score) on training data, then selecting the best Pareto solution on test data.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ECCO's evolutionary chain-order optimization and dimension-specific feature selection instead of the comparison approachesMDC models · 14 real datasetsHamming Score: 78.6%Mixed
Use ECCO's evolutionary chain-order optimization and dimension-specific feature selection instead of the comparison approachesMDC models · 14 real datasetsExact Match: 50%Mixed
Use ECCO's evolutionary chain-order optimization and dimension-specific feature selection instead of the comparison approachesMDC models · 14 real datasetsSub-Exact Match: 64.3%Mixed
Optimize classifier-chain order and select dimension-specific feature combinations rather than use the compared chain-based methods' chain construction and all original featuresMDC models · 14 real datasetsHamming Score: 1.679 vs 4.500 (ECCO vs ECC); 1.679 vs 5.607 (ECCO vs BCC); 1.679 vs 4.179 (ECCO vs EDCC)Helped

Surprising findings

Limitations

Experimental setup

Datasets: Edm Flare1 Oes97 Jura Oes10 Enb Song WQplants WQanimals WaterQuality BeLaE Voice

Benchmarks: Edm Flare1 Oes97 Jura Oes10 Enb Song WQplants WQanimals WaterQuality BeLaE Voice

Metrics: Hamming Score Exact Match Sub-Exact Match Friedman rank Wilcoxon signed-rank test

Baselines: BR CP ECC BCC EDCC gMML SEEM

Builds on: classifier chain DDFS NSGA-II-style Pareto selection MOEA/D Tchebycheff decomposition

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy