LVQ神经网络在交通事件检测中的应用

提出一种基于LVQ神经网络的交通事件检测方法。提取上下游的流量和占有率为特征,LVQ神经网络作为分类器进行交通事件自动检测。LVQ网络结构简单,但却表现出比BP神经网络更强的有效性和鲁棒性。为进一步提高神经网络的泛化能力,采用改进的Boosting算法,进行网络集成。运用Matlab 进行了仿真分析,结果表明提出的交通事件检测算法具有良好的检测性能。     

An optimized RBF neural network algorithm based on partial least squares and genetic algorithm for classification of small sample

Radial basis function (RBF) neural network can use linear learning algorithm to complete the work formerly handled by nonlinear learning algorithm, and maintain the high precision of the nonlinear algorithm. However, the results of RBF would be slightly unsatisfactory when dealing with small sample which has higher feature dimension and fewer numbers. Higher feature dimension will influence the design of neural network, and fewer numbers of samples will cause network training incomplete or over-fitted, both of which restrict the recognition precision of the neural network. RBF neural network has some drawbacks, for example, it is hard to determine the numbers, center and width of the hidden layer’s neurons, which constrain the success of training. To solve the above problems, partial least squares (PLS) and genetic algorithm(GA)are introduced into RBF neural network, and better recognition precision will be obtained, because PLS is good at dealing with the small sample data, it can reduce feature dimension and make low-dimensional data more interpretative. In addition, GA can optimize the network architecture, the weights between hidden layer and output layer of the RBF neural network can ease non-complete network training, the way of hybrid coding and simultaneous evolving is adopted, and then an accurate algorithm is established. By these two consecutive optimizations, the RBF neural network classification algorithm based on PLS and GA (PLS-GA-RBF) is proposed, in order to solve some recognition problems caused by small sample. Four experiments and comparisons with other four algorithms are carried out to verify the superiority of the proposed algorithm, and the results indicate a good picture of the PLS-GA-RBF algorithm, the operating efficiency and recognition accuracy are improved substantially. The new small sample classification algorithm is worthy of further promotion.     

Model selection for partial least squares based dimension reduction

Partial least squares (PLS) has been widely applied to process scientific data sets as an effective dimension reduction technique. The main way to determine the number of dimensions extracted by PLS is by using the cross validation method, but its computation load is heavy. Researchers presented fixing the number at three, but intuitively it’s not suitable for all data sets. Based on the intrinsic connection between PLS and the structure of data sets, two novel algorithms are proposed to determine the number of extracted principal components, keeping the valuable information while excluding the trivial. With the merits of variety with different data sets and easy implementation, both algorithms exhibit better performance than the previous works on nine real world data sets.     

Face recognition using partial least squares components

The paper considers partial least squares (PLS) as a new dimension reduction technique for the feature vector to overcome the small sample size problem in face recognition. Principal component analysis (PCA), a conventional dimension reduction method, selects the components with maximum variability, irrespective of the class information. So PCA does not necessarily extract features that are important for the discrimination of classes. PLS, on the other hand, constructs the components so that the correlation between the class variable and themselves is maximized. Therefore PLS components are more predictive than PCA components in classification. The experimental results on Manchester and ORL databases show that PLS is to be preferred over PCA when classification is the goal and dimension reduction is needed.     

Cross-pose face recognition based on partial least squares

The pose problem is one of the bottlenecks for face recognition. In this paper we propose a novel cross-pose face recognition method based on partial least squares (PLS). By training on the coupled face images of the same identities and across two different poses, PLS maximizes the squares of the intra-individual correlations. Therefore, it leads to improvements in recognizing faces across pose differences. The experimental results demonstrate the effectiveness of the proposed method.     

An asymmetric classifier based on partial least squares

This paper investigates the effect of partial least squares (PLS) in unbalanced pattern classification. Beyond dimension reduction, PLS is proved to be superior to generate favorable features for classification. The PLS classifier (PLSC) is illustrated to give extremely better prediction accuracy to the class with the smaller data number. In this paper, an asymmetric PLS classifier (APLSC) is proposed to boost the poor performance of PLSC to the class with the larger data number. PLSC and APLSC are compared with five state-of-arts algorithms, support vector machines (SVMs), unbalanced SVMs, asymmetric principal component and discriminant analysis (APCDA), SMOTE and Adaboost. Experimental results on six UCI data sets show that APLSC improves PLSC in promoting overall classification accuracy, at the same time, APLSC and PLSC perform better than other five algorithms even under seriously unbalanced distribution.     

Developing a design support system for the exterior form of running shoes using partial least squares and neural networks

The function of sport shoes is to improve sport performance and reduce sports-related injuries. They are commercial products developed by combining sports technology and marketing activities. Numerous studies on research and development, material application, production process improvements, and human physiological measurements for the sport shoe market exist. However, few studies have conducted an in-depth investigation on the design of forms and external appearance for sports shoes.     

基于Adaboost集成RBF神经网络的高速公路事件检测

提出一种基于Adaboost集成RBF神经网络的高速公路事件检测方法。首先对高速公路事件检测原理进行分析,进行了相关的参数选择,确定了RBF神经网络的结构,然后采用改进的Adaboost方法集成RBF神经网络进行高速公路事件检测并给出了事件检测算法的步骤,最后进行了仿真实验,实验结果表明,该方法可以明显提高RBF神经网络性能（高检测率、低误报率）,且具有较强的泛化能力,适宜高速公路事件检测。     

Real-time traffic incident detection using a probabilistic topic model

Traffic congestion occurs frequently in urban settings, and is not always caused by traffic incidents. In this paper, we propose a simple method for detecting traffic incidents from probe-car data by identifying unusual events that distinguish incidents from spontaneous congestion. First, we introduce a traffic state model based on a probabilistic topic model to describe the traffic states for a variety of roads. Formulas for estimating the model parameters are derived, so that the model of usual traffic can be learned using an expectation–maximization algorithm. Next, we propose several divergence functions to evaluate differences between the current and usual traffic states and streaming algorithms that detect high-divergence segments in real time. We conducted an experiment with data collected for the entire Shuto Expressway system in Tokyo during 2010 and 2011. The results showed that our method discriminates successfully between anomalous car trajectories and the more usual, slowly moving traffic patterns.     

基于概率神经网络的高速公路事件检测

针对高速公路事件检测这一非线性分类问题,提出一种基于概率神经网络的事件检测方法。阐述了概率神经网络的结构与训练算法,分析了事件对交通流的影响规律,并合理地选取了概率神经网络的输入量,用高速公路管理部门提供的样本数据进行了仿真研究。仿真实验表明,基于概率神经网络的事件检测方法具有学习速度快、泛化能力好、检测准确率高等优点,具有良好的应用前景。     

Geometric properties of partial least squares for process monitoring

Projection to latent structures or partial least squares (PLS) produces output-supervised decomposition on input X, while principal component analysis (PCA) produces unsupervised decomposition of input X. In this paper, the effect of output Y on the X-space decomposition in PLS is analyzed and geometric properties of the PLS structure are revealed. Several PLS algorithms are compared in a geometric way for the purpose of process monitoring. A numerical example and a case study are given to illustrate the analysis results.     

Incremental partial least squares analysis of big streaming data

Incremental feature extraction is effective for facilitating the analysis of large-scale streaming data. However, most current incremental feature extraction methods are not suitable for processing streaming data with high feature dimensions because only a few methods have low time complexity, which is linear with both the number of samples and features. In addition, feature extraction methods need to improve the performance of further classification. Therefore, incremental feature extraction methods need to be more efficient and effective. Partial least squares (PLS) is known to be an effective dimension reduction technique for classification. However, the application of PLS to streaming data is still an open problem. In this study, we propose a highly efficient and powerful dimension reduction algorithm called incremental PLS (IPLS), which comprises a two-stage extraction process. In the first stage, the PLS target function is adapted so it is incremental by updating the historical mean to extract the leading projection direction. In the second stage, the other projection directions are calculated based on the equivalence between the PLS vectors and the Krylov sequence. We compared the performance of IPLS with other state-of-the-art incremental feature extraction methods such as incremental principal components analysis, incremental maximum margin criterion, and incremental inter-class scatter using real streaming datasets. Our empirical results showed that IPLS performed better than other methods in terms of its efficiency and further classification accuracy.     

局部近邻标准化偏最小二乘的多模态间歇过程故障检测

本文针对多模态间歇过程数据多中心和模态方差差异明显的问题,提出了一种基于局部近邻标准化偏最小二乘方法.首先,采用统计模量方法处理间歇过程数据,再利用局部近邻标准化方法将统计模量后的训练数据进行高斯化处理,建立偏最小二乘监控模型,确定控制限;然后,同样对统计模量后的测试数据进行局部近邻标准化处理,再计算测试数据的高斯偏最小二乘监控指标,进行过程监视及故障检测.最后,通过数值实例和青霉素发酵过程验证方法有效性.实验结果表明所提方法解决了故障样本近邻集跨模态问题,对多模态数据具有更好的故障检测能力.     

Mining churning behaviors and developing retention strategies based on a partial least squares (PLS) model

In a very competitive mobile telecommunication business environment, marketing managers need a business intelligence model that allows them to maintain an optimal (at least a near optimal) level of churners very effectively and efficiently while minimizing the costs throughout their marketing programs. As a first step toward optimal churn management program for marketing managers, this paper focuses on building an accurate and concise predictive model for the purpose of churn prediction utilizing a partial least squares (PLS)-based methodology on highly correlated data sets among variables. A preliminary experiment demonstrates that the presented model provides more accurate performance than traditional prediction models and identifies key variables to better understand churning behaviors. Further, a set of simple churn marketing programs—device management, overage management, and complaint management strategies—is presented and discussed.     

基于偏最小二乘得分重构的质量相关故障检测

偏最小二乘(PLS)作为一种典型的多元统计分析方法被广泛用于多变量统计过程监测,通常要求数据满足高斯–马尔科夫定理.当数据存在多模态或过程变量非线性相关时,基于PLS方法的故障检测性能将受到影响.为此,本文提出一种基于PLS得分重构的故障检测方法(SR–PLS).首先,利用PLS将输入空间分解为质量相关空间与质量无关空间;其次,利用类k邻近规则(k NN)对当前得分向量进行重构,得到重构得分向量;最后利用重构得分构造统计量,由核密度估计(KDE)得到控制限,进行故障检测.本方法降低了变量间的非线性与数据多模态对过程故障检测的影响,提高了故障检测率.将所提方法应用于两个数值仿真例子与田纳西伊士曼过程(TEP),并与PLS,KPLS, LNS–PLS进行对比分析,证明该算法的优越性与有效性.     

一种用于数据校正的最小二乘与准最小二乘组合方法

过程系统的控制与优化要求可靠的过程数据。通过测量得到的过程数据含有随机误差和过失误差,采用数据校正技术可有效地减小过程测量数据的误差,从而提高过程控制与优化的准确性。针对传统基于最小二乘的数据校正方法:和基于准最小二乘的鲁棒数据校正方法:,分析了它们的优缺点,并提出了一种最小二乘与准最小二乘组合方法:。该方法:先采用准最小二乘估计器检测过失误差并剔除,然后再采用最小二乘估计器进行数据校正,可以综合前两种方法:各自的优点,使得数据校正结果:更加准确。将提出最小二乘与准最小二乘组合方法:应用于线性与非线性系统的数据校正中,通过校正结果:的比较说明此方法:的具有较好的过失误差检测能力和较准确的数据校正结果:。最后将此方法:应用于实际过程系统空气分离流程的数据校正中,结果:说明了此方法:的有效性。     

A revisit to block and recursive least squares for parameter estimation

In this paper, the classical least squares (LS) and recursive least squares (RLS) for parameter estimation have been re-examined in the light of the present day computing capabilities. It has been demonstrated that for linear time-invariant systems, the performance of blockwise least squares (BLS) is always superior to that of RLS. In the context of parameter estimation for dynamic systems, the current computational capability of personal computers are more than adequate for BLS. However, for time-varying systems with abrupt parameter changes, standard blockwise LS may no longer be suitable due to its inefficiency in discarding “old” data. To deal with this limitation, a novel sliding window blockwise least squares approach with automatically adjustable window length triggered by a change detection scheme is proposed. Two types of sliding windows, rectangular and exponential, have been investigated. The performance of the proposed algorithm has been illustrated by comparing with the standard RLS and an exponentially weighted RLS (EWRLS) using two examples. The simulation results have conclusively shown that: (1) BLS has better performance than RLS; (2) the proposed variable-length sliding window blockwise least squares (VLSWBLS) algorithm can outperform RLS with forgetting factors; (3) the scheme has both good tracking ability for abrupt parameter changes and can ensure the high accuracy of parameter estimate at the steady-state; and (4) the computational burden of VLSWBLS is completely manageable with the current computer technology. Even though the idea presented here is straightforward, it has significant implications to virtually all areas of application where RLS schemes are used.     

融合小波变换与贝叶斯LS SVM的网络流量预测*

为了提高网络流量预测的精度,研究了一种融合小波变换与贝叶斯LSSVM的网络流量预测方法。首先将原始流量数据时间序列进行小波分解,并将分解得到的近似部分和各细节部分分别单支重构到原级别上;对各个重构后的序列分别用最小二乘支持向量机进行预测,将贝叶斯证据框架应用于最小二乘支持向量机模型参数的选择;将各个预测结果重构后得到对原始序列的预测结果。对比实验表明,该模型不仅具有较快的运行速度,而且具有较高的预测精度。     

Developing a soft sensor based on sparse partial least squares with variable selection

Soft sensors are used to predict response variables, which are difficult to measure, using the data of predictors that can be obtained relatively easier. Arranging time-lagged data of predictors and applying partial least squares (PLS) to the dataset is a popular approach for extracting the correlation between data of the responses and predictors of the process dynamic. However, the model input dimension dramatically soars once multiple time delays are incorporated. In addition, the selection of variables in the dynamic PLS (DPLS) model is a critical step for the robustness and the accuracy of the inferential model, since irrelevant inputs deteriorate the prediction performance of the soft sensor. The sparse PLS (SPLS) is a variable selection method that simultaneously selects the important predictors and finds the correlation between the predictors and responses. The sparsity of the model is dependent on a cut-off value in the SPLS algorithm that is determined using a cross-validation procedure. Therefore, the threshold is a compromise for all latent variable directions. It is necessary to further shrink the inputs from the result of SPLS to obtain a more compact model. In the presented work, named SPLS-VIP, the variable importance in projection (VIP) method was used to filter out the insignificant inputs from the SPLS result. An industrial soft sensor for predicting oxygen concentrations in the air separation process was developed based on the proposed approach. The prediction performance and the model interpretability could be further improved from the SPLS method using the proposed approach.     

带有稳定学习的递归神经网络动态偏最小二乘建模

针对目前非线性动态偏最小二乘(PLS)建模方法在拟合较强非线性化工过程时存在的问题, 提出一种基于稳定学习的递归神经网络动态PLS建模方法. 该算法将递归神经网络与Hammerstein模型相结合, 对外部PLS提取的特征向量进行内部建模, 具有逼近较强非线性化工过程的能力, 改善了模型的适用范围. 此外, 采用带有稳定学习的参数更新算法对模型参数进行在线修正, 改善了模型的预测精度和自适应能力. 将此方法应用于氧化铝生产过程铝酸钠溶液组分浓度建模实验, 仿真结果表明, 本方法是可行有效的.