Laplacian regularized kernel minimum squared error and its application to face recognition

Kernel minimum squared error (KMSE) has been receiving much attention in data mining and pattern recognition in recent years. Generally speaking, training a KMSE classifier, which is a kind of supervised learning, needs sufficient labeled examples. However, labeled examples are usually insufficient and unlabeled examples are abundant in real-world applications. In this paper, we introduce a semi-supervised KMSE algorithm, called Laplacian regularized KMSE (LapKMSE), which explicitly exploits the manifold structure. We construct a p nearest neighbor graph to model the manifold structure of labeled and unlabeled examples. Then, LapKMSE incorporates the structure information of labeled and unlabeled examples in the objective function of KMSE by adding a Laplacian regularization term. As a result, the labels of labeled and unlabeled examples vary smoothly along the geodesics on the manifold. Experimental results on several synthetic and real-world datasets illustrate the effectiveness of our algorithm. Finally our algorithm is applied to face recognition and achieves the comparable results compared to the other supervised and semi-supervised methods.     

具有选择与遗忘机制的极端学习机在时间序列预测中的应用

针对训练样本贯序输入时的极端学习机 (ELM)训练问题,提出一种具有选择与遗忘机制的极端学习机 (SF-ELM),并研究了其在混沌时间序列预测中的应用. SF-ELM以逐次增加新训练样本的方式实现在线训练,通过引入遗忘因子以减弱旧训练样本的影响,同时以泛化能力为判断依据,对其输出权值进行选择性递推更新. 混沌时间序列在线预测实例表明,SF-ELM是一种有效的ELM在线训练模式. 相比于在线贯序极端学习机,SF-ELM具有更快的在线训练速度和更高的在线预测精度,因此更适于混沌时间序列在线预测. 关键词： 混沌时间序列 时间序列预测 神经网络 极端学习机     

Development of an electronic stopping power model based on deep learning and its application in ion range prediction

Deep learning algorithm emerges as a new method to take the raw features from large dataset and mine their deep implicit relations, which is promising for solving traditional physical challenges. A particularly intricate and difficult challenge is the energy loss mechanism of energetic ions in solid, where accurate prediction of stopping power is a long-time problem. In this work, we develop a deep-learning-based stopping power model with high overall accuracy, and overcome the long-standing deficiency of the existing classical models by improving the predictive accuracy of stopping power for ultra-heavy ion with low energy, and the corresponding projected range. This electronic stopping power model, based on deep learning algorithm, could be hopefully applied for the study of ion-solid interaction mechanism and enormous relevant applications.     

基于Cholesky分解的增量式RELM及其在时间序列预测中的应用

针对应用于混沌时间序列预测的正则极端学习机(RELM)网络结构设计问题,提出一种基于Cholesky分解的增量式RELM训练算法.该算法通过逐次增加隐层神经元的方式自动确定最佳的RELM网络结构,并以Cholesky分解方式计算其输出权值,有效减小了隐层神经元递增过程的计算代价.混沌时间序列预测实例表明,该算法可有效实现最佳RELM网络结构的自动确定,且计算效率高.利用该算法训练后的RELM预测模型具有预测精度高的优点,适用于混沌时间序列预测. 关键词： 神经网络 极端学习机 混沌时间序列 时间序列预测