多Agent动态影响图的近似计算方法

由于复杂系统具有高维性和不确定性常难以表示处理,因而知识表示和计算方法是复杂系统研究中的公开难题.当前,多Agent影响图不能建模动态环境和多Agent,马尔可夫决策过程难以表示Agents之间结构关系的问题,因而提出一种用局部概率因式表示动态环境中多Agent之间关系的新决策模型--多Agent动态影响图(MADIDs).针对MADIDs模型的联合概率分布和联合效用函数在计算上的高维问题,研究该模型的近似计算方法.给出MADIDs概率结构部分的一种分层分解的分布近似方法,并通过对该近似方法的误差和复杂性的分析,给出一个可对近似分布的精度和复杂性进行均衡的函数δ(k);给出一种BP神经网络通过局部效用的学习来近似计算MADIDs的联合效用.在模型实例上的实验结果显示了MADIDs模型近似计算方法的有效性.     

Fusion of noisy images based on joint distribution model in dual-tree complex wavelet domain

Source images are frequently corrupted by noise before fusion, which will lead to the quality decline of fused image and the inconvenience for subsequent observation. However, at present, most of the traditional medical image fusion scheme cannot be implemented in noisy environment. Besides, the existing fusion methods scarcely make full use of the dependencies between source images. In this research, a novel fusion algorithm based on the statistical properties of wavelet coefficients is proposed, which incorporates fusion and denoising simultaneously. In the proposed algorithm, the new saliency and matching measures are defined by two distributions: the marginal statistical distribution of single wavelet coefficient fit by the generalized Gaussian Distribution and joint distribution of dual source wavelet coefficients modeled by the anisotropic bivariate Laplacian model. Additionally, the bivariate shrinkage is introduced to develop a noise robust fusion method, and a moment-based parameter estimation applied in the fusion scheme is also exploited in denoising method, which allows to achieve the consistency of fusion and denoising. The experiments demonstrate that the proposed algorithm performs very well on both noisy and noise-free images from multimodal medical datasets (computerized tomography, magnetic resonance imaging, magnetic resonance angiography, etc.), outperforming the conventional methods in terms of both fusion quality and noise reduction.     

误差准则的信息论解释

Error criteria (or error cost functions) play significant roles in statistical estimation problems. In this paper, we study error criteria from the viewpoint of information theory. The relationships between error criteria and error's entropy criterion are investigated. It is shown that an error criterion is equivalent to the error's entropy criterion plus a Kullback-Leibler information divergence (KL-divergence). Based on this result, two important properties of the error criteria are proved. Particularly, the optimum error criterion can be interpreted via the meanings of entropy and KL-divergence. Furthermore, a novel approach is proposed for the choice of p-power error criteria, in which a KL-divergence based cost is minimized. The proposed method is verified by Monte Carlo simulation experiments.     

基于信息论的KL-Reg点云配准算法

针对含有高噪声、体外点及不完整点云数据的配准失效问题,该文提出以信息论为理论基础,相对熵度量点云相似度的KL-Reg算法。该算法不需要显式地建立对应关系,首先将点云数据建模为高斯混合模型,然后用相对熵度量高斯混合模型间的分布距离,最后通过最小化分布距离计算模型变换。实验结果表明所提的KL-Reg算法配准精度高、稳定性强。     

基于KL变换和KL散度的电网数据特征提取与分类

智能电网用户行为特征的分析在电力营销策略中扮演者重要的角色。文中结合KL变换和KL散度的方法,提取与分类用电数据信息的特征,实现不同类型的用电数据划分。同时通过综合分析所有用户的日负荷曲线,提取不同类型用户的典型日负荷曲线。研究结果表明:基于KL变换的方法,通过对原始数据的压缩和主要特征的保留,大大降低了智能电网数据提取与分类的计算量,提高了时间效率;基于KL散度的方法,通过对k-means算法中的k值和初始聚类中心的选择进行优化,提高了聚类效果的准确率;实例中电网用户正常数据为38组,可分为3类典型用户,迎峰用电型、错峰用电型、部分迎峰用电型。该研究结果可以更加有效地对电网用户用电行为进行分类,从而为售电公司进行业务拓展提供技术基础。     

New lower bounds for statistical query learning

We prove two lower bounds in the statistical query (SQ) learning model. The first lower bound is on weak-learning. We prove that for a concept class of SQ-dimension d, a running time of is needed. The SQ-dimension of a concept class is defined to be the maximum number of concepts that are “uniformly correlated”, in that each of their pair has nearly the same correlation. This lower bound matches the upper bound in Blum et al. (Weakly Learning DNF and Characterizing Statistical Query Learning using Fourier Analysis, STOC 1994, pp. 253-262), up to a logarithmic factor. We prove this lower bound against an “honest SQ-oracle”, which gives a stronger result than the ones against the more frequently used “adversarial SQ-oracles”. The second lower bound is more general. It gives a continuous trade-off between the “advantage” of an algorithm in learning the target function and the number of queries it needs to make, where the advantage of an algorithm is the probability it succeeds in predicting a label minus the probability it does not. Both lower bounds extend and/or strengthen previous results, and solve an open problem left in previous papers. An earlier version of this paper [K. Yang, New lower bounds for statistical query learning, in: The Proceedings of the 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, Lecture Notes in Computer Science, vol. 2375, 2002, pp. 229-243.] appeared in the proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002).     

基于随机游走模型和KL-divergence的聚类算法

聚类分析在数据挖掘领域有着广泛的应用,该文提出一个聚类新思路,它不需要任何参数的假设,只基于数据两两之间的相似性。该方法假设数据点之间存在随机游走关系,根据数据相似性构造随机游走过程的转移矩阵,当随机游走过程进入收敛期后,t阶转移矩阵揭示了数据点的分布。用迭代方法寻找最小的KL-divergence来对这些分布聚类。该方法具有严谨的概率理论基础,避免了传统算法需要参数假设、限于局部最优等不足。实验表明,该算法具有较优的聚类效果。