.png){kind=icon}
.png){kind=icon}
Return
Deep Unsupervised Active Learning on Learnable Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2022.3190420.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, deep learning has been successfully applied to unsupervised active learning. However, the current method attempts to learn a nonlinear transformation via an auto-encoder while ignoring the sample relation, leaving huge room to design more effective representation learning mechanisms for unsupervised active learning. In this brief, we propose a novel deep unsupervised active learning model via learnable graphs, named ALLGs. ALLG benefits from learning optimal graph structures to acquire better sample representation and select representative samples. To make the learned graph structure more stable and effective, we take into account k-nearest neighbor graph as a priori and learn a relation propagation graph structure. We also incorporate shortcut connections among different layers, which can alleviate the well-known over-smoothing problem to some extent. To the best of our knowledge, this is the first attempt to leverage graph structure learning for unsupervised active learning. Extensive experiments performed on six datasets demonstrate the efficacy of our method.
Keywords:
Learning systems
Decoding
Task analysis
Deep learning
Data models
Training
Feature extraction
Active learning
graph structure
unsupervised learning
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W