A Graph-Based Semi-Supervised Approach for Few-Shot Class-Incremental Modulation Classification

被引:0
作者
Zhou, Xiaoyu [1 ]
Qi, Peihan [1 ]
Liu, Qi [2 ]
Ding, Yuanlei [1 ]
Zheng, Shilian [3 ]
Li, Zan [1 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
[2] Chinese Acad Sci, Xinjiang Astron Observ, Urumqi 830011, Peoples R China
[3] 011 Res Ctr, Sci & Technol Commun Informat Secur Control Lab, Jiaxing 314033, Peoples R China
基金
中国国家自然科学基金;
关键词
deep learning; few-shot; label propaga- tion; modulation classification; semi-supervised learn- ing;
D O I
10.23919/JCC.ea.2022-0339.202401
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
With the successive application of deep learning (DL) in classification tasks, the DL -based modulation classification method has become the preference for its state-of-the-art performance. Nevertheless, once the DL recognition model is pre -trained with fixed classes, the pre -trained model tends to predict incorrect results when identifying incremental classes. Moreover, the incremental classes are usually emergent without label information or only a few labeled samples of incremental classes can be obtained. In this context, we propose a graphbased semi -supervised approach to address the fewshot classes -incremental (FSCI) modulation classification problem. Our proposed method is a twostage learning method, specifically, a warm-up model is trained for classifying old classes and incremental classes, where the unlabeled samples of incremental classes are uniformly labeled with the same label to alleviate the damage of the class imbalance problem. Then the warm-up model is regarded as a feature extractor for constructing a similar graph to connect labeled samples and unlabeled samples, and the label propagation algorithm is adopted to propagate the label information from labeled nodes to unlabeled nodes in the graph to achieve the purpose of incremental classes recognition. Simulation results prove that the proposed method is superior to other finetuning methods and retrain methods.
引用
收藏
页码:88 / 103
页数:16
相关论文
共 52 条
  • [1] A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning
    Anis, Aamir
    El Gamal, Aly
    Avestimehr, A. Salman
    Ortega, Antonio
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (04) : 2322 - 2342
  • [2] Performance Analysis of NOMA-Based Underlay Cognitive Radio Networks With Partial Relay Selection
    Aswathi, V
    Babu, A., V
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (05) : 4615 - 4630
  • [3] Bao WGDL, 2021, CHINA COMMUN, V18, P39, DOI 10.23919/JCC.2021.06.004
  • [4] Baoli L., 2004, ADAPTIVE K NEAREST N, V3
  • [5] An Amateur Drone Surveillance System Based on the Cognitive Internet of Things
    Ding, Guoru
    Wu, Qihui
    Zhang, Linyuan
    Lin, Yun
    Tsiftsis, Theodoros A.
    Yao, Yu-Dong
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (01) : 29 - 35
  • [6] SSRCNN: A Semi-Supervised Learning Framework for Signal Recognition
    Dong, Yihong
    Jiang, Xiaohan
    Cheng, Lei
    Shi, Qingjiang
    [J]. IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2021, 7 (03) : 780 - 789
  • [7] Learning Flexible Graph-Based Semi-Supervised Embedding
    Dornaika, Fadi
    El Traboulsi, Youssof
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (01) : 206 - 218
  • [8] Federated Learning for Vehicular Internet of Things: Recent Advances and Open Issues
    Du, Zhaoyang
    Wu, Celimuge
    Yoshinaga, Tsutomu
    Yau, Kok-Lim Alvin
    Ji, Yusheng
    Li, Jie
    [J]. IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY, 2020, 1 (01): : 45 - 61
  • [9] Semi-Supervised Learning Through Label Propagation on Geodesics
    Fan, Mingyu
    Zhang, Xiaoqin
    Du, Liang
    Chen, Liang
    Tao, Dacheng
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (05) : 1486 - 1499
  • [10] A Proposal for Local k Values for k-Nearest Neighbor Rule
    Garcia-Pedrajas, Nicolas
    Romero del Castillo, Juan A.
    Cerruela-Garcia, Gonzalo
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2017, 28 (02) : 470 - 475