基于改进型偏最小二乘法的高炉炼铁工序能耗预测方法

针对小样本环境下,具有自变量之间多重相关性特点的高炉炼铁工序能耗预测问题,从预测角度利用"舍一交叉"验证方法对偏最小二乘回归模型进行了改进,提出了应用改进型偏最小二乘回归建立预测模型的方法。以我国某钢铁厂高炉炼铁工序的能耗预测为例,说明了改进型偏最小二乘回归法与普通偏最小二乘回归法相比,预测误差平方和能够降低86.76%。     

基于偏最小二乘法的人脸识别

在人脸识别中．最小二乘回归方法及其改进的偏最小二乘法作为一种新的降维方法，在处理小样本、高维数等方面的具有明显优势。线性判决分析(也称Fisher判决)是一种应用广泛的分类算法。本文提出了一种基于偏最小二乘与线性判决分析相结合的人脸识别方法．利用偏最小二乘回归分析对人脸图像进行降维和特征提取．再利用线性判决分析对特征向量进行分类识别。ORL人脸库的仿真结果证明偏最小二乘回归方法比主元分析方法更有效。     

稀疏最小二乘支持向量机及其应用研究

提出一种构造稀疏化最小二乘支持向量机的方法．该方法首先通过斯密特正交化法对核矩阵进 行简约,得到核矩阵的基向量组;再利用核偏最小二乘方法对最小二乘支持向量机进行回归计算,从而使最 小二乘向量机具有一定稀疏性．基于稀疏最小二乘向量机建立了非线性动态预测模型,对铜转炉造渣期吹炼 时间进行滚动预测．仿真结果表明,基于核偏最小二乘辨识的稀疏最小二乘支持向量机具有计算效率高、预 测精度好的特点．     

多态偏最小二乘法模型

为了更合理的确定偏最小二乘法的主成分数,提出了一种多态偏最小二乘法的建模方式。介绍了建模和预测具体实现过程。给出了预测时样品相似度计算的两种方式:直接距离法和性质得分距离法。以玉米样品近红外光谱数据为例,分别采用多态偏最小二乘法与传统偏最小二乘法建模对蛋白质指标进行了检测。结果表明:多态偏最小二乘法预测结果优于传统偏最小二乘法预测结果,有更强的适应性和兼容性。     

融入受限玻尔兹曼机的偏最小二乘优化方法

偏最小二乘法内部采用主成分分析,不能充分表达数据的非线性特征,对非线性数据的预测精度较低。为此,提出一种融合受限玻尔兹曼机与偏最小二乘的分析预测方法。该方法利用受限玻尔兹曼机对特征空间提取非线性结构,将提取的特征成分取代偏最小二乘中的成分,从而得到适应非线性的模型。实验结果表明,融合受限玻尔兹曼机与偏最小二乘法的分析方法能较好地反映数据的非线性特征。     

计算机辅助材料设计的偏最小二乘法－人工神经网络研究

在噪声小的ＰＬＳ（偏最小二乘法）空间上，样本集的局部投影可被用作ＢＰＮ（反向传播网络）的输入元素以建立一种“平衡”的神经网络结构，这种结构在很大程度上克服了通常ＢＰＮ过拟合的缺点。在ＰＬＳ子空间优化区，利用非线性逆映照技术设计的基于期望目标值的样本可通过ＰＬＳ－ＰＮ方法预报和选取。本文还利用此方法设计了若干以初始容量为目标的Ｎｉ／ＭＨ电池阴极材料。     

非线性偏最小二乘建模方法及在近红外光谱建模上的应用

偏最小二乘算法(PLS)是常用的线性光谱建模方法。针对汽油在线调合中具有非线性特点的辛烷值、干点等属性应用PLS方法建立模型误差较大问题,本文提出了残差-递阶偏最小二乘的建模方法,该方法对已经提取成分后的自变量中剩余的信息再提取主成分,并将该主成分作为新的自变量参与回归建模。仿真验证结果表明:残差-递阶偏最小二乘方法建立的模型中验证集的样本数据误差均在正负0.2之间。残差-递阶偏最小二乘方法与偏最小二乘、递阶偏最小二乘叫-PLS)两种方法比较,残差-递阶偏最小二乘建立的模型有的更高的精度和模型适应性。     

偏最小二乘法中主成分数确定的新方法

目的：合理地确定偏最小二乘法中的主成分数,方法：基于对 加权原理建立了适用于矩阵元素缺损数据的加权偏小二乘算法,将此算法应用于按矩阵元素分组的交互证实（Cross-validation),根据最大熵原理采用方差平方和σ2（自变量短阵残差的平方和／自由度）作为主成分数的判据,结果与结论：通过对Monte-Carlo法产生的多组分光光度数据进行计算,与常规的偏最小二乘法相比更加符合理论值,表明本算法较好地解决了偏最小二乘法中主成分数的确定问题。     

基于小波神经网络的非线性系统建模研究

研究了用小波神经网络对非线性系统进行建模问题。提出了用带遗忘因子的最小二乘法训练网络的权值，利用递推预报误差算法训练伸缩因子和平移因子的交互辩识算法。仿真结果证明了算法的有效性。     

基于特征相关的偏最小二乘特征选择方法

针对传统的偏最小二乘法只考虑单特征的重要性以及特征之间存在冗余和多重共线性等问题，将特征之间的统计相关性引入到传统的偏最小二乘分析中，构造了一种基于特征相关的偏最小二乘模型。首先利用特征相关度对特征进行评估预选出特征组，然后将其放入偏最小二乘模型中进行训练，评估该特征组是否可取。结合前向贪心搜索策略依次评价候选特征，并选中使目标函数最小的候选特征加入到已选特征。分别采用麻杏石甘汤君药止咳、平喘和UCI数据集进行分析处理，实验结果表明，该特征选择方法能较好寻找较优的特征组。     

A differential semantics for jointree algorithms

A new approach to inference in belief networks has been recently proposed, which is based on an algebraic representation of belief networks using multi-linear functions. According to this approach, belief network inference reduces to a simple process of evaluating and differentiating multi-linear functions. We show here that mainstream inference algorithms based on jointrees are a special case of the approach based on multi-linear functions, in a very precise sense. We use this result to prove new properties of jointree algorithms. We also discuss some practical and theoretical implications of this new finding.     

Quantitative Inference by Qualitative Semantic Knowledge Mining with Bayesian Model Averaging

In this paper, we consider the problem of performing quantitative Bayesian inference and model averaging based on a set of qualitative statements about relationships. Statements are transformed into parameter constraints which are imposed onto a set of Bayesian networks. Recurrent relationship structures are resolved by unfolding in time to Dynamic Bayesian networks. The approach enables probabilistic inference by model averaging, i.e. it allows to predict probabilistic quantities from a set of qualitative constraints without probability assignment on the model parameters. Model averaging is performed by Monte Carlo integration techniques. The method is applied to a problem in a molecular medical context: We show how the rate of breast cancer metastasis formation can be predicted based solely on a set of qualitative biological statements about the involvement of proteins in metastatic processes.     

大规模社会网络敏感链接推理方法

社会网络中许多应用需要对敏感链接关系进行匿名保护,然而攻击者利用基于推理的攻击可以披露个体之间的链接隐私关系。当前许多基于网络结构的推理攻击方法尽管能够找出链接关系,但由于没有考虑节点之间的相似度量特征而导致推理效率较低,并且也不适用于推理大规模网络节点的链接关系。提出了一种大规模社会网络中基于节点相似度量特征的敏感链接推理框架。该框架包括基于图聚类的特征矩阵划分,针对每个类进行奇异值分解,进而计算出各节点对之间的相似度量值,再以相似度量值为贝叶斯推理条件来计算节点对之间链接存在性的后验概率。实验结果表明,所提出的敏感链接推理方法有较高的推理准确性,增强了推理效果,尤其是在大规模社会网络中,优势更加明显。     

一种基于神经网络逆向推理机制的专家系统

本文提出了一种基于神经网络逆向推理机制的专家系统设计方案。论文研究了一种表达知识的二元产生式规则及其编码方法。通过编码，知识被存储在ANN中；基于ANN的知识库，论文设计了一种具有逆向推理机制的推理机。本文设计了一个原型系统，用于动物识别，经实验，取得较理想的效果，证明了该方法的有效性。     

Integrated condition monitoring and control of fed-batch fermentation processes

This paper investigates the benefits that the partial least squares (PLS) modelling approach offers engineers involved in the operation of fed-batch fermentation processes. It is shown that models developed using PLS can be used to provide accurate inference of quality variables that are difficult to measure on-line, such as biomass concentration. It is further shown that this model can be used to provide fault detection and isolation capabilities and that it can be integrated within a standard model predictive control framework to regulate the growth of biomass within the fermenter. This model predictive controller is shown to provide its own monitoring capabilities that can be used to identify faults within the process and also within the controller itself. Finally it is demonstrated that the performance of the controller can be maintained in the presence of fault conditions within the process.     

网络断层扫描技术的研究与发展

当今网络的大尺度、不协作、异质和分布式管理等特点,使得网络状态与性能的直接动态测量很困难.研究针对网络中不能直接测量的特性参数的统计推断方法十分重要.以通信网络、断层扫描和统计学理论相结合的网络断层扫描是一种全新的、最具前景的网络性能测量与推断技术,它通过边缘测量推断不可观测的网络行为且不要求网络内部元素和边缘节点的协作.简要介绍了网络断层扫描的基本概念与数学模型,从数据测量技术、统计推断技术两个方面论述了网络断层扫描技术的研究现状和一些有价值的新发展,并指出了进一步研究的方向.     

Hybrid partial least squares and neural network approach for short-term electrical load forecasting

Intelligent systems and methods such as the neural network (NN) are usually used in electric power systems for short-term electrical load forecasting. However, a vast amount of electrical load data is often redundant, and linearly or nonlinearly correlated with each other. Highly correlated input data can result in erroneous prediction results given out by an NN model. Besides this, the determination of the topological structure of an NN model has always been a problem for designers. This paper presents a new artificial intelligence hybrid procedure for next day electric load forecasting based on partial least squares (PLS) and NN. PLS is used for the compression of data input space, and helps to determine the structure of the NN model. The hybrid PLS-NN model can be used to predict hourly electric load on weekdays and weekends. The advantage of this methodology is that the hybrid model can provide faster convergence and more precise prediction results in comparison with abductive networks algorithm. Extensive testing on the electrical load data of the Puget power utility in the USA confirms the validity of the proposed approach.     

Hybrid partial least squares and neural network approach for short-term electrical load forecasting

Intelligent systems and methods such as the neural network （NN） are usually used in electric power systems for short-term electrical load forecasting. However, a vast amount of electrical load data is often redundant, and linearly or nonlinearly correlated with each other. Highly correlated input data can result in erroneous prediction results given out by an NN model. Besides this, the determination of the topological structure of an NN model has always been a problem for designers. This paper presents a new artificial intelligence hybrid procedure for next day electric load forecasting based on partial least squares （PLS） and NN. PLS is used for the compression of data input space, and helps to determine the structure of the NN model. The hybrid PLS-NN model can be used to predict hourly electric load on weekdays and weekends. The advantage of this methodology is that the hybrid model can provide faster convergence and more precise prediction results in comparison with abductive networks algorithm. Extensive testing on the electrical load data of the Puget power utility in the USA confirms the validity of the proposed approach.     

The construction of a fuzzy inference network by extension of the rule inference network

Fuzzy logic can bring about inappropriate inferences as a result of ignoring some information in the reasoning process. Neural networks are powerful tools for pattern processing, but are not appropriate for the logical reasoning needed to model human knowledge. The use of a neural logic network derived from a modified neural network, however, makes logical reasoning possible. In this paper, we construct a fuzzy inference network by extending the rule–inference network based on an existing neural logic network. The propagation rule used in the existing rule–inference network is modified and applied. In order to determine the belief value of a proposition pertaining to the execution part of the fuzzy rules in a fuzzy inference network, the nodes connected to the proposition to be inferenced should be searched for. The search costs are compared and evaluated through application of sequential and priority searches for all the connected nodes.     

An Approximate Algorithm for Min‐Based Possibilistic Networks

Min‐based (or qualitative) possibilistic networks are important tools to efficiently and compactly represent and analyze uncertain information. Inference is a crucial task in min‐based networks, which consists of propagating information through the network structure to answer queries. Exact inference computes posteriori possibility distributions, given some observed evidence, in a time proportional to the number of nodes of the network when it is simply connected (without loops). On multiply connected networks (with loops), exact inference is known as a hard problem. This paper proposes an approximate algorithm for inference in min‐based possibilistic networks. More precisely, we adapt the well‐known approximate algorithm Loopy Belief Propagation (LBP) on qualitative possibilistic networks. We provide different experimental results that analyze the convergence of possibilistic LBP.