Incorporating manifold regularization into adaptive label thresholding algorithm for online semi-supervised multi-label classification

Online multi-label classification aims to assign multiple appropriate categories to arriving instances. Currently, most approaches focus on supervised scenarios where instances are all labeled. The adaptive label thresholding approach, for example, can dynamically adjust the label threshold for labe...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Evolving systems Ročník 16; číslo 4; s. 124
Hlavní autoři: Fang, Nannan, Zhai, Tingting
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2025
Springer Nature B.V
Témata:
Adaptive algorithms
Algorithms
Artificial Intelligence
Classification
Complex Systems
Complexity
Datasets
Distance learning
Engineering
Feature selection
Labels
Manifolds
Optimization
Original Paper
Regularization
Regularization methods
Online multi-label classification
Adaptive label thresholding
Online semi-supervised learning
Manifold regularization
ISSN:1868-6478, 1868-6486
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Online multi-label classification aims to assign multiple appropriate categories to arriving instances. Currently, most approaches focus on supervised scenarios where instances are all labeled. The adaptive label thresholding approach, for example, can dynamically adjust the label threshold for labeled instances to distinguish relevant and irrelevant labels. However, in reality, labeling every instance is time-consuming and resource-intensive, and typically only a small fraction of instances are labeled. To address this challenge, we propose an innovative online semi-supervised multi-label classification algorithm. We design a novel online manifold regularization term that can leverage the similarity between labeled and unlabeled instances for prediction, and integrate it with the optimization objective of the adaptive label thresholding algorithm. The Online Gradient Descent method is employed to solve the improved optimization problem. We further extend the model to handle nonlinear classification problems using Mercer kernels, and derive detailed coefficient update formulas for support vectors. Experiments are conducted on eight open datasets spanning text, image, music, and biology domains. Performance is evaluated using seven common multi-label classification metrics. Paired t-tests on F1-measure results show that our proposed algorithm achieves statistically significant improvements over the second-best method on six datasets, confirming its effectiveness in semi-supervised multi-label classification tasks.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1868-6478
1868-6486
DOI:10.1007/s12530-025-09752-3