An integrated dimensionality reduction and surrogate optimization approach for plant-wide chemical process operation

With liquefied natural gas becoming increasingly prevalent as a flexible source of energy, the design and optimization of industrial refrigeration cycles becomes even more important. In this article, we propose an integrated surrogate modeling and optimization framework to model and optimize the complex CryoMan Cascade refrigeration cycle. Dimensionality reduction techniques are used to reduce the large number of process decision variables which are subsequently supplied to an array of Gaussian processes, modeling both the process objective as well as feasibility constraints. Through iterative resampling of the rigorous model, this data-driven surrogate is continually refined and subsequently optimized. This approach was not only able to improve on the results of directly optimizing the process flow sheet but also located the set of optimal operating conditions in only 2 h as opposed to the original 3 weeks, facilitating its use in the operational optimization and enhanced process design of large-scale industrial chemical systems.     

Graph-Based Dimensionality Reduction for Hyperspectral Imagery: A Review

Hyperspectral image(HSI) contains a wealth of spectral information, which makes fine classification of ground objects possible. In the meanwhile, overly redundant information in HSI brings many challenges. Specifically, the lack of training samples and the high computational cost are the inevitable obstacles in the design of classifier. In order to solve these problems, dimensionality reduction is usually adopted. Recently, graph-based dimensionality reduction has become a hot topic. In this paper, the graph-based methods for HSI dimensionality reduction are summarized from the following aspects. 1) The traditional graph-based methods employ Euclidean distance to explore the local information of samples in spectral feature space. 2) The dimensionality-reduction methods based on sparse or collaborative representation regard the sparse or collaborative coefficients as graph weights to effectively reduce reconstruction errors and represent most important information of HSI in the dictionary. 3) Improved methods based on sparse or collaborative graph have made great progress by considering global low-rank information, local intra-class information and spatial information. In order to compare typical techniques, three real HSI datasets were used to carry out relevant experiments, and then the experimental results were analysed and discussed.Finally, the future development of this research field is prospected.     

一种基于压缩感知的邻域优化算法

非线性降维方法是目前对降维研究有着重要影响的方法,但在降维过程中经常会遇到局部邻域信息量不足、短路和噪声干扰等问题,严重影响降维效果,很难广泛应用于真实数据的处理中.对以上问题分析发现,其主要原因在于经典降维算法都是采用全局固定的邻域大小.提出了一种基于压缩感知的邻域优化算法,运用压缩感知技术对高维空间目标点近邻进行压缩采样,构建“收—放”模型,自适应得到最优子空间,同时优化邻域组成元素,使得数据的整体降维效果更加稳定.通过手工流形和真实数据集的实验,验证了算法的有效性和稳定性.     

降维方法监督分类的比较研究

对ISOMap、LDA、LLE、PCA这4种典型降维算法的主要思想和算法步骤进行了详细分析,并将它们用于有监督分类。从实验结果分析得到结论 ,其可为有监督分类提供有益的借鉴。     

基于类属属性的多标记学习算法

在多标记学习框架中,每个对象由一个示例(属性向量)描述,却同时具有多个类别标记.在已有的多标记学习算法中,一种常用的策略是将相同的属性集合应用于所有类别标记的预测中.然而,该策略并不一定是最优选择,原因在于每个标记可能具有其自身独有的特征.基于这个假设,目前已经出现了基于标记的类属属性进行建模的多标记学习算法LIFT.LIFT包含两个步骤:属属性构建与分类模型训练.LIFT首先通过在标记的正类与负类示例上进行聚类分析,构建该标记的类属属性;然后,使用每个标记的类属属性训练对应的二类分类模型.在保留LIFT分类模型训练方法的同时,考察了另外3种多标记类属属性构造机制,从而实现LIFT算法的3种变体——LIFT-MDDM,LIFT-INSDIF以及LIFT-MLF.在12个数据集上进行了两组实验,验证了类属属性对多标记学习系统性能的影响以及LIFT采用的类属属性构造方法的有效性.     

基于重叠片排列的流形学习算法

针对线性数据降维算法对处理非线性结构数据的降维效果不是很好,提出一种基于重叠片排列的流形学习算法,该算法根据局部的线性贴片处在非线性流形中的特性,将流形划分为线性互相重叠的局部区域贴片,且利用主成分分析方法得到局部区域贴片的低维表示,然后排列且对齐其低维坐标,以获得整体数据的低维坐标.通过仿真结果证明,基于重叠片排列的流形学习算法在应用于人脸识别和分类问题时以及在识别准确率方面要优于其他经典的流形学习算法.     

Sentiment visualization and classification via semi-supervised nonlinear dimensionality reduction

Sentiment analysis, which detects the subjectivity or polarity of documents, is one of the fundamental tasks in text data analytics. Recently, the number of documents available online and offline is increasing dramatically, and preprocessed text data have more features. This development makes analysis more complex to be analyzed effectively. This paper proposes a novel semi-supervised Laplacian eigenmap (SS-LE). The SS-LE removes redundant features effectively by decreasing detection errors of sentiments. Moreover, it enables visualization of documents in perceptible low dimensional embedded space to provide a useful tool for text analytics. The proposed method is evaluated using multi-domain review data set in sentiment visualization and classification by comparing other dimensionality reduction methods. SS-LE provides a better similarity measure in the visualization result by separating positive and negative documents properly. Sentiment classification models trained over reduced data by SS-LE show higher accuracy. Overall, experimental results suggest that SS-LE has the potential to be used to visualize documents for the ease of analysis and to train a predictive model in sentiment analysis. SS-LE can also be applied to any other partially annotated text data sets.     

大规模水电系统优化调度降维方法研究I:理论分析

中国水电系统规模持续扩张,使得已有方法在求解大规模水电调度问题时,存在严重维数灾及早熟收敛等不同程度局限,亟需分析已有方法以便发现其瓶颈所在,为探寻能均衡求解效率与计算精度的实用化方法提供有益参考。为此,首先深入研究了线性规划、二次规划和动态规划等多种方法的计算复杂度,然后定量对比分析了各方法在不同情景下的适用性,最后提出“四维一体可拓降维”总体思想,并给出具体的降维方法与策略,建议从空间维、时间维、状态维和组合维等4个方面开展综合研究,以切实服务于大规模水电系统优化调度的高效优质求解。     

Manifold Learning: Generalization Ability and Tangent Proximity

One of the ultimate goals of Manifold Learning (ML) is to reconstruct an unknown nonlinear low-dimensional Data Manifold (DM) embedded in a high-dimensional observation space from a given set of data points sampled from the manifold. We derive asymptotic expansion and local lower and upper bounds for the maximum reconstruction error in a small neighborhood of an arbitrary point. The expansion and bounds are defined in terms of the distance between tangent spaces to the original DM and the Reconstructed Manifold (RM) at the selected point and its reconstructed value, respectively. We propose an amplification of the ML, called Tangent Bundle ML, in which proximity is required not only between the DM and RM but also between their tangent spaces. We present a new geometrically motivated Grassman & Stiefel Eigenmaps algorithm that solves this problem and gives a new solution for the ML also.     

多种代数特征抽取方法下的人脸图像SVM算法研究

本文分别用主成分分析(PCA)、独立成分分析(ICA)以及线性鉴别分析(LDA)方法对图像进行特征抽取,采用支持向量机(SVM)算法进行人脸图像分类。通过在YALE人脸图像库上的实验结果验证表明,在多种特征抽取方法下的图像分类算法是有效的。