TY - GEN
T1 - Dynamic Hypergraph Regularized Broad Learning System for Image Classification
AU - Yang, Xiaoxiao
AU - Guo, Yu
AU - Wang, Yinuo
AU - Jiang, Peilin
AU - Wang, Fei
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - As a novel alternative to deep neural networks, the broad learning system (BLS) has exhibited outstanding performance in many machine learning tasks. The unique flat network structure enables BLS to extract the non-linear characteristics of the data. And the weights of the hidden layer are randomly generated, allowing BLS to provide rapid training for large-scale data. However, BLS focuses on approximating the target data and ignores the inherent geometric structure of the data. Graph structure can reflect the latent structure between samples of a dataset. Hypergraph learning has superior performance in modeling high-order relationships compared to simple graph-based learning methods that can only model pairwise relationships of data. In this paper, we propose a novel extension of the standard BLS. The proposed dynamic hypergraph regularized broad learning system (DHGBLS) incorporates hypergraph learning in the optimization process. And dynamic optimization is established to learn the hypergraph and the network’s output weights simultaneously. In this way, the effects of various hyperedges can be automatically modulated. Experimental results on three popular datasets show the superiority of the proposed method over the standard BLS and other state-of-art classification methods.
AB - As a novel alternative to deep neural networks, the broad learning system (BLS) has exhibited outstanding performance in many machine learning tasks. The unique flat network structure enables BLS to extract the non-linear characteristics of the data. And the weights of the hidden layer are randomly generated, allowing BLS to provide rapid training for large-scale data. However, BLS focuses on approximating the target data and ignores the inherent geometric structure of the data. Graph structure can reflect the latent structure between samples of a dataset. Hypergraph learning has superior performance in modeling high-order relationships compared to simple graph-based learning methods that can only model pairwise relationships of data. In this paper, we propose a novel extension of the standard BLS. The proposed dynamic hypergraph regularized broad learning system (DHGBLS) incorporates hypergraph learning in the optimization process. And dynamic optimization is established to learn the hypergraph and the network’s output weights simultaneously. In this way, the effects of various hyperedges can be automatically modulated. Experimental results on three popular datasets show the superiority of the proposed method over the standard BLS and other state-of-art classification methods.
KW - Broad learning system
KW - Hypergraph regularization
KW - Image classification
UR - https://www.scopus.com/pages/publications/85116867161
U2 - 10.1007/978-3-030-87355-4_41
DO - 10.1007/978-3-030-87355-4_41
M3 - 会议稿件
AN - SCOPUS:85116867161
SN - 9783030873547
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 491
EP - 501
BT - Image and Graphics - 11th International Conference, ICIG 2021, Proceedings
A2 - Peng, Yuxin
A2 - Hu, Shi-Min
A2 - Gabbouj, Moncef
A2 - Zhou, Kun
A2 - Elad, Michael
A2 - Xu, Kun
PB - Springer Science and Business Media Deutschland GmbH
T2 - 11th International Conference on Image and Graphics, ICIG 2021
Y2 - 6 August 2021 through 8 August 2021
ER -