论文标题
部分可观测时空混沌系统的无模型预测
A new Stack Autoencoder: Neighbouring Sample Envelope Embedded Stack Autoencoder Ensemble Model
论文作者
论文摘要
Stack AutoCoder(SAE)作为代表性的Deep网络,在功能学习方面具有独特而出色的性能,并且受到了研究人员的广泛关注。但是,现有的深层SAE专注于原始样品,而无需考虑样品之间的层次结构信息。为了解决这一限制,本文提出了一种新的SAE模型的信封嵌入式堆栈自动编码器集合(NE_SAE)。首先,提出了相邻的样品包络学习机制(NSELM),以预处理SAE的输入。 NSELM通过组合相邻样品来构建样品对。此外,NSELM通过多层迭代均值聚类构建了多层样本空间,该均值聚类考虑了相似的样品并生成具有分层结构信息的信封样品的层。其次,提出了嵌入式堆栈自动编码器(ESAE)并在样品空间的每一层中训练并训练,以在训练和网络结构中考虑原始样品,从而更好地找到原始特征样本与深度特征样本之间的关系。第三,分别在包络样品的层上进行了特征降低和基本分类器,并分类每一层样品的输出分类结果。最后,通过整体机制融合了包膜样品空间层的分类结果。在实验部分中,提出的算法已通过十个代表性的公共数据集进行了验证。结果表明,我们的方法比现有的传统特征学习方法和代表性的深层自动编码器具有更好的性能。
Stack autoencoder (SAE), as a representative deep network, has unique and excellent performance in feature learning, and has received extensive attention from researchers. However, existing deep SAEs focus on original samples without considering the hierarchical structural information between samples. To address this limitation, this paper proposes a new SAE model-neighbouring envelope embedded stack autoencoder ensemble (NE_ESAE). Firstly, the neighbouring sample envelope learning mechanism (NSELM) is proposed for preprocessing of input of SAE. NSELM constructs sample pairs by combining neighbouring samples. Besides, the NSELM constructs a multilayer sample spaces by multilayer iterative mean clustering, which considers the similar samples and generates layers of envelope samples with hierarchical structural information. Second, an embedded stack autoencoder (ESAE) is proposed and trained in each layer of sample space to consider the original samples during training and in the network structure, thereby better finding the relationship between original feature samples and deep feature samples. Third, feature reduction and base classifiers are conducted on the layers of envelope samples respectively, and output classification results of every layer of samples. Finally, the classification results of the layers of envelope sample space are fused through the ensemble mechanism. In the experimental section, the proposed algorithm is validated with over ten representative public datasets. The results show that our method significantly has better performance than existing traditional feature learning methods and the representative deep autoencoders.