基于改进粒子群优化的无标记数据鲁棒聚类算法

已有的聚类算法大多仅考虑单一的目标,导致对某些形状的数据集性能较弱,对此提出一种基于改进粒子群优化的无标记数据鲁棒聚类算法。优化阶段:首先,采用多目标粒子群优化的经典形式生成聚类解集合;然后,使用K-means算法生成随机分布的初始化种群,并为其分配随机初始化的速度;最终,采用MaxiMin策略确定帕累托最优解。决策阶段：测量帕累托解集与理想解的距离,将距离最短的帕累托解作为最终聚类解。对比实验结果表明,本算法对不同形状的数据集均可获得较优的类簇数量,对目标问题的复杂度具有较好的鲁棒性。     

基于置信规则库的海基系统性能退化机理分析与预测

海基系统性能退化机理分析和预测对于提高海基系统的生存能力具有重要意义,但需要考虑不确定条件下的多种类型信息,传统方法在处理海基系统的不确定性时效果欠佳,而置信规则库(BRB)作为证据推理方法中的知识库又无法同时处理参数精度优化和组合爆炸问题.对此,采用BRB参数与结构联合优化方法,建立双层优化的海基系统置信规则库最优决策结构,以AIC(Akaike information criterion)为外层模型优化目标,MSE(Mean square error)为内层模型优化目标,实现同时优化的目的.对比模型输出和实际输出,并采用支持向量机(SVM)进行实验,结果表明,采用具有最优决策结构的海基系统置信规则库建模不仅可以降低模型中规则的数量,也可提高建模精度,验证了所提出方法的有效性.     

混合分解和强度帕累托多目标进化算法

在多目标进化优化中,使用分解策略的基于分解的多目标进化算法(MOEA/D)时间复杂度低,使用〖BP(〗强度帕累托策略的〖BP)〗强度帕累托进化算法-2(SPEA2)能得到分布均匀的解集。结合这两种策略,提出一种新的多目标进化算法用于求解具有复杂、不连续的帕累托前沿的多目标优化问题(MOP)。首先,利用分解策略快速逼近帕累托前沿;然后,利用强度帕累托策略使解集均匀分布在帕累托前沿,利用解集重置分解策略中的权重向量集,使其适配于特定的帕累托前沿;最后,利用分解策略进一步逼近帕累托前沿。使用的反向世代距离(IGD)作为度量标准,将新算法与MOEA/D、SPEA2和paλ-MOEA/D在12个基准问题上进行性能对比。实验结果表明该算法性能在7个基准问题上最优,在5个基准问题上接近于最优,且无论MOP的帕累托前沿是简单或复杂、连续或不连续的,该算法均能生成分布均匀的解集。     

混合互信息和粒子群算法的多目标特征选择方法

在数据挖掘中,由于数据集中含有大量的冗余和不相关的特征,因此特征选择是一个重要的预处理过程。提出了一个基于混合互信息和粒子群算法的过滤式-封装式的多目标特征选择方法(HMIPSO)。根据粒子的pbest距离上次更新的迭代次数,提出了自适应突变策略去扰动种群,避免种群陷入局部最优。同时基于帕累托前沿面和外部文档提出了一个新的集合概念。结合互信息和新的集合知识提出了一个局部搜索策略,使得帕累托前沿面中的粒子可以删除不相关和冗余的特征,然后通过精英策略更新学习前和学习后的帕累托前沿面。最后将提出的算法和另外4种多目标算法在15个UCI数据集上进行了测试,实验结果表明提出的算法能够更好地降低特征个数和分类错误率。     

对不连续帕累托前沿的一种改进的MOEA/D

提出了一种改进的基于分解的多目标进化算法,用于解决不连续帕累托前沿的多目标优化问题中出现帕累托近似前沿分布不均匀与不完整的问题.主要的思想是通过基于密度的聚类算法将尽量逼近帕累托前沿的种群划分为若干个子种群,将不连续帕累托前沿问题转化为多个连续子问题,然后协同演化所有子种群,最后获得更为均匀与完整的帕累托解集.实验表明对于处理不连续帕累托问题的优越性.     

梯度策略的多目标GANs帕累托最优解算法

针对基于梯度策略的多目标优化算法无法适用于多目标、高维度的生成对抗网络(Generative Adversarial Nets, GANs)及多目标GANs中利用交叉验证产生次优解,极难求得最优解等问题,提出一种基于梯度策略的多目标GANs帕累托最优解算法。该算法采用硬参数共享方式,将多目标优化分解为多个两目标优化,确定多目标权重参数后,沿着梯度方向进行线性搜索,最终确定帕累托最优解。理论上,在弱条件约束下,证明了所提算法能够确切地产生帕累托最优解。实验上,将所提算法应用到图像处理的常见领域,对比所提算法与原算法的性能。结果表明,当目标数量大于2时,所提算法能够产生明显的性能优势。     

多目标进化算法的污水处理过程优化控制

污水处理过程中,能耗与出水水质是两个相互矛盾的评价指标.为了找出这两个目标的最优解,本文在基于分解的多目标进化算法(MOEA/D)的基础上进行改进,期望用更少的进化次数得到分布均匀的近似帕累托前沿.针对MOEA/D算法每一次产生的新解,本文中改进的算法从所有子问题中找到最合适新解的子问题,并在其邻域范围内进行种群的更替,在原本子问题的基础上进行二次寻优,提高子代利用率,进而用更少的迭代次数找到优化问题中的近似帕累前沿.实验证明,该算法明显减少了找到帕累托前沿的步数,使得MOEA/D算法的性能明显提升,在污水处理过程优化问题中达到了优化目标的作用.     

基于GDA的置信规则库参数训练的集成学习方法

目前对置信规则库(belief rule base,BRB)的研究主要针对单个BRB系统,然而单个BRB系统的推理性能不仅受参数取值的影响,而且当训练集分布不均衡或数据量较少时,容易导致参数训练不全面,从而使得推理结果所提供的决策信息存在局部性。通过引入Bagging算法和Ada Boost算法,分别与BRB相结合提出了基于梯度下降法(gradient descent algorithm,GDA)的置信规则库系统的集成学习方法,并分别应用于输油管道检漏、多峰函数的置信规则库训练,将多个BRB子系统集成,提高系统的推理性能。在实验中,以收敛精度和曲线拟合效果作为衡量指标来分析集成系统的性能,并将集成系统与其他单个BRB系统进行比较,实验结果表明BRB集成学习方法合理有效。     

基于动态反向学习和莱维飞行的双搜索模式萤火虫算法

针对多目标萤火虫算法在解决复杂多目标问题时存在收敛性差和分布性不足的问题,提出了基于动态反向学习和莱维飞行的双搜索模式萤火虫算法(MOFA-LR)。该算法通过比较任意一只萤火虫与种群中其余萤火虫的适应度值,判断它们之间的支配关系,根据不同的支配关系选择不同的搜索模式。当萤火虫被支配时,应注重向帕累托前沿上的优质解靠近,因此通过动态反向学习策略求出当前个体的反向解,使用反向解结合全局最优解共同引导萤火虫移动的搜索模式,能够发掘潜在的较好解,使萤火虫最大可能地向有利方向移动,改善了算法的收敛性;当萤火虫不被支配时,应注重获得均匀分布的帕累托前沿,因此使用全局最优解引导萤火虫飞行并结合莱维扰动的搜索模式,既能有效利用非支配解的优良信息,又能避免算法陷入停滞,在改善算法收敛性的同时维护了分布性。最后,为避免算法在迭代后期出现萤火虫严重聚集的现象,添加变异算子帮助种群跳出局部最优,引导种群进行局部开采。将MOFA-LR与12种新近多目标优化算法进行比较,实验结果表明,MOFA-LR具有良好的收敛性和分布性,证明了所提策略的有效性。     

建筑生命周期碳排放评价函数多目标优化算法

碳排放量一旦超标,会使全球气温升高,导致南北极冰川融化,形成自然灾害.为此提出一种建筑生命周期碳排放评价函数多目标优化算法,通过对建筑物的规划设计、施工阶段、运行维护阶段以及拆除阶段二氧化碳总排放量进行计算,获得排放的碳系数,再找出帕累托最优解集以及帕累托前端,决策者依据实际需求,解决建筑工程内多目标优化问题,最后计算非劣解集到达帕累托最优解集间距离、分散性以及错误率,完成对建筑物的碳排放量多目标优化评价.仿真结果证明,所提方法得到的碳排放量的数据更加准确,可更有效完成评价.     

Optimization Models for Training Belief-Rule-Based Systems

A belief rule-base inference methodology using the evidential reasoning approach (RIMER) has been developed recently, where a new belief rule representation scheme is proposed to extend traditional IF-THEN rules. The belief rule expression matrix in RIMER provides a compact framework for representing expert knowledge. However, it is difficult to accurately determine the parameters of a belief rule base (BRB) entirely subjectively, particularly, for a large-scale BRB with hundreds or even thousands of rules. In addition, a change in rule weight or attribute weight may lead to changes in the performance of a BRB. As such, there is a need to develop a supporting mechanism that can be used to train, in a locally optimal way, a BRB that is initially built using expert knowledge. In this paper, several new optimization models for locally training a BRB are developed. The new models are either single- or multiple-objective nonlinear optimization problems. The main feature of these new models is that only partial input and output information is required, which can be either incomplete or vague, either numerical or judgmental, or mixed. The models can be used to fine tune a BRB whose internal structure is initially decided by experts' domain-specific knowledge or common sense judgments. As such, a wide range of knowledge representation schemes can be handled, thereby facilitating the construction of various types of BRB systems. Conclusions drawn from such a trained BRB with partially built-in expert knowledge can simulate real situations in a meaningful, consistent, and locally optimal way. A numerical study for a hierarchical rule base is examined to demonstrate how the new models can be implemented as well as their potential applications.     

利用MISA多目标优化的置信规则库分类算法

现有基于置信规则库的分类系统的分类准确率和效率受到系统参数设置以及规则库结构合理性的影响。为了寻找到最佳的参数值和最优的规则库结构,本文结合多目标免疫系统算法（multiobjective immune system algorithm, MISA）提出利用MISA多目标优化的置信规则库分类算法。该方法融合特征属性约简思想和差分进化算法思想建立训练模型,采用多目标免疫系统算法对系统复杂度和分类准确率进行多目标优化,从而寻找到分类模型的最优解。在实验分析中,首先将本文提出的置信规则库多目标分类系统MISA-BRM和置信规则库分类系统的实验结果进行对比,从复杂度和准确率两个维度说明本文方法的有效性。同时还将本文方法与现有的其他分类方法进行比较,验证本文方法的可行性和有效性。实验结果表明,本文方法能够有效地对基于置信规则库的分类系统的准确率和复杂度进行多目标优化。     

An extended study on multi-objective security games

The burgeoning area of security games has focused on real-world domains where security agencies protect critical infrastructure from a diverse set of adaptive adversaries. In such domains, decision makers have multiple competing objectives they must consider which may take different forms that are not readily comparable including safety, cost, and public perception. Thus, it can be difficult to know how to weigh the different objectives when deciding on a security strategy. To address the challenges of these domains, we propose a fundamentally different solution concept, multi-objective security games (MOSGs). Instead of a single optimal solution, MOSGs have a set of Pareto optimal (non-dominated) solutions referred to as the Pareto frontier, which can be generated by solving a sequence of constrained single-objective optimization problems (CSOPs). The Pareto frontier allows the decision maker to analyze the tradeoffs that exist between the multiple objectives. Our contributions include: (i) an algorithm, Iterative-ε-Constraints,, for generating the sequence of CSOPs; (ii) an exact approach for solving an mixed-integer linear program (MILP) formulation of a CSOP; (iii) heuristics that achieve speed up by exploiting the structure of security games to further constrain the MILP; (iv) an approximate approach for solving a CSOP built off those same heuristics, increasing the scalability of our approach with quality guarantees. Additional contributions of this paper include proofs on the level of approximation, detailed experimental evaluation of the proposed approaches and heuristics, as well as a discussion on techniques for visualizing the Pareto frontier.     

Iterative learning belief rule-base inference methodology using evidential reasoning for delayed coking unit

The belief rule-base inference methodology using evidential reasoning (RIMER) approach has been proved to be an effective extension of traditional rule-based expert systems and a powerful tool for representing more complicated causal relationships using different types of information with uncertainties. With a predetermined structure of the initial belief rule-base (BRB), the RIMER approach requires the assignment of some system parameters including rule weights, attribute weights, and belief degrees using experts’ knowledge. Although some updating algorithms were proposed to solve this problem, it is still difficult to find an optimal compact BRB. In this paper, a novel updating algorithm is proposed based on iterative learning strategy for delayed coking unit (DCU), which contains both continuous and discrete characteristics. Daily DCU operations under different conditions are modeled by a BRB, which is then updated using iterative learning methodology, based on a novel statistical utility for every belief rule. Compared with the other learning algorithms, our methodology can lead to a more optimal compact final BRB. With the help of this expert system, a feedforward compensation strategy is introduced to eliminate the disturbance caused by the drum-switching operations. The advantages of this approach are demonstrated on the UniSim? Operations Suite platform through the developed DCU operation expert system modeled and optimized from a real oil refinery.     

面向最佳决策结构的置信规则库结构学习方法

针对置信规则库中初始结构不合理的问题,现有的解决方法仍存在不具备可重复性或受数据完备性和等级效用值相关联的制约等方面的不足。鉴于此,对置信规则库的参数学习进行了理论分析和实验验证,总结出不合理结构下置信规则库中易出现结构欠完备问题或结构过完备问题;将DBSCAN算法和误差分析嵌入到现有参数学习方法中用于解决上述问题,进而提出了面向最佳决策结构的结构学习方法;通过实验分别在过完备结构和欠完备结构的置信规则库下验证了新方法,并对比了结构改变时误差的变化。实验结果表明所提方法是有效可行的。     

基于精英进化导向的多目标PID参数优化

在多目标优化问题中,决策者必须对Pareto前沿的众多非劣解做出选择.本文将决策偏好融入Pareto优化过程,提出一种基于精英导向机制的多目标遗传算法,根据决策偏好选择Pareto最优解为精英,利用无损有限精度法和归一增量距离保持种群多样性,通过多种群进化机制将决策偏好的影响传播到整个种群.该方法成功应用于自动导引车(AGV)伺服系统的PID参数优化,可根据决策偏好快速有效地定向搜索Pareto最优解,保证伺服控制达到路径跟踪要求的速度响应性能.     

基于决策者偏好区域的多目标粒子群算法研究*

多目标优化问题中,决策者往往只对目标空间的某一区域感兴趣,因此需要在这一特定的区域能够得到比较稠密的Pareto解,但传统的方法却找出全部的Pareto前沿,决策效率不高。针对该问题,给出了基于决策者偏好区域的多目标粒子群优化算法。它只求出与决策者偏好区域相关的部分Pareto最优集,从而减少了进化代数,加快收敛速度,有利于决策者进行更有效的决策。算法把解与偏好区域的距离作为影响引导者选择和剪枝策略的一个因素,运用格栅方法实现解在Pareto边界分布的均匀性。仿真结果表明该算法是有效的。     

Online updating belief rule based system for pipeline leak detection under expert intervention

A belief rule base inference methodology using the evidential reasoning approach (RIMER) has been developed recently, where a new belief rule base (BRB) is proposed to extend traditional IF-THEN rules and can capture more complicated causal relationships using different types of information with uncertainties, but these models are trained off-line and it is very expensive to train and re-train them. As such, recursive algorithms have been developed to update the BRB systems online and their calculation speed is very high, which is very important, particularly for the systems that have a high level of real-time requirement. The optimization models and recursive algorithms have been used for pipeline leak detection. However, because the proposed algorithms are both locally optimal and there may exist some noise in the real engineering systems, the trained or updated BRB may violate some certain running patterns that the pipeline leak should follow. These patterns can be determined by human experts according to some basic physical principles and the historical information. Therefore, this paper describes under expert intervention, how the recursive algorithm update the BRB system so that the updated BRB cannot only be used for pipeline leak detection but also satisfy the given patterns. Pipeline operations under different conditions are modeled by a BRB using expert knowledge, which is then updated and fine tuned using the proposed recursive algorithm and pipeline operating data, and validated by testing data. All training and testing data are collected from a real pipeline. The study demonstrates that under expert intervention, the BRB expert system is flexible, can be automatically tuned to represent complicated expert systems, and may be applied widely in engineering. It is also demonstrated that compared with other methods such as fuzzy neural networks (FNNs), the RIMER has a special characteristic of allowing direct intervention of human experts in deciding the internal structure and the parameters of a BRB expert system.     

基于模糊逻辑NSGA-Ⅲ的开关磁阻发电机多目标优化算法

低资源型的汉越神经机器翻译中,数据稀疏问题是影响翻译性能的主要原因,目前缓解该问题的途径之一是通过语料扩充方法生成伪平行数据,并用于机器翻译模型的训练,伪平行数据生成方法主要有基于词的替换、单语数据回译和枢轴翻译3种.目前的研究集中于3种方法的单独使用,缺少方法间融合利用方面的研究工作,针对此问题,提出了融入双语词典的正反向枢轴方法,利用英语作为枢轴语言,在汉到英到越正向枢轴的基础上,融入利用稀有词构建的汉-英和英-越双语词典,将汉语单语数据通过模型翻译成英语数据,再利用英-越模型将其翻译成越南语数据,其次进行越到英到汉反向枢轴翻译将越南语单语数据翻译为汉语,以此在2个方向上生成汉越伪平行数据,并利用语言模型对生成的伪平行数据进行筛选.汉-越翻译任务上的实验结果表明,提出的融入双语词典的正反向枢轴方法,能够产生更优的伪平行语料,进而显著提升汉越神经机器翻译任务的性能.