Takagi–Sugeno–Kang Fuzzy Systems for High-Dimensional Multilabel Classification
Bibliographic record
Abstract
Multi-Label Classification (MLC) refers to associating each instance with multiple labels simultaneously. MLC has gained much importance due to its ability to better reflect the complexity of the real world classification problems. Fuzzy System (FS) has excellent nonlinear modeling capability and strong interpretability, which makes it a promising model for complex MLC problems. However, it is widely known that FS suffers from the “curse of dimensionality”. Here, an adaptive membership function (MF) along with its generalized version are proposed to address high-dimensional problems. These MFs can effectively overcome “numeric underflow” in FS while preserving interpretability as much as possible.On this basis, a novel fuzzy rule based multi-label classification framework called Multi-Label High-Dimensional Takagi-Sugeno-Kang Fuzzy System (ML-HDTSK FS) is proposed. This model can handle data with over ten thousand dimensionality. Additionally, MLHDTSK FS uses a decomposed label correlation learning strategy to efficiently capture both high and low levels of relationship between labels, and adopts a group L21penalty to realize the learning of label-specific features. Combining these two new multi-label learning strategies and the novel adaptive membership function, ML-HDTSK FS becomes a more powerful tool for various MLC problems. The effectiveness of ML-HDTSK FS is demonstrated on seventeen benchmark multi-label data sets, and its performance is compared with eleven MLC algorithms. The experimental results confirm the validity of the proposed MLHDTSK FS, and demonstrate the superiority of it in dealing with MLC problems, especially for high dimensional ones.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".