一种多类支持向量机概率建模新方法

在支持向量机多类分类问题输出概率建模中,提出了一种直接求解后验概率的概率建模新方法。在对多个两类支持向量机分类器的输出概率进行组合时,该方法充分考虑了各个两类支持向量机分类器的差异,并以后验概率作为各个两类支持向量机分类器的权系数。仿真图像的实验结果表明,该文提出的直接求解后验概率方法与投票法及Pairwise Coupling方法相比,不仅具有较好的分类性能,而且得到的后验概率具有较好的概率分布形态。     

基于证据理论的纠错输出编码解决多类分类问题

针对多类分类问题,利用纠错输出编码作为分解框架,把多类问题转化为多个二类问题加以解决;同时提出一种基于证据理论的解码策略,把每一个二分器的输出作为证据之一进行融合,并讨论在两种编码类型(二元和三元编码矩阵)下证据融合的不同策略.通过实验分别对UCI数据集和3种一维距离像数据集进行测试,并与几种经典的解码方法进行比较,验证了所提出的方法能有效提高纠错输出编码特别是三元编码矩阵的分类正确率.     

基于KNN模型的层次纠错输出编码算法

纠错输出编码是一种解决多类分类问题的有效方法,但其编码矩阵只对类进行编码且都采用事先构造出来的统一形式,适应性较差。为此,提出一种新颖的层次纠错输出编码算法。该算法在训练阶段先通过KNN模型算法在数据集上构建多个同类簇,选取各类中最具代表性的簇形成层次编码矩阵,然后再根据编码矩阵进行单分类器训练。在测试阶段,该算法通过模型融合进一步发挥KNN模型和纠错输出编码各自的优点。在UCI公共数据集上的实验结果表明,新方法的性能优于KNN模型算法和纠错输出编码算法。     

一种基于支持向量机的人脸识别新方法

关于人脸识别问题,采用一种基于独立分量分析进行特征提取和支持向量机实现多分类的人脸识别新方法.根据支持向量机理论,为提高对人脸的识别率,提出环形对称划分的支持向量机多分类算法.算法将多类问题的类别环形排列,依次进行对称划分构造纠错编码输出矩阵;根据求得的纠错编码输出矩阵,用解码函数求解待求样本的类别.对于人脸识别问题,利用独立分量分析方法构造人脸的特征脸空间,在特征脸空间运用算法进行人脸识别,在人脸数据库上的仿真结果表明,算法能有效地完成人脸识别任务.     

半监督层次纠错输出编码算法

纠错输出编码是一种处理多类分类问题的有效方法,但它只能用于有监督的数据,而对大量未标签样本却无法利用.提出一种新颖的基于半监督技术的层次编码算法,对传统的纠错输出编码算法(ECOC)进行改造,拓展了编码的概念.在编码阶段,根据簇特征进行同类组合后再进行层次编码,从而在充分利用了无标签样本的同时,根据数据类分布的特点进行编码以提高算法精度.最后在化工产品有毒性预测数据集上的实验结果表明了本方法的可行性和有效性.     

多进制概率角复合位编码量子进化算法

针对量子进化算法求解二进制编码问题比较有效,而求解多进制编码问题则比较困难的情况,本文提出了一种多进制概率角复合位编码量子进化算法.该算法将量子进化算法中量子位的概率幅表示法转化为复合位的概率角表示法,采用随机观测方法得到观测个体,采用概率角增减对个体进行更新.该算法适用于采用任意进制编码的问题.实验表明,与量子进化算法和传统遗传算法相比,多进制概率角复合位编码量子进化算法在适用范围、搜索能力和运算速度上具有较明显优势.     

基于子类划分和粒子群优化的自适应编码多类分类方法

纠错输出编码(ECOC)可以有效地解决多类分类问题.基于数据的编码是主要的编码方法之一.对此,提出一种基于子类划分和粒子群优化(PSO)的自适应编码方法,利用混淆矩阵衡量各类别的相关性,基于规则的方法对类别进行自适应组合,根据组合方案构建类别的二类划分并最终形成编码矩阵,通过引入PSO算法寻找最优阈值,从而得到最优编码矩阵.实验结果表明,所提出的编码方法可以得到更好的分类性能.     

带有随机丢包的空间关联系统的控制

研究当子系统之间信息传输存在随机丢包时空间关联系统的分析和设计问题. 通过引入空间移动算子和时间前向移动算子, 将关联系统建模为具有Markovian跳变参数的关于离散时间和空间变量的多维线性系统, 其中以Markovian跳变参数反映通信信道的状态, 得到整个关联系统在某一给定丢包率下适定且均方稳定的解析条件. 提出一种分布式动态输出反馈控制器的设计方法, 该控制器和被控对象具有相同的空间关联结构, 并基于线性矩阵不等式方法求解. 最后通过一个具有通信丢包影响的多机编队控制系统实例进一步阐明该模型及方法的正确性和有效性.     

基于置信度分析的人群密度等级分类模型

人群密度等级估计是智能人群监控的核心技术之一。其主要应用是统计监控图像或视频中指定监控区域内的人群密度量化等级。文中提出一种基于置信度分析的人群密度等级分类模型。首先设计基于二叉树分类思想的纠错输出编码,优化组合多个二分类器。然后提取置信样本,训练SVM二分类器。最后利用信道传输模型进行解码,依据后验概率最大法则得到样本所属的人群密度等级。该模型在样本集和特征相同的前提下分类正确率和泛化性能均优于传统分类模型,为以人群密度估计为代表的多类分类问题求解提供一种思路。     

基于纠错输出编码的人脸表情识别

多分类问题一直是模式识别领域的一个热点,提出了一种基于纠错输出编码和支持向量机的多分类器算法。根据通信编码理论设计纠错输出编码矩阵;按照该编码矩阵设计若干个互不相关的子支持向量机,根据编码原理将它们融合为一个多分类器。为了验证本分类器的有效性,采用Gabor小波提取人脸表情特征,应用二元主成分（2DPCA）分析法对提取的特征进行降维处理,应用该分类器进行了人脸表情的识别。实验结果表明,提出的方法能有效提高人脸表情的识别率,并具有极好的鲁棒性。     

Decoding design based on posterior probabilities in Ternary Error-Correcting Output Codes

Ternary Error-Correcting Output Codes (ECOC), which can unify most of the state-of-the-art decomposition frameworks such as one-versus-one, one-versus-all, sparse coding, dense coding, etc., is considered more flexible to model multiclass classification problems than Binary ECOC. Meanwhile, there are many corresponding decoding strategies that have been proposed for Ternary ECOC in earlier literatures. Note that there is few working by posterior probabilities, which can be considered as a Bayes decision rule and hence obtain a better performance in usual. Passerini et al. (2004) [16] have recently proposed a decoding strategy based on posterior probabilities. However, according to the analyses of this paper, Passerini et al.'s (2004) [16] method suffers some defects and result in bias. To overcome that, we proposed a variation of it by refining the decomposition process of probability to get smoother estimates. Our bias–variance analysis shows that the decrease in error by our variant is due to a decrease in variance. Besides, we extended an efficient method of obtaining posterior probabilities based on the linear rule for decoding process in Binary ECOC to Ternary ECOC. On ten benchmark datasets, we observe that the two decoding strategies based on posterior probabilities in this paper obtain better performance than other ones in earlier references.     

Holistic context models for visual recognition

A novel framework to context modeling based on the probability of co-occurrence of objects and scenes is proposed. The modeling is quite simple, and builds upon the availability of robust appearance classifiers. Images are represented by their posterior probabilities with respect to a set of contextual models, built upon the bag-of-features image representation, through two layers of probabilistic modeling. The first layer represents the image in a semantic space, where each dimension encodes an appearance-based posterior probability with respect to a concept. Due to the inherent ambiguity of classifying image patches, this representation suffers from a certain amount of contextual noise. The second layer enables robust inference in the presence of this noise by modeling the distribution of each concept in the semantic space. A thorough and systematic experimental evaluation of the proposed context modeling is presented. It is shown that it captures the contextual “gist” of natural images. Scene classification experiments show that contextual classifiers outperform their appearance-based counterparts, irrespective of the precise choice and accuracy of the latter. The effectiveness of the proposed approach to context modeling is further demonstrated through a comparison to existing approaches on scene classification and image retrieval, on benchmark data sets. In all cases, the proposed approach achieves superior results.     

具有间歇性观测的无线传感器网络分布式容错目标跟踪

针对具有随机间歇性观测的无线传感器网络, 基于多模型估计方法和一致性信息滤波器, 提出一种对观测节点故障容错的自适应分布式目标跟踪方法. 将传感器节点随机间歇性观测丢失和到达过程建模为马尔科夫切换系统, 在容积信息滤波器框架下, 估计传感器节点的观测丢失和到达的后验概率. 通过观测状态概率组合计算每个局部传感器节点的信息贡献, 基于自适应多模型估计方法, 实现对间歇性观测的容错性. 仿真结果表明了所提出算法的有效性和对间歇性观测的自适应容错性.

     

一种新高斯过程分类算法

由于需要利用高斯函数逼近潜变量函数的后验概率, 传统高斯过程分类算法通常都存在计算复杂度高的问题. 对此, 提出一种新高斯过程分类算法. 该算法的基本思想为: 首先, 利用Parzen 窗方法估计出每个训练样本的后验概率; 然后, 通过所得到的后验概率将原始分类问题变换为回归问题; 进而分析地得到潜变量函数后验概率的显式表达式, 以避免逼近后验概率所面临的高计算复杂度问题. 仿真实验结果表明, 所提出的算法在分类精度上优于已有的高斯过程分类算法.

     

Factored bilingual <Emphasis Type="Italic">n</Emphasis>-gram language models for statistical machine translation

In this work, we present an extension of n-gram-based translation models based on factored language models (FLMs). Translation units employed in the n-gram-based approach to statistical machine translation (SMT) are based on mappings of sequences of raw words, while translation model probabilities are estimated through standard language modeling of such bilingual units. Therefore, similar to other translation model approaches (phrase-based or hierarchical), the sparseness problem of the units being modeled leads to unreliable probability estimates, even under conditions where large bilingual corpora are available. In order to tackle this problem, we extend the n-gram-based approach to SMT by tightly integrating more general word representations, such as lemmas and morphological classes, and we use the flexible framework of FLMs to apply a number of different back-off techniques. In this work, we show that FLMs can also be successfully applied to translation modeling, yielding more robust probability estimates that integrate larger bilingual contexts during the translation process.     

Diagnosing multiple intermittent failures using maximum likelihood estimation

In fault diagnosis intermittent failure models are an important tool to adequately deal with realistic failure behavior. Current model-based diagnosis approaches account for the fact that a component cj may fail intermittently by introducing a parameter gj that expresses the probability the component exhibits correct behavior. This component parameter gj, in conjunction with a priori fault probability, is used in a Bayesian framework to compute the posterior fault candidate probabilities. Usually, information on gj is not known a priori. While proper estimation of gj can be critical to diagnostic accuracy, at present, only approximations have been proposed. We present a novel framework, coined Barinel, that computes estimations of the gj as integral part of the posterior candidate probability computation using a maximum likelihood estimation approach. Barinel's diagnostic performance is evaluated for both synthetic systems, the Siemens software diagnosis benchmark, as well as for real-world programs. Our results show that our approach is superior to reasoning approaches based on classical persistent failure models, as well as previously proposed intermittent failure models.     

基于音素评分模型的发音标准度评测研究

在计算机辅助语言学习系统中,后验概率是普通话水平测试(PSC)电子化系统衡量考生发音标准程度的重要指标,但后验概率与人工的主观评分存在着显著差别。该文提出了“音素评分模型”的思想,对后验概率进行变换。该文研究了线性和非线性的sigmoid音素评分模型,并发现线性音素评分模型有闭式全局最优解,非线性音素评分模型可用梯度下降法求解。在全国采集的498人的普通话考试现场数据集上的实验表明该策略能使系统评分性能有明显的提升 当后验概率在全音素概率空间中计算时,可使系统性能提升约42%;当后验概率在优化的概率空间中计算时,能使系统性能提升约23%～27%。     

New results on error correcting output codes of kernel machines

We study the problem of multiclass classification within the framework of error correcting output codes (ECOC) using margin-based binary classifiers. Specifically, we address two important open problems in this context: decoding and model selection. The decoding problem concerns how to map the outputs of the classifiers into class codewords. In this paper we introduce a new decoding function that combines the margins through an estimate of their class conditional probabilities. Concerning model selection, we present new theoretical results bounding the leave-one-out (LOO) error of ECOC of kernel machines, which can be used to tune kernel hyperparameters. We report experiments using support vector machines as the base binary classifiers, showing the advantage of the proposed decoding function over other functions of I he margin commonly used in practice. Moreover, our empirical evaluations on model selection indicate that the bound leads to good estimates of kernel parameters.     

自由表述口语语音评测后验概率估计改进方法

该文研究了两种用于改善深度神经网络声学建模框架下自由表述口语语音评测任务后验概率估计的方法: 1)使用RNN语言模型对一遍解码N-best候选做语言模型得分重估计来获得更准确的识别结果以重新估计后验概率;2)借鉴多语种神经网络训练框架,提出将方言数据聚类状态加入解码神经网络输出节点,在后验概率估计中引入方言似然度得分以评估方言程度的新方法。实验表明,这两种方法估计出的后验概率与人工分相关度分别绝对提升了3.5%和1.0%,两种方法融合后相关度绝对提升4.9%;对于一个真实的评测任务,结合该文改进的后验概率评分特征,总体评分相关度绝对提升2.2%。     

Online error correcting output codes

This article proposes a general extension of the error correcting output codes framework to the online learning scenario. As a result, the final classifier handles the addition of new classes independently of the base classifier used. In particular, this extension supports the use of both online example incremental and batch classifiers as base learners. The extension of the traditional problem independent codings one-versus-all and one-versus-one is introduced. Furthermore, two new codings are proposed, unbalanced online ECOC and a problem dependent online ECOC. This last online coding technique takes advantage of the problem data for minimizing the number of dichotomizers used in the ECOC framework while preserving a high accuracy. These techniques are validated on an online setting of 11 data sets from UCI database and applied to two real machine vision applications: traffic sign recognition and face recognition. As a result, the online ECOC techniques proposed provide a feasible and robust way for handling new classes using any base classifier.