一种基于假设检验的贝叶斯分类器

分类是数据挖掘领域的重要分支,而贝叶斯分类方法作为分类领域的重要技术得到了日益广泛的研究和应用。限制性贝叶斯网络在不牺牲太多精确性的前提下简化网络结构,是近几年分类领域的研究热点。论文采用统计学中理论较成熟的体积假设检验（Volume Testing）方法寻找属性间的依赖关系,同时结合假设检验的思想和朴素贝叶斯分类算法的优点构造限制性贝叶斯网络,提出了一种基于假设检验的贝叶斯分类算法,并命名为基于体积检验的贝叶斯分类算法。在Weka系统下进行的实验,结果表明,这种方法效果优于朴素贝叶斯方法、TAN算法等,尤其对大数据集有更佳的表现效果。     

遥感波段与样本组合及贝叶斯网络结构变化分析

贝叶斯网络表达了输入数据与分类结果之间的依赖关系,网络结构则表达了节点之间的条件概率状态。遥感数据的贝叶斯网络结构训练涉及先验知识和样本数量两个方面,是贝叶斯网络结构分类的重要环节。该文以应用目标和遥感数据波段的物理意义为先验知识指导,进行了贝叶斯网络结构建立中的遥感数据波段数和样本数的优化组合实验,为贝叶斯网络在遥感数据分类方面提供了基础性实验结果。     

基于互信息的贝叶斯网络结构学习算法

贝叶斯网络结构学习是贝叶斯网络构建的核心,有效的结构学习算法是构建最优网络结构的基础。基于此,提出一种基于互信息的贝叶斯网络结构学习算法,该算法可以挖掘出数据集各属性中存在的隐含依赖关系,适时地对数据集进行降维操作,从而提高算法的效率,并可保证结果的准确性。实验结果表明,与常用的依赖分析算法SGS相比,在结果相似的情况下,该算法执行效率更高。     

用于风险管理的贝叶斯网络学习

结合专家知识和数据进行贝叶斯网络学习.首先利用专家知识建立初始贝叶斯网络结构和参数;然后基于变量之间基本依赖关系、基本结构和依赖分析方法,对初始贝叶斯网络结构进行修正和调整,得到新的贝叶斯网络结构;最后将由专家和数据确定的参数合成为新的参数,得到融合专家知识和数据的贝叶斯网络.该方法可避免现有的贝叶斯网络学习过于依赖数据、对数据的数量和质量要求过高等问题.     

一种改进的贝叶斯网络结构学习分类模型及应用

贝叶斯网络结构的构建是贝叶斯网络分类的重点,有效的贝叶斯网络结构学习算法是构建贝叶斯网络的核心。改进的贝叶斯网络结构学习算法使用交叉熵来确定弧的方向,用最小切割集来对有向图进行调整,并且加入环路检验以保证图中不会出现回路。将算法应用到质量管理中,用实际的数据集进行实验,并与现有算法进行对比,结果表明该算法是行之有效的,且具有较高的精确性。     

一种改进隐朴素贝叶斯算法的研究

朴素贝叶斯分类器(NB)由于结构简单,计算高效而被广泛应用,但它不能充分利用属性间的依赖关系,有一定的局限性.因此,隐朴素贝叶斯分类器(HNB)通过为每个属性引入一个隐藏父节点,将各个属性之间的依赖关系都综合其中,使属性间的依赖关系得到了利用.但隐朴素贝叶斯分类器忽略了属性对与该属性的依赖关系,故在此基础上提出一种改进算法--双隐朴素贝叶斯算法(DHNB),使属性对与该属性的依赖关系得到了充分的利用,并提出一种新型的阈值定义法,使得选取的阈值让分类精度与时间复杂度的比值为最大,缓解了算法时间复杂度和分类精度之间的矛盾.然后将改进的算法在UCI数据集上进行仿真试验,结果表明其分类性能优于HNB和NB,该方法具有较好的适用性.     

贝叶斯网络结构模型的构建

贝叶斯网络结构是一种将贝叶斯概率方法和有向无环图的网络拓扑结构有机结合的表示模型,它描述了数据项及其依赖关系,并根据各个变量之间概率关系建立图论模型,但是如何获取具有丢失数据的网络结构是一个急需解决的问题.本文提出一个基于Kullback-Leibler(KL)散度的贝叶斯网络结构学习的KLBN(Kullback-Leibler Bayesian Network)算法.实验结果表明,KLBN算法在可靠性方面明显优于传统的具有丢失数据的贝叶斯网络结构学习算法.     

基于有向树算法构造的TAN分类器

树扩展型朴素贝叶斯(TAN)分类器放松了朴素贝叶斯的属性独立性假设,是对朴素贝叶斯分类器的有效改进.但传统TAN的构造算法中树的根结点是随意选择的,这使得其无法精确表达属性间的依赖关系.通过将依赖关系设定方向,并将有向树算法引入TAN分类器的构造,提出了一种新的TAN模型构造方法--DTAN.实验结果表明,DTAN分类方法在实例个数比较多的数据集上具有显著优秀的分类性能.     

一种贝叶斯网络结构学习的优化策略

贝叶斯网络(Bayesian Network,BN)近年成为数据挖掘引人注目的研究方向,贝叶斯网络的学习也就是要找出一个能够最真实反映现有数据集中各数据变量相互之间的依赖关系的贝叶斯网络模型。本文针对BN结构学习的Jie Cheng＆David Bell算法作了相关研究并提出了优化策略(MJAC算法)。本文最后以一个经典概率模型验证了优化算法的可行性。     

贝叶斯网络及其在决策支持系统中的应用

以贝叶斯概率和贝叶斯网络基本理论为基础，主要研究了贝叶斯网络的结构学习和使用贝叶斯网络进行知识发现和决策支持的方法。利用WILD算法对防洪数据进行了属性离散化，采用K2算法在防洪决策中建立了一种贝叶斯网络模型，并对该模型进行了概率依赖关系描述。说明了贝叶斯网络对数据库进行知识发现和决策支持的有效性。     

完备数据集上贝叶斯网络结构学习研究

贝叶斯网络是用来描述不确定变量之间潜在依赖关系的图形模型。从完备数据集上学习贝叶斯网络是一个研究热点。分析了完备数据集上构建贝叶斯网的常见理论方法。     

Evolutionary Learning of Dynamic Naive Bayesian Classifiers

Many problems such as voice recognition, speech recognition and many other tasks have been tackled with Hidden Markov Models (HMMs). These problems can also be dealt with an extension of the Naive Bayesian Classifier (NBC) known as Dynamic NBC (DNBC). From a dynamic Bayesian network (DBN) perspective, in a DNBC at each time there is a NBC. NBCs work well in data sets with independent attributes. However, they perform poorly when the attributes are dependent or when there are one or more irrelevant attributes which are dependent of some relevant ones. Therefore, to increase this classifier accuracy, we need a method to design network structures that can capture the dependencies and get rid of irrelevant attributes. Furthermore, when we deal with dynamical processes there are temporal relations that should be considered in the network design. In order to learn automatically these models from data and increase the classifier accuracy we propose an evolutionary optimization algorithm to solve this design problem. We introduce a new encoding scheme and new genetic operators which are natural extensions of previously proposed encoding and operators for grouping problems. The design methodology is applied to solve the recognition problem for nine hand gestures. Experimental results show that the evolved network has higher average classification accuracy than the basic DNBC and a HMM.     

Fuzzy functional dependencies and Bayesian networks

Bayesian networks have become a popular technique for representing and reasoning with probabilistic information.The fuzzy functional dependency is an important kind of data dependencies in relational databases with fuzzy values,The purpose of this paper is to set up a connection between these data dependencies and Bayesian networks.The connection is done through a set of methods that enable pepople to obtain the most information of independent conditions from fuzzy functional dependencies.     

具有丢失数据的贝叶斯网络结构学习研究

目前主要基于EM算法和打分-搜索方法进行具有丢失数据的贝叶斯网络结构学习,算法效率较低,而且易于陷入局部最优结构.针对这些问题,建立了一种新的具有丢失数据的贝叶斯网络结构学习方法.首先随机初始化未观察到的数据,得到完整的数据集,并利用完整数据集建立最大似然树作为初始贝叶斯网络结构,然后进行迭代学习.在每一次迭代中,结合贝叶斯网络结构和Gibbs sampling修正未观察到的数据,在新的完整数据集的基础上,基于变量之间的基本依赖关系和依赖分析思想调整贝叶斯网络结构,直到结构趋于稳定.该方法既解决了标准Gi     

Constructing the Bayesian network structure from dependencies implied in multiple relational schemas

Relational models are the most common representation of structured data, and acyclic database theory is important in relational databases. In this paper, we propose the method for constructing the Bayesian network structure from dependencies implied in multiple relational schemas. Based on the acyclic database theory and its relationships with probabilistic networks, we are to construct the Bayesian network structure starting from implied independence information instead of mining database instances. We first give the method to find the maximum harmoniousness subset for the multi-valued dependencies on an acyclic schema, and thus the most information of conditional independencies can be retained. Further, aiming at multi-relational environments, we discuss the properties of join graphs of multiple 3NF database schemas, and thus the dependencies between separate relational schemas can be obtained. In addition, on the given cyclic join dependency, the transformation from cyclic to acyclic database schemas is proposed by virtue of finding a minimal acyclic augmentation. An applied example shows that our proposed methods are feasible.     

一种基于不完整数据的朴素贝叶斯分类器

贝叶斯网络因其对属性间因果关系的表达能力而成为处理不完整数据的强有力的工具。然而绝大多数的贝叶斯分类器都是基于完整数据的，并且在现实世界中数据往往是不完整的，因此利用不完整数据构建有效的贝叶斯分类器是一个重要而又具有挑战性的问题。 通过分析著名的基于不完整数据的RBC分类器的不足，在BC (Bound and Collapse)方法和EM算法的基础上给出了一种基于不完整数据的分类器构建方法。实验结果表明了该算法的有效性。     

Detection of surface defects on raw steel blocks using Bayesian network classifiers

This paper proposes an approach that detects surface defects with three-dimensional characteristics on scale-covered steel blocks. The surface reflection properties of the flawless surface changes strongly. Light sectioning is used to acquire the surface range data of the steel block. These sections are arbitrarily located within a range of a few millimeters due to vibrations of the steel block on the conveyor. After the recovery of the depth map, segments of the surface are classified according to a set of extracted features by means of Bayesian network classifiers. For establishing the structure of the Bayesian network, a floating search algorithm is applied, which achieves a good tradeoff between classification performance and computational efficiency for structure learning. This search algorithm enables conditional exclusions of previously added attributes and/or arcs from the network. The experiments show that the selective unrestricted Bayesian network classifier outperforms the naïve Bayes and the tree-augmented naïve Bayes decision rules concerning the classification rate. More than 98% of the surface segments have been classified correctly.     

Stock price forecast using Bayesian network

Bayesian network is a probabilistic graphical model that represents a set of random variables and their conditional dependencies via a directed acyclic graph. This paper describes the price earnings ratio (P/E ratio) forecast by using Bayesian network. Firstly, the use of clustering algorithm transforms the continuous P/E ratio to the set of digitized values. The Bayesian network for the P/E ratio forecast is determined from the set of the digitized values. NIKKEI stock average (NIKKEI225) and Toyota motor corporation stock price are considered as numerical examples. The results show that the forecast accuracy of the present algorithm is better than that of the traditional time-series forecast algorithms in comparison of their correlation coefficient and the root mean square error.     

小数据集的贝叶斯网络结构学习

针对直接基于小数据集贝叶斯网络结构学习不可靠, 以及目前对小数据集的处理只强调扩展而忽略对扩展数据的修正等, 提出了将扩展与修正相结合的小数据集处理机制, 以及在此基础上的基于结点排序和局部打分--搜索的贝叶斯网络结构学习方法. 可不需要完全结点顺序的先验知识, 但能够结合专家的部分结点顺序信息. 实验结果显示了这种方法的有效性和可靠性.