BiLSTM Optimization via Multi-strategy Slime Mould Algorithm for Named Entity Recognition
To further improve existing named entity recognition models which are defected in weak generalization a-bility and poor robustness,this paper proposed to optimize the hyperparameters of the bi-directional long and short-term memory network(BiLSTM)using the multi-strategy slime mould algorithm(SLSMA).The improved slime mould algorithm adopts the Sobol sequence uniform population density in the initialization stage,and introduces the Levy flight strategy to dynamically adjust the step size in the late iteration stage to enable the algorithm jump out of the local optimum.The improved slime mould algorithm is also applied to optimize the key hyper parameters for named entity recognition.Experiments of named entity recognition using LSTM-CRF model,BiLSTM-CRF model,SMA-BiLSTM-CRF model and SLSMA-BiLSTM-CRF model show that the values of SLSMA-BiLSTM-CRF reach 98.48%and 97.35%on the People's Daily and CoNLL2003 datasets,respectively.
named entity recognitionSLSMABidirectional long short-term memory networkSobol sequence