Computer Science ›› 2021, Vol. 48 ›› Issue (6A): 664-667.doi: 10.11896/jsjkx.200500129

• Interdiscipline & Application • Previous Articles     Next Articles

Optimization of GHTSOM Model by Data Corrosion

SHI Jian1, MO Jun2   

  1. 1 Shenzhen Envicool Information and Technology Co.,Ltd.,Shenzhen,Guangdong 518000,China
    2 Shenzhen Envicool Software Technology Co.,Ltd.,Shenzhen,Guangdong 518000,China
  • Online:2021-06-10 Published:2021-06-17
  • About author:SHI Jian,born in 1988,master,intermediate engineer of thermal automation.His main research interests include artificial environment control algorithm design and data analysis.
    MO Jun,born in 1985,bachelor,intermediate engineer of automation.His main research interests include design and test of control scheme for artificial environment.

Abstract: Clustering algorithm is widely used in pattern recognition,information retrieval,image processing and natural language processing.Two common clustering methods based on neural network are GCS and SOM.Many scholars have proposed different improved algorithms based on them.GHTSOM(Growing Hierarchical Tree SOM) is one of them.GHTSOM works well for applications where there is a clear classification of data,but it is not suitable for applications where there is a lot of noise or disturbing data.The corrosion algorithm in image processing is used to optimize the GHTSOM algorithm,that is,before calling the GHTSOM process,the data is processed by the corrosion algorithm to remove the interference data or noise data at the junction of different classes of data,making a distinction between different categories of data more obvious.To make the presentation more intuitive,two-dimensional datas are used.The results show that the optimized Ghsom model can effectively avoid the unclassifiable problems caused by local connections between classes and the misclassified problems caused by too many neurons.

Key words: Clustering, Data corruption, Data processing, GHTSOM, Optimize

CLC Number: 

  • TP183
[1] HODGE V J,AUSTIN J.Hierarchical growing cell structures:TreeGCS [J].IEEE Transactions on Knowledge and Data Engineering,2001,2(13):207-218.
[2] BURZEVSKI V,MOHAN C K.Hierarchical growing cell structures[C]//Proceedings of International Conference on Neural Networks(ICNN'96).1966:1668-1663.
[3] WU S T,CHOW T W S.PRSOM:a new visualization method by hybridizing multidimensional scaling and self-organizing map [J].IEEE Transactions on Neural Networks,2005,6(16):1362-1380.
[4] 许洋.基于SOM神经网络在流形学习中的研究与应用 [J].南方农机2020,51(9):177-180.
[5] LI Y Q,LIN H X.Fault diagnosis method of train control RBC system based on KPCA-SOM network [J].Journal of Measurement Science and Instrumentation,2020,11(2):161-168.
[6] FORTI A,FORESTI G L.Growing Hierarchical Tree SOM:An Unsupervised neural network with dynamic topology [J].Neural Networks,2006(19):1568-1580.
[7] YING H,WANG L Q,ZHAO X A.Automatic roads extraction from high-resolution remote sensing images based on SOM[C]//Circuits and Systems Society.2010 Sixth International Conference on Natural Computation,2010:1194-1198.
[8] ZHANG Y B,ZHOU K.Study on automotive style recognition with the image erosion technology [C]//2011 International Conference on Consumer Electronics.Communications and Networks(CECNet),2011.
[9] ONKA M,HLAVAC V,BOYLE R.Image Processing,Analysis,and Machine Vision [M]//CL-Engineering.2007.
[10] KOHONEN T.Self-Organized Formation of Topologically Correct Feature Maps [J].Biological Cybernetics,1982,1(43):59-69.
[1] LU Chen-yang, DENG Su, MA Wu-bin, WU Ya-hui, ZHOU Hao-hao. Federated Learning Based on Stratified Sampling Optimization for Heterogeneous Clients [J]. Computer Science, 2022, 49(9): 183-193.
[2] CHAI Hui-min, ZHANG Yong, FANG Min. Aerial Target Grouping Method Based on Feature Similarity Clustering [J]. Computer Science, 2022, 49(9): 70-75.
[3] YU Shu-hao, ZHOU Hui, YE Chun-yang, WANG Tai-zheng. SDFA:Study on Ship Trajectory Clustering Method Based on Multi-feature Fusion [J]. Computer Science, 2022, 49(6A): 256-260.
[4] MAO Sen-lin, XIA Zhen, GENG Xin-yu, CHEN Jian-hui, JIANG Hong-xia. FCM Algorithm Based on Density Sensitive Distance and Fuzzy Partition [J]. Computer Science, 2022, 49(6A): 285-290.
[5] CHEN Jing-nian. Acceleration of SVM for Multi-class Classification [J]. Computer Science, 2022, 49(6A): 297-300.
[6] FAN Xing-ze, YU Mei. Coverage Optimization of WSN Based on Improved Grey Wolf Optimizer [J]. Computer Science, 2022, 49(6A): 628-631.
[7] KANG Yan, WANG Hai-ning, TAO Liu, YANG Hai-xiao, YANG Xue-kun, WANG Fei, LI Hao. Hybrid Improved Flower Pollination Algorithm and Gray Wolf Algorithm for Feature Selection [J]. Computer Science, 2022, 49(6A): 125-132.
[8] Ran WANG, Jiang-tian NIE, Yang ZHANG, Kun ZHU. Clustering-based Demand Response for Intelligent Energy Management in 6G-enabled Smart Grids [J]. Computer Science, 2022, 49(6): 44-54.
[9] CHEN Jia-zhou, ZHAO Yi-bo, XU Yang-hui, MA Ji, JIN Ling-feng, QIN Xu-jia. Small Object Detection in 3D Urban Scenes [J]. Computer Science, 2022, 49(6): 238-244.
[10] XING Yun-bing, LONG Guang-yu, HU Chun-yu, HU Li-sha. Human Activity Recognition Method Based on Class Increment SVM [J]. Computer Science, 2022, 49(5): 78-83.
[11] ZHU Zhe-qing, GENG Hai-jun, QIAN Yu-hua. Line-Segment Clustering Algorithm for Chemical Structure [J]. Computer Science, 2022, 49(5): 113-119.
[12] ZHANG Yu-jiao, HUANG Rui, ZHANG Fu-quan, SUI Dong, ZHANG Hu. Study on Affinity Propagation Clustering Algorithm Based on Bacterial Flora Optimization [J]. Computer Science, 2022, 49(5): 165-169.
[13] ZUO Yuan-lin, GONG Yue-jiao, CHEN Wei-neng. Budget-aware Influence Maximization in Social Networks [J]. Computer Science, 2022, 49(4): 100-109.
[14] YANG Xu-hua, WANG Lei, YE Lei, ZHANG Duan, ZHOU Yan-bo, LONG Hai-xia. Complex Network Community Detection Algorithm Based on Node Similarity and Network Embedding [J]. Computer Science, 2022, 49(3): 121-128.
[15] HAN Jie, CHEN Jun-fen, LI Yan, ZHAN Ze-cong. Self-supervised Deep Clustering Algorithm Based on Self-attention [J]. Computer Science, 2022, 49(3): 134-143.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!