多分类器系统的泛组合规则研究与应用

现有的多分类器系统采用固定的组合算子,适用性较差。将泛逻辑的柔性化思想引入多分类器系统中,应用泛组合运算模型建立了泛组合规则。泛组合规则采用遗传算法进行参数估计,对并行结构的多分类器系统具有良好的适用性。在时间序列数据集上的分类实验结果表明,泛组合规则的分类性能优于乘积规则、均值规则、中值规则、最大规则、最小规则、投票规则等固定组合规则。     

基于零级N/T泛数完整簇的概率逻辑算子的研究

在人工智能中不确定性理论、主观Bayes方法、证据理论等都是基于概率论的.但是,这些不确定性推理方法仅仅是基于概率,而不能真正实现逻辑框架内的概率逻辑不确定推理,产生这种现象的主要原因是概率逻辑自身存在着缺陷.按照泛逻辑学的生成规则,基于零级N/T/S范数完整簇从泛逻辑学的角度来构造概率逻辑算子.结果表明概率逻辑是能够在泛逻辑学的框架内进行柔性化的,是命题泛逻辑在h=0.75时的一种特例.     

基于粗糙集约简的多分类器系统构造方法

多分类器系统是近年来兴起的一种有效的分类机制,为提高多分类器系统的分类精度,提出了一种基于粗糙集约简构造多分类器系统的机制,并从输入和输出两个角度对如何选择单个分类器进行了探讨。通过对4个UCI数据集进行验证,发现基于输出的选择融合方法得到了最好的分类效果。     

基于Schweizer算子簇的柔性概率逻辑算子的研究

Schweizer算子簇是泛逻辑学研究零级非相容T/S范数完整簇的数学基础,由它构造的与/或运算具有连续单调可变性.基于Schweizer算子簇构造的概率逻辑算子,既可满足概率测度的基本公理,又可实现概率逻辑运算的连续单调可变.     

泛逻辑学理论——机制主义人工智能理论的逻辑基础

当前，世界各主要大国都把人工智能作为它们的国家战略。人工智能的发展正在快速改变着人类的生活方式和思想观念。在中国，有一小批研究者20多年来一直在基于辩证唯物主义潜心研究具有普适性的人工智能基础理论，包括智能的形成机制、逻辑基础、数学基础、协调机理、矛盾转化等。终于，他们各自建立了机制主义人工智能理论、泛逻辑学理论、因素空间理论、协调学、可拓学、集对分析等。其中，机制主义人工智能理论是基于智能形成机制的通用理论，它能把现有的结构主义、功能主义和行为主义三大流派有机地统一起来，使意识、情感、理智成为三位一体的关系；因素空间理论是机制主义人工智能理论的数学基础；泛逻辑学理论是机制主义人工智能理论的逻辑基础。本文介绍了泛逻辑学理论的基本思想、理论基础和应用方法，阐明它的理论意义和应用价值。特别需要指出的是，在广义概率论基础上建立的命题泛逻辑（包括刚性逻辑和柔性逻辑），可看成一个完整的命题级智能信息处理算子库，库中完整地包含了全部18种柔性信息处理模式（包括16种布尔信息处理模式），可用类型编码<a,b,e>来严格区分，用它可寻找到适合自己的信息处理算子完整簇来使用。在每一个信息处理模式中，各种不确定性的组合状态由不确定性程度属性编码<k,h,β,e>来严格区分，用它可在本信息处理模式的算子完整簇中精确选择具体的算子来使用。这表明柔性信息处理本质上是一把密码锁，它需要专门的密码<a,b,e>+<k,h,β,e>才能正常打开，不能乱点鸳鸯谱。通过只有18种模式，每种模式可以从最大算子连续变化到最小算子，已经证明了没有一个命题算子被遗漏。     

基于格图像的康托集分维与泛逻辑运算

对康托集的研究一直是分形领域的经典而又热点的课题。本文尝试用一种新的模式——“格图像”来研究康托集的分形特性,给出了康托集的格图像构造与分形维数计算方法,计算表明：康托集的自相似分维是格图像分维的特例,格图像分维是自相似分维的扩展。文章首次在分形领域引入泛逻辑的概念,给出了基于格图像的康托集的泛逻辑“与,或,非”运算模型,它不仅考虑了集合的代数列度大小。而且考虑了在参考格中的几何位置关系,这给分形图像的研究提供了一种新的思路,同时也拓展了泛逻辑学的应用领域。     

知识进化算法及其在关联分类中的应用

针对传统的关联分类算法在构造分类器的过程中需要多次遍历数据集从而消耗大量的计算、存储资源的问题,该文提出了一种基于知识进化算法的分类规则构造方法。该方法首先对数据集中的数据进行编码;然后利用猜测与反驳算子从编码后的数据中提取出猜测知识和反面知识;接着对提取出来的猜测知识进行覆盖度、正确度的计算,并根据不断变化的统计数据利用萃取算子将猜测知识与反面知识进行合理的转换。当得到的知识集中的知识的覆盖度达到预设的阈值时,该数据集中的知识被用来生成分类器进行分类。该方法分块读入待分类的数据集,极大地减少了遍历数据集的次数,明显减少了系统所需的存储空间,提高了分类器的构造效率。实验结果表明,该方法可行、有效,在保证分类精度的前提下,较好地解决了关联分类器构造低效、费时的问题。     

泛逻辑学的蕴涵性质

蕴涵算子是逻辑学研究中的重点和难点。本文首先给出泛逻辑中的一级命题连接词完整簇的非、交、并和蕴涵运算模型,证明了泛蕴涵的正则性、单调性以及它和泛“交”的伴随性,这对于进一步研究泛逻辑的形式系统和代数结构以及完备性,都具有重要的理论价值。     

泛α表,泛β表及相应关系表达式的理论

本文提出了泛α表，泛β表的概念，给出了由单调关系表达式的构造泛α表的规则，由泛关系表达式构造泛β表的规则。同时，讨论了相应的理论。     

泛模糊逻辑控制器研究

文章在总结模糊逻辑控制器一般结构的基础上,采用泛逻辑算子簇柔化了模糊推理操作,从而提出了一种新型的变结构模糊逻辑控制器———泛模糊逻辑控制器,同时使用具有自适应学习率的模糊神经网络BP算法进行训练,可据不同控制对象来确定合适的控制结构。仿真结果表明,该方法是有效的。     

Building ensemble classifiers using belief functions and OWA operators

A pervasive task in many forms of human activity is classification. Recent interest in the classification process has focused on ensemble classifier systems. These types of systems are based on a paradigm of combining the outputs of a number of individual classifiers. In this paper we propose a new approach for obtaining the final output of ensemble classifiers. The method presented here uses the Dempster–Shafer concept of belief functions to represent the confidence in the outputs of the individual classifiers. The combing of the outputs of the individual classifiers is based on an aggregation process which can be seen as a fusion of the Dempster rule of combination with a generalized form of OWA operator. The use of the OWA operator provides an added degree of flexibility in expressing the way the aggregation of the individual classifiers is performed.     

Aggregation of classifiers based on image transformations in biometric face recognition

In this study, we investigate the use of collective knowledge of independent classifiers (experts) in the area of face recognition. We formulate a hypothesis and provide compelling experimental evidence behind it that different image transformations can offer unique discriminatory information useful for face classification. We show that such discriminatory information can be combined in order to increase classification rates over those being produced by individual classifiers. In particular, we focus on contrast enhancement realized by histogram equalization and edge detection carried out with the use of the Sobel operator. We construct feature spaces emerging from linear and nonlinear methods of dimensionality reduction, namely Eigenfaces, Fisherfaces, kernel-PCA, and Isomap. Aggregation of classifiers is accomplished by majority voting and a Bayesian product rule. Extensive experimentation is conducted using the well-known FERET and YALE datasets.     

基于三角模融合算子的指纹图像分割方法

针对指纹图像提出了一种基于三角模融合算子的图像分割算法。该方法使用方向性和对比度两个信息分别作为两个分类器的特征，并求出各分类器的判决信度，利用三角模融合算子将两个分类器的结果进行融合判决。该方法具有较高的稳健性和精确度。最后给出的实验结果验证了算法的有效性。     

A genetic encoding approach for learning methods for combining classifiers

Several studies have reported that the ensemble of classifiers can improve the performance of a stand-alone classifier. In this paper, we propose a learning method for combining the predictions of a set of classifiers.The method described in this paper uses a genetic-based version of the correspondence analysis for combining classifiers. The correspondence analysis is based on the orthonormal representation of the labels assigned to the patterns by a pool of classifiers. In this paper instead of the orthonormal representation we use a pool of representations obtained by a genetic algorithm. Each single representation is used to train a different classifiers, these classifiers are combined by vote rule.The performance improvement with respect to other learning-based fusion methods is validated through experiments with several benchmark datasets.     

Brain signal-based safety measure activation for robotic systems

In this paper, we present our approach for using EEG signals to activate safety measures of a robot when an error or unexpected event is perceived by the human operator. In particular, we consider brain-based error perception while the operator passively observes the robot performing an action. Our approach consists of monitoring EEG signals and detecting a brain potential called error related negativity (ERN) that spontaneously occurs when the operator perceives an error made by the robot or when an unexpected event occurs. We detect ERN by pre-training two linear classifiers using data collected from a preliminary experiment based on a visual reaction task. We derive the probability of failure in demand (PFD), commonly used to assess functional safety for a two-channel verification system based on the combination of linear classifiers. Functional safety analysis was then performed on a BMI-based robotic framework in which a signal was sent to the robot to active its safety measures in when an ERN was detected. Using brain-based signals, we demonstrate that it is possible to send an emergency stop action during mobile navigation task when unexpected events occur with an accuracy of 75%.     

Statistical approaches to combining binary classifiers for multi-class classification

One of the popular methods for multi-class classification is to combine binary classifiers. In this paper, we propose a new approach for combining binary classifiers. Our method trains a combining method of binary classifiers using statistical techniques such as penalized logistic regression, stacking, and a sparsity promoting penalty. Our approach has several advantages. Firstly, our method outperforms existing methods even if the base classifiers are well-tuned. Secondly, an estimate of conditional probability for each class can be naturally obtained. Furthermore, we propose selecting relevant binary classifiers by adding the group lasso type penalty in training the combining method.     

基于多分类器集成的手写体金融汉字识别

用基于遗传算法的全局优化技术动态地选择一组分类器,并根据应用的背景,采用合适的集成规则进行集成,从而综合了不同分类器的优势和互补性,提高了分类性能。实验结果表明,通过将遗传算法引入到多分类器集成系统的设计过程,其分类性能明显优于传统的单分类器的分类方法。     

谓词形式系统(A)UL-h∈[0.75,1]及其可靠性

对基于一级泛与运算的一阶谓词演算形式系统(A)UL-h∈[0.75,1]进行公理化.通过引入全称量词和存在量词,建立与命题形式系统(A)UL-h∈[0.75,1]相对应的一阶谓词形式系统V(A)UL-h∈[0.75,1]并证明该系统的可靠性定理及演绎定理.     

Finding a short and accurate decision rule in disjunctive normal form by exhaustive search

Greedy approaches suffer from a restricted search space which could lead to suboptimal classifiers in terms of performance and classifier size. This study discusses exhaustive search as an alternative to greedy search for learning short and accurate decision rules. The Exhaustive Procedure for LOgic-Rule Extraction (EXPLORE) algorithm is presented, to induce decision rules in disjunctive normal form (DNF) in a systematic and efficient manner. We propose a method based on subsumption to reduce the number of values considered for instantiation in the literals, by taking into account the relational operator without loss of performance. Furthermore, we describe a branch-and-bound approach that makes optimal use of user-defined performance constraints. To improve the generalizability we use a validation set to determine the optimal length of the DNF rule. The performance and size of the DNF rules induced by EXPLORE are compared to those of eight well-known rule learners. Our results show that an exhaustive approach to rule learning in DNF results in significantly smaller classifiers than those of the other rule learners, while securing comparable or even better performance. Clearly, exhaustive search is computer-intensive and may not always be feasible. Nevertheless, based on this study, we believe that exhaustive search should be considered an alternative for greedy search in many problems.