序列模式挖掘研究与发展

序列模式挖掘是数据挖掘的一个重要研究课题,它在很多领域中都有着广泛的应用.首先讨论了序列模式挖掘的相关背景,然后对序列模式挖掘进行分类,并在此基础上对每一类序列模式挖掘算法的特点进行了介绍和比较;最后,对序列模式挖掘未来的研究重点进行展望,以便研究者对序列模式挖掘做进一步的研究.     

粗糙集理论在选矿生产成本分析中的应用

科学地分析影响原料消耗成本变化的主要因素,才能揭示成本变动原因,为成本控制提供有效依据.因此,提出基于粗糙集理论的原料消耗成本影响因素重要度确定方法.利用分类质量来度量各因素对原料消耗成本的影响程度,应用基于可辨识矩阵和逻辑运算方法求解决策表的最小简约,找出影响原料消耗成本的确定性因素和不确定性因素,为改进生产提供辅助决策支持.实例分析表明,该方法简捷实用,可定量分析影响因素对原料消耗成本的影响程度.     

Graphical models for interactive POMDPs: representations and solutions

We develop new graphical representations for the problem of sequential decision making in partially observable multiagent environments, as formalized by interactive partially observable Markov decision processes (I-POMDPs). The graphical models called interactive influence diagrams (I-IDs) and their dynamic counterparts, interactive dynamic influence diagrams (I-DIDs), seek to explicitly model the structure that is often present in real-world problems by decomposing the situation into chance and decision variables, and the dependencies between the variables. I-DIDs generalize DIDs, which may be viewed as graphical representations of POMDPs, to multiagent settings in the same way that I-POMDPs generalize POMDPs. I-DIDs may be used to compute the policy of an agent given its belief as the agent acts and observes in a setting that is populated by other interacting agents. Using several examples, we show how I-IDs and I-DIDs may be applied and demonstrate their usefulness. We also show how the models may be solved using the standard algorithms that are applicable to DIDs. Solving I-DIDs exactly involves knowing the solutions of possible models of the other agents. The space of models grows exponentially with the number of time steps. We present a method of solving I-DIDs approximately by limiting the number of other agents’ candidate models at each time step to a constant. We do this by clustering models that are likely to be behaviorally equivalent and selecting a representative set from the clusters. We discuss the error bound of the approximation technique and demonstrate its empirical performance.     

An augmented Lagrangian approach to non-convex SAO using diagonal quadratic approximations

Successful gradient-based sequential approximate optimization (SAO) algorithms in simulation-based optimization typically use convex separable approximations. Convex approximations may however not be very efficient if the true objective function and/or the constraints are concave. Using diagonal quadratic approximations, we show that non-convex approximations may indeed require significantly fewer iterations than their convex counterparts. The nonconvex subproblems are solved using an augmented Lagrangian (AL) strategy, rather than the Falk-dual, which is the norm in SAO based on convex subproblems. The results suggest that transformation of large-scale optimization problems with only a few constraints to a dual form via convexification need sometimes not be required, since this may equally well be done using an AL formulation.     

On topology optimization of linear and nonlinear plate problems

In this paper we propose a new restriction method based on employing C ⁰-continuous fields of density defined on a set of meshes different from the one used for the finite element analysis. The optimization procedure starts with using a coarse density-mesh compared to the finite element one. Once the convergence is obtained in the optimization steps, a finer density-mesh is nominated for the further steps. Linear and nonlinear plate behaviors are considered and formulated by Kirchhoff or Mindlin–Reissner hypothesis. Comparison is made with element/nodal based approaches using filter. The results show excellent and robust performance of the proposed method.     

基于属性重要度的ID3改进算法

ID3算法是数据挖掘中最经典的分类算法.该算法偏向于选择取值较多的属性,而属性值较多的属性不总是重要的,从而影响了分类预测的高效性.通过对ID3算法的研究,依据属性重要度粗糙集理论的思想,对经典的ID3算法做了相应的改进,改进后的ID3算法(AIID3),提高了算法的决策效率.最后的实例及应用表明,改进的算法更有效,更快速.     

序列模式数据挖掘算法的并行化研究

序列模式在许多领域都有着重要的应用,大量的数据和模式需要高效的、可扩展的并行算法.针对目前序列模式挖掘算法存在的普遍问题,在对串行序列模式数据挖掘算法研究的基础上,本文提出了一种并行的序列模式数据挖掘算法.通过理论分析与实验验证可知:该并行数据挖掘算法,在海量数据的情形下,能很好地提高数据挖掘的效率.     

基于比例冲突再分配理论的目标识别应用研究

目前证据推理理论算法的改进仍然是热门的方向,其应用也越来越广,因此主要介绍了当前证据推理理论的两种最新的改进思想--最新的DSmT理论以及比例冲突再分配(PCR)方法;归纳总结了证据理论的主要应用及其在应用中的关键问题之--基本置信指派的主要构造方法;最后利用人工神经网络训练数据的方法构造基本置信指派,对比例冲突再分配(PCR5)方法在序列图像目标识别中的应用进行了仿真分析,仿真实验结果表明该算法可以有效地提高序列图像目标识别的准确性.     

基于卷积神经网络的随机因子重采样图像检测

图像重采样检测是图像取证领域的重要任务,其目的是检测图像是否经过重采样操作。现有的基于深度学习的重采样检测方法大多只针对特定的重采样因子进行研究,而较少考虑重采样因子完全随机的情况。本文根据重采样操作中所涉及的插值技术原理设计了一组高效互补的图像预处理结构以避免图像内容的干扰,并通过可变形卷积层和高效通道注意力机制(efficient channel attention, ECA)分别提取和筛选重采样特征,从而有效提高了卷积神经网络整合提取不同重采样因子的重采样特征的能力。实验结果表明,无论对于未压缩的重采样图像还是JPEG压缩后处理的重采样图像,本文方法都可以有效检测,且预测准确率相比现有方法均有较大提升。     

异质信息网络高阶层次化嵌入学习与推荐预测

异质信息网络是一种异质数据表示形式,如何融合异质数据复杂语义信息,是推荐系统面临的挑战之一.利用弱关系具有的丰富语义和信息传递能力,构建一种面向推荐系统的异质信息网络高阶嵌入学习框架,主要包括:初始化信息嵌入、高阶信息嵌入聚合与推荐预测3个模块.初始化信息嵌入模块首先采用基于弱关系的异质信息网络最佳信任路径筛选算法,有效地避免在全关系异质信息网络中,采样固定数量邻居造成的信息损失,其次利用新定义的基于多头图注意力的多任务共享特征重要性度量因子,筛选出节点的语义信息,并结合交互结构,有效地表征网络节点;高阶信息嵌入聚合模块通过融入弱关系及网络嵌入对知识良好的表征能力,实现高阶信息表达,并利用异质信息网络的层级传播机制,将被采样节点的特征聚合到待预测节点;推荐预测模块利用高阶信息的影响力推荐方法,实现了推荐任务.该框架具有嵌入节点类型丰富、融合共享属性和隐式交互信息等特点.最后,实验验证UI-HEHo学习框架可有效地改善评级预测的准确性,以及推荐生成的针对性、新颖性和多样性,尤其是在数据稀疏的应用场景中,具有良好的推荐效果.