SELF-DEPENDENT LOCALITY PRESERVING PROJECTION WITH TRANSFORMED SPACE-ORIENTED NEIGHBORHOOD GRAPH

Locality preserving projection （LPP） is a typical and popular dimensionality reduction （DR） method,and it can potentially find discriminative projection directions by preserving the local geometric structure in data. However,LPP is based on the neighborhood graph artificially constructed from the original data,and the performance of LPP relies on how well the nearest neighbor criterion work in the original space. To address this issue,a novel DR algorithm,called the self-dependent LPP （sdLPP） is proposed. And it is based on the fact that the nearest neighbor criterion usually achieves better performance in LPP transformed space than that in the original space. Firstly,LPP is performed based on the typical neighborhood graph; then,a new neighborhood graph is constructed in LPP transformed space and repeats LPP. Furthermore,a new criterion,called the improved Laplacian score,is developed as an empirical reference for the discriminative power and the iterative termination. Finally,the feasibility and the effectiveness of the method are verified by several publicly available UCI and face data sets with promising results.

Ship recognition based on HRRP via multi-scale sparse preserving method

In order to extract the richer feature information of ship targets from sea clutter, and address the high dimensional data problem, a method termed as multi-scale fusion kernel sparse preserving projection(MSFKSPP) based on the maximum margin criterion(MMC) is proposed for recognizing the class of ship targets utilizing the high-resolution range profile(HRRP). Multi-scale fusion is introduced to capture the local and detailed information in small-scale features, and the global and contour information in large-scale features, offering help to extract the edge information from sea clutter and further improving the target recognition accuracy. The proposed method can maximally preserve the multi-scale fusion sparse of data and maximize the class separability in the reduced dimensionality by reproducing kernel Hilbert space. Experimental results on the measured radar data show that the proposed method can effectively extract the features of ship target from sea clutter, further reduce the feature dimensionality, and improve target recognition performance.

DUAL-SPARSITY PRESERVING PROJECTION

Sparsity preserving projection（SPP） is a popular graph-based dimensionality reduction（DR） method, which has been successfully applied to solve face recognition recently. SPP contains natural discriminating information by preserving sparse reconstruction relationship of data sets. However, SPP suffers from the fact that every new feature learned from data sets is linear combinations of all the original features, which often makes it difficult to interpret the results. To address this issue, a novel DR method called dual-sparsity preserving projection （DSPP） is proposed to further impose sparsity constraints on the projection directions of SPP. Specifically, the proposed method casts the projection function learning of SPP into a regression-type optimization problem, and then the sparse projections can be efficiently computed by the related lasso algorithm. Experimental results from face databases demonstrate the effectiveness of the proposed algorithm.

Sparse Kernel Locality Preserving Projection and Its Application in Nonlinear Process Fault Detection

Locality preserving projection (LPP) is a newly emerging fault detection method which can discover local manifold structure of a data set to be analyzed, but its linear assumption may lead to monitoring performance degradation for complicated nonlinear industrial processes. In this paper, an improved LPP method, referred to as sparse kernel locality preserving projection (SKLPP) is proposed for nonlinear process fault detection. Based on the LPP model, kernel trick is applied to construct nonlinear kernel model. Furthermore, for reducing the computational complexity of kernel model, feature samples selection technique is adopted to make the kernel LPP model sparse. Lastly, two monitoring statistics of SKLPP model are built to detect process faults. Simulations on a continuous stirred tank reactor (CSTR) system show that SKLPP is more effective than LPP in terms of fault detection performance.

Fault Diagnosis Model Based on Feature Compression with Orthogonal Locality Preserving Projection

Based on feature compression with orthogonal locality preserving projection（OLPP）,a novel fault diagnosis model is proposed in this paper to achieve automation and high-precision of fault diagnosis of rotating machinery.With this model,the original vibration signals of training and test samples are first decomposed through the empirical mode decomposition（EMD）,and Shannon entropy is constructed to achieve high-dimensional eigenvectors.In order to replace the traditional feature extraction way which does the selection manually,OLPP is introduced to automatically compress the high-dimensional eigenvectors of training and test samples into the low-dimensional eigenvectors which have better discrimination.After that,the low-dimensional eigenvectors of training samples are input into Morlet wavelet support vector machine（MWSVM） and a trained MWSVM is obtained.Finally,the low-dimensional eigenvectors of test samples are input into the trained MWSVM to carry out fault diagnosis.To evaluate our proposed model,the experiment of fault diagnosis of deep groove ball bearings is made,and the experiment results indicate that the recognition accuracy rate of the proposed diagnosis model for outer race crack、inner race crack and ball crack is more than 90%.Compared to the existing approaches,the proposed diagnosis model combines the strengths of EMD in fault feature extraction,OLPP in feature compression and MWSVM in pattern recognition,and realizes the automation and high-precision of fault diagnosis.

Multimode Process Monitoring Based on Fuzzy C-means in Locality Preserving Projection Subspace

For complex industrial processes with multiple operational conditions, it is important to develop effective monitoring algorithms to ensure the safety of production processes. This paper proposes a novel monitoring strategy based on fuzzy C-means. The high dimensional historical data are transferred to a low dimensional subspace spanned by locality preserving projection. Then the scores in the novel subspace are classified into several overlapped clusters, each representing an operational mode. The distance statistics of each cluster are integrated though the membership values into a novel BID (Bayesian inference distance) monitoring index. The efficiency and effectiveness of the proposed method are validated though the Tennessee Eastman benchmark process.

Supervised local and non-local structure preserving projections with application to just-in-time learning for adaptive soft sensor

In soft sensor field, just-in-time learning(JITL) is an effective approach to model nonlinear and time varying processes. However, most similarity criterions in JITL are computed in the input space only while ignoring important output information, which may lead to inaccurate construction of relevant sample set. To solve this problem, we propose a novel supervised feature extraction method suitable for the regression problem called supervised local and non-local structure preserving projections(SLNSPP), in which both input and output information can be easily and effectively incorporated through a newly defined similarity index. The SLNSPP can not only retain the virtue of locality preserving projections but also prevent faraway points from nearing after projection,which endues SLNSPP with powerful discriminating ability. Such two good properties of SLNSPP are desirable for JITL as they are expected to enhance the accuracy of similar sample selection. Consequently, we present a SLNSPP-JITL framework for developing adaptive soft sensor, including a sparse learning strategy to limit the scale and update the frequency of database. Finally, two case studies are conducted with benchmark datasets to evaluate the performance of the proposed schemes. The results demonstrate the effectiveness of LNSPP and SLNSPP.

Locality Preserving Discriminant Projection for Speaker Verification

In this paper, a manifold subspace learning algorithm based on locality preserving discriminant projection (LPDP) is used for speaker verification. LPDP can overcome the deficiency of the total variability factor analysis and locality preserving projection (LPP). LPDP can effectively use the speaker label information of speech data. Through optimization, LPDP can maintain the inherent manifold local structure of the speech data samples of the same speaker by reducing the distance between them. At the same time, LPDP can enhance the discriminability of the embedding space by expanding the distance between the speech data samples of different speakers. The proposed method is compared with LPP and total variability factor analysis on the NIST SRE 2010 telephone-telephone core condition. The experimental results indicate that the proposed LPDP can overcome the deficiency of LPP and total variability factor analysis and can further improve the system performance.

Face recognition using illuminant locality preserving projections

A novel supervised manifold learning method was proposed to realize high accuracy face recognition under varying illuminant conditions. The proposed method, named illuminant locality preserving projections （ILPP）, exploited illuminant directions to alleviate the effect of illumination variations on face recognition. The face images were first projected into low dimensional subspace, Then the ILPP translated the face images along specific direction to reduce lighting variations in the face. The ILPP reduced the distance between face images of the same class, while increase the dis tance between face images of different classes. This proposed method was derived from the locality preserving projections （LPP） methods, and was designed to handle face images with various illumi nations. It preserved the face image＇ s local structure in low dimensional subspace. The ILPP meth od was compared with LPP and discriminant locality preserving projections （DLPP）, based on the YaleB face database. Experimental results showed the effectiveness of the proposed algorithm on the face recognition with various illuminations.

Supervised Kernel Uncorrelated Discriminant Neighborhood Preserving Projections

To separate each pattern class more strongly and deal with nonlinear ease, a new nonlinear manifold learning algorithm named supervised kernel uneorrelated diseriminant neighborhood preserving projections （SKUDNPP） is proposed. The algorithm utilizes supervised weight and kernel technique which makes the algorithm cope with classifying and nonlinear problems competently. The within-class geometric structure is preserved, while maximizing the between-class distance. And the features extracted are statistically uneorrelated by introducing an uneorrelated constraint. Experiment results on millimeter wave （MMW） radar target recognition show that the method can give competitive results in comparison with current papular algorithms.

A Comparative Study of Locality Preserving Projection and Principle Component Analysis on Classification Performance Using Logistic Regression

There are a variety of classification techniques such as neural network, decision tree, support vector machine and logistic regression. The problem of dimensionality is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity, however, we need to use dimensionality reduction methods. These methods include principal component analysis (PCA) and locality preserving projection (LPP). In many real-world classification problems, the local structure is more important than the global structure and dimensionality reduction techniques ignore the local structure and preserve the global structure. The objectives is to compare PCA and LPP in terms of accuracy, to develop appropriate representations of complex data by reducing the dimensions of the data and to explain the importance of using LPP with logistic regression. The results of this paper find that the proposed LPP approach provides a better representation and high accuracy than the PCA approach.

Evaluation of the oil and gas preservation conditions, source rocks, and hydrocarbongenerating potential of the Qiangtang Basin: New evidence from the scientific drilling project

The Qiangtang Basin of the Tibetan Plateau,located in the eastern Tethys tectonic domain,is the largest new marine petroliferous region for exploration in China.The scientific drilling project consisting primarily of well QK-1 and its supporting shallow boreholes for geological surveys(also referred to as the Project)completed in recent years contributes to a series of new discoveries and insights into the oil and gas preservation conditions and source rock evaluation of the Qiangtang Basin.These findings differ from previous views that the Qiangtang Basin has poor oil and gas preservation conditions and lacks high-quality source rocks.As revealed by well QK-1 and its supporting shallow boreholes in the Project,the Qiangtang Basin hosts two sets of high-quality regional seals,namely an anhydrite layer in the Quemo Co Formation and the gypsum-bearing mudstones in the Xiali Formation.Moreover,the Qiangtang Basin has favorable oil and gas preservation conditions,as verified by the comprehensive study of the sealing capacity of seals,basin structure,tectonic uplift,magmatic activity,and groundwater motion.Furthermore,the shallow boreholes have also revealed that the Qiangtang Basin has high-quality hydrocarbon source rocks in the Upper Triassic Bagong Formation,which are thick and widely distributed according to the geological and geophysical data.In addition,the petroleum geological conditions,such as the type,abundance,and thermal evolution of organic matter,indicate that the Qiangtang Basin has great hydrocarbon-generating potential.

Energy Efficient Access Point Selection and Signal Projection for Accurate Indoor Positioning

We propose a method to improve positioning accuracy while reducing energy consumption in an indoor Wireless Local Area Network(WLAN) environment.First,we intelligently and jointly select the subset of Access Points(APs) used in positioning via Maximum Mutual Information(MMI) criterion.Second,we propose Orthogonal Locality Preserving Projection(OLPP) to reduce the redundancy among selected APs.OLPP effectively extracts the intrinsic location features in situations where previous linear signal projection techniques failed to do,while maintaining computational efficiency.Third,we show that the combination of AP selection and OLPP simultaneously exploits their complementary advantages while avoiding the drawbacks.Experimental results indicate that,compared with the widely used weighted K-nearest neighbor and maximum likelihood estimation method,the proposed method leads to 21.8%(0.49 m) positioning accuracy improvement,while decreasing the computation cost by 65.4%.

A PERTURBATION ANALYSIS FOR THE PROJECTION OF A STIFFLY SCALED MATRIX

In this paper we study the perturbation bound of the projection ( W A ) ( W A )+,where both the matrices A and W are given with W positive diagonal and severely stiff.When the perturbed matrix (A)= A + δA satisfy several row rank preserving conditions,we derive a new perturbation bound of the projection.

基于局部保留投影的稀疏中智聚类算法

聚类算法是机器学习领域重要的研究课题之一,传统的中智聚类算法(例如FC-PFS算法)未考虑局部空间结构,且距离的计算受到冗余特征影响,不能有效处理高维数据集。为此,提出一种新的基于局部保留投影的稀疏中智聚类算法(LPSNCM)及其优化方法。一方面LPSNCM算法通过局部保留投影方法生成具有局部结构信息的正交投影空间,另一方面通过特征提取方法可以减少特征数量以获得更有效的特征,从而增强了FC-PFS算法处理高维数据的能力。LPSNCM算法也可以被看作是谱聚类两个独立阶段的统一模型。在一些基准数据集上的实验结果表明,与FC-PFS和某些最新方法相比,证明了LPSNCM的有效性。

深度置信网络融合局部保持投影的入侵检测模型

网络入侵检测系统(NIDS)提供了比其他传统网络防御技术(如防火墙系统)更好的网络安全解决方案。提出一种深度置信网络(DBN)与局部保持投影技术相融合的入侵检测模型。深度置信网络用于原始数据的特征学习;采用局部保持投影(LPP)融合深层特征,进一步去除冗余和无关特征。最后使用Softmax分类器进行分类。研究该方法在NSL-KDD数据集和UNSW-NB15数据集上的准确率、检测率、误报率等分类指标,并与常规的机器学习分类方法及其他文献中最新的方法进行比较。实验结果表明DBN-LPP模型提高了入侵检测的综合性能,其性能优于传统的机器学习分类方法及其他方法,为入侵检测提供了一种新的研究方法。

基于最优近邻的局部保持投影方法

局部保持投影(LPP)方法是机器学习领域中一种经典的降维方法。然而LPP方法以及部分改进方法在构建数据的局部结构时简单地使用k最近邻(k-NN)分类算法寻找样本的近邻点,容易受到参数k、噪声和异常值的影响。为了解决上述问题,提出一种基于最优近邻的LPP方法。该方法使用寻找最优近邻算法,在找到样本近邻点后,进一步选择与样本有一定数量的共同近邻点的近邻样本作为最优近邻,通过共同近邻点的限定来选择与样本最相似的近邻,增强近邻样本间的相关性,避免了传统LPP方法受参数k影响大等问题。在选择出足够的样本最优近邻后,构建数据局部结构,以便准确地反映数据的本质结构特征,使降维后的数据能最大程度保留样本的有效信息,提升后续机器学习模型的性能。公共图像数据集上的对比实验结果表明,该方法具有较好的数据降维效果,有效地提高了图像识别准确率。

最近邻子空间保持的特征提取方法

针对流形学习方法定义的局部存在置信度不足的问题,通过保持局部的内部关系和空间关系来捕捉数据的低维流形,提出一种最近邻子空间保持的特征提取方法。将数据中的每个样本点及其K个近邻视为一个局部,进而张成一个最近邻子空间;利用格拉姆行列式对所有最近邻子空间的体积进行度量;对体积做归一化处理,并集成到局部保持投影算法的模型中。在真实数据上的聚类和分类实验结果表明该方法提取的特征更具鉴别能力。

基于自变量简约的大规模稀疏多目标优化

现有的大多数进化算法在求解大规模优化问题时性能会随决策变量维数的增长而下降。通常,多目标优化的Pareto有效解集是自变量空间的一个低维流形,该流形的维度远小于自变量空间的维度。鉴于此,提出一种基于自变量简约的多目标进化算法求解大规模稀疏多目标优化问题。该算法通过引入局部保持投影降维,保留原始自变量空间中的局部近邻关系,并设计一个归档集,将寻找到的非劣解存入其中进行训练,以提高投影的准确性。将该算法与四种流行的多目标进化算法在一系列测试问题和实际应用问题上进行了比较。实验结果表明,所提算法在解决稀疏多目标问题上具有较好的效果。因此,通过自变量简约能降低问题的求解难度,提高算法的搜索效率,在解决大规模稀疏多目标问题方面具有显著的优势。