Kalman filter and joint tracking and classification based on belief functions in the TBM framework

The paper develops an approach to joint tracking and classification based on belief functions as understood in the transferable belief model (TBM). The TBM model is identical to the classical model except all probability functions are replaced by belief functions, which are more flexible for representing uncertainty. It is felt that the tracking phase is well handled by the classical Kalman filter but that the classification phase deserves amelioration. For the tracking phase, we derive a minimal set of assumptions needed in the TBM approach in order to recover the classical relations. For the classification phase, we distinguish between the observed target behaviors and the underlying target classes which are usually not in one-to-one correspondence. We feel the results obtained with the TBM approach are more reasonable than those obtained with the corresponding Bayesian classifiers.     

基于情感词汇与机器学习的方面级情感分类

为综合利用基于情感词典和基于机器学习的两类情感分类方法的优点,提出一种基于情感词汇与机器学习的方面级情感分类方法。通过选取少量情感倾向与评价对象无关的情感词汇对评价搭配进行情感分类;通过构建机器学习分类器,以评价短语对各类别的互信息占比作为分类器的分类概率权重,进行加权计算,选择加权后分类概率最大的类别作为评价搭配的情感倾向类别。在中文评论数据集上的实验结果表明,该方法能有效提高情感分类性能。     

基于可传递信度模型的自适应k-NN分类器

针对训练模式类标签不精确的识别问题,提出了基于可传递信度模型(TBM)的自适应k-NN分类器,它通过运用pignistic变换,可以方便地对待识别模式真正所属的类做出决策,并通过梯度下降来最小化训练模式的输出类标签与目标类标签之间的误差函数,以实现参数的自适应学习.实验表明,该分类器用于处理训练模式类标签不精确的模式识别问题是有效的,且与参数优化前的基于TBM的k-NN分类器相比,其误分类率更低、鲁棒性更强.     

Using the conflict in Dempster–Shafer evidence theory as a rejection criterion in classifier output combination for 3D human action recognition

In this paper, we propose a comprehensive solution to 3D human action recognition including feature extraction, classification, and multiple classifier combination. We effectively present two feature extraction methods, four different types of well-known classifiers, and four multiple classifier combination strategies including a specially designed belief based method. In order to enhance the recognition accuracy, we propose a new rejection criterion based on the conflict from the information sources: the classifier outputs. We test our method on the MSRAction 3D dataset. Discarding examples using the conflict based criterion shows superior results than other combination approaches. Moreover this criterion allows choosing a tradeoff between the performance and rejection rate.     

A case-study on naïve labelling for the nearest mean and the linear discriminant classifiers

The abundance of unlabelled data alongside limited labelled data has provoked significant interest in semi-supervised learning methods. “Naïve labelling” refers to the following simple strategy for using unlabelled data in on-line classification. A new data point is first labelled by the current classifier and then added to the training set together with the assigned label. The classifier is updated before seeing the subsequent data point. Although the danger of a run-away classifier is obvious, versions of naïve labelling pervade in on-line adaptive learning. We study the asymptotic behaviour of naïve labelling in the case of two Gaussian classes and one variable. The analysis shows that if the classifier model assumes correctly the underlying distribution of the problem, naïve labelling will drive the parameters of the classifier towards their optimal values. However, if the model is not guessed correctly, the benefits are outweighed by the instability of the labelling strategy (run-away behaviour of the classifier). The results are based on exact calculations of the point of convergence, simulations, and experiments with 25 real data sets. The findings in our study are consistent with concerns about general use of unlabelled data, flagged up in the recent literature.     

一个基于模糊神经网络的模式分类系统

目前,基于神经网络的分类系统在许多领域得到了越来越广泛的应用。但是,该系统大多采用的是离线自适应机制,即神经网络需学习新的分类知识时,要重新训练神经网络,从而大大增加神经网络的训练时间;对于重叠分类,一般是构成一个贝叶斯分类器。然而,贝叶斯分类器的构成需要关于分类数据的概率密度函数的先验知识,而这些知识常常在模式分类前是难以获得的。为了解决这些问题,文中根据模糊集合理论,提出了一种基于模糊神经网络     

Windowed electroencephalographic signal classifier based on continuous neural networks with delays in the input

This study reports the design and implementation of a pattern recognition algorithm aimed to classify electroencephalographic (EEG) signals based on a class of dynamic neural networks (NN) described by time delay differential equations (TDNN). This kind of NN introduces the signal windowing process used in different pattern classification methods. The development of the classifier included a new set of learning laws that considered the impact of delayed information on the classifier structure. Both, the training and the validation processes were completely designed and evaluated in this study. The training method for this kind of NN was obtained by applying the Lyapunov theory stability analysis. The accuracy of training process was characterized in terms of the number of delays. A parallel structure (similar to an associative memory) with fixed (obtained after training) weights was used to execute the validation stage. Two methods were considered to validate the pattern classification method: a generalization-regularization and the k-fold cross validation processes (k = 5). Two different classes were considered: normal EEG and patients with previous confirmed neurological diagnosis. The first one contains the EEG signals from 100 healthy patients while the second contains information of epileptic seizures from the same number of patients. The pattern classification algorithm achieved a correct classification percentage of 92.12% using the information of the entire database. In comparison with similar pattern classification methods that considered the same database, the proposed CNN proved to achieve the same or even better correct classification results without pre-treating the EEG raw signal. This new type of classifier working in continuous time but using the delayed information of the input seems to be a reliable option to develop an accurate classification of windowed EEG signals.     

Low-Rank Bilinear Classification: Efficient Convex Optimization and Extensions

In pattern classification, it is needed to efficiently treat not only feature vectors but also feature matrices defined as two-way data, while preserving the two-way structure such as spatio-temporal relationships. The classifier for the feature matrix is generally formulated in a bilinear form composed of row and column weights which jointly result in a matrix weight. The rank of the matrix should be low from the viewpoint of generalization performance and computational cost. For that purpose, we propose a low-rank bilinear classifier based on the efficient convex optimization. In the proposed method, the classifier is optimized by minimizing the trace norm of the classifier (matrix) to reduce the rank without any hard constraint on it. We formulate the optimization problem in a tractable convex form and provide the procedure to solve it efficiently with the global optimum. In addition, we propose two novel extensions of the bilinear classifier in terms of multiple kernel learning and cross-modal learning. Through kernelizing the bilinear method, we naturally induce a novel multiple kernel learning. The method integrates both the inter kernels between heterogeneous reproducing kernel Hilbert spaces (RKHSs) and the ordinary kernels within respective RKHSs into a new discriminative kernel in a unified manner using the bilinear model. Besides, for cross-modal learning, we consider to map into the common space the multi-modal features which are subsequently classified in that space. We show that the projection and the classification are jointly represented by the bilinear model, and then propose the method to optimize both of them simultaneously in the bilinear framework. In the experiments on various visual classification tasks, the proposed methods exhibit favorable performances compared to the other methods.     

一种辅以强规则学习的双层文本分类模型

随着基于机器学习的文本自动分类方法成为主流分类技术,基于机器学习的文本分类方法往往忽视了对规则分类方法的有效运用。该文将基于规则的分类思想和基于机器学习的分类方法有机地结合起来,把规则判别看作一个分量分类器,提出了一种辅以规则补充的双层文本分类模型和一种优化的分类规则学习算法。根据该方法设计并实现了一个基于规则和N-Gram统计分类相结合的双层分类器,进行了双层分类模型与单独的N-Gram分类模型的实验,结果表明辅以规则补充的双层分类器具有更好的分类性能。     

Belief Combination of Classifiers for Incomplete Data

Data with missing values,or incomplete information,brings some challenges to the development of classification,as the incompleteness may significantly affect the performance of classifiers.In this paper,we handle missing values in both training and test sets with uncertainty and imprecision reasoning by proposing a new belief combination of classifier(BCC)method based on the evidence theory.The proposed BCC method aims to improve the classification performance of incomplete data by characterizing the uncertainty and imprecision brought by incompleteness.In BCC,different attributes are regarded as independent sources,and the collection of each attribute is considered as a subset.Then,multiple classifiers are trained with each subset independently and allow each observed attribute to provide a sub-classification result for the query pattern.Finally,these sub-classification results with different weights(discounting factors)are used to provide supplementary information to jointly determine the final classes of query patterns.The weights consist of two aspects:global and local.The global weight calculated by an optimization function is employed to represent the reliability of each classifier,and the local weight obtained by mining attribute distribution characteristics is used to quantify the importance of observed attributes to the pattern classification.Abundant comparative experiments including seven methods on twelve datasets are executed,demonstrating the out-performance of BCC over all baseline methods in terms of accuracy,precision,recall,F1 measure,with pertinent computational costs.     

Fuzzy min-max neural networks. I. Classification.

A supervised learning neural network classifier that utilizes fuzzy sets as pattern classes is described. Each fuzzy set is an aggregate (union) of fuzzy set hyperboxes. A fuzzy set hyperbox is an n-dimensional box defined by a min point and a max point with a corresponding membership function. The min-max points are determined using the fuzzy min-max learning algorithm, an expansion-contraction process that can learn nonlinear class boundaries in a single pass through the data and provides the ability to incorporate new and refine existing classes without retraining. The use of a fuzzy set approach to pattern classification inherently provides a degree of membership information that is extremely useful in higher-level decision making. The relationship between fuzzy sets and pattern classification is described. The fuzzy min-max classifier neural network implementation is explained, the learning and recall algorithms are outlined, and several examples of operation demonstrate the strong qualities of this new neural network classifier.     

基于改进的深度信念网络的入侵检测方法

针对传统入侵检测方法很难快速准确地从海量无标签网络数据中提取特征信息以识别异常入侵,提出了基于改进的深度信念网络的softmax分类（IDBN-SC）入侵检测方法。利用改进的DBN对原始网络数据进行无监督特征学习,引入自适应学习速率减少训练网络模型所需要的时间;采用softmax分类器对获得的降维数据进行网络攻击类型识别。在NSL-KDD数据集上进行测试,相比其他入侵检测方法,实验结果表明IDBN-SC方法不仅识别准确率平均提高3.02%,而且其softmax分类器训练时间平均缩短5.58 s。     

Diagnostic reasoning under conflicting data: the application of the transferable belief model

One of the issues in diagnostic reasoning is inferring about the location of a fault in cases where process data carry inconsistent or even conflicting evidence. This problem is treated in a systematic way by making use of the transferable belief model (TBM), which represents an approximate reasoning scheme derived from the Dempster–Shafer theory of evidence. The key novelty of TBM concerns the paradigm of the open world, which turns out to lead to a new means of assigning beliefs to anticipated fault candidates. Thus, instead of being ignored, inconsistency of data is displayed in a portion of belief that cannot be allocated to any of the suspected faults but rather to an unknown origin. This item of belief is referred to as the strength of conflict (SC). It is shown in this paper that SC can be interpreted as a degree of confidence in the diagnostic results, which seems to bring a new feature to diagnostic practice. The basics of TBM are reviewed in the paper and the implementation of the underlying ideas in the diagnostic reasoning context is presented. An important contribution concerns the extension of basic TBM reasoning from single observations to a batch of observations by employing the idea of discounting of evidence. The application of TBM to fault isolation in a gas–liquid separation process clearly shows that extended TBM significantly improves the performance of the diagnostic system compared to ordinary TBM as well as classical Boolean framework, especially as regards diagnostic stability and reliability.     

基于散度的网络流概念漂移分类方法

网络流量特征分布的动态变化产生概念漂移问题,造成基于机器学习的网络流量分类模型精度下降.定期更新分类模型耗时且无法保证分类模型的泛化能力.基于此,提出一种基于散度的网络流概念漂移分类方法(ensemble classification based on divergence detection, ECDD),采用双层窗口机制,从信息熵的角度出发,根据流量特征分布的JS散度,记为JSD(Jensen-Shannon divergence)来度量滑动窗口内数据分布的差异,从而检测概念漂移.借鉴增量集成学习的思想,检测到漂移时对于新样本重新训练出新的分类器,之后通过分类器权值排序,保留性能较高的分类器,加权集成分类结果对样本进行分类.抓取常见的网络应用流量,根据应用特征分布的不同构建概念漂移数据集,将该方法与常见的概念漂移检测方法进行实验对比,实验结果表明：该方法可以有效地检测概念漂移和更新分类器,表现出较好的分类性能.     

基于深度信念网络的文本分类算法

随着网络的迅猛发展,文本分类成为处理和组织大量文档数据的关键技术.目前已经有许多不同类型的神经网络应用于文本分类,并且取得良好的效果.但是,大部分模型仅采用文档的少量特征作为输入,没有考虑到足够的信息量;而当考虑到足够的特征时,又会发生维数灾难,导致模型难以训练或者训练时间大幅增加.利用深度信念网络从文本中抽取特征,并利用softmax回归分类器对抽取后的特征分类.深度信念网络不仅具有强大的学习能力,同时还能从高维的原始特征中抽取低维度高度可区分的低维特征,因此利用深度信念网络来对文本分类,不仅能够考虑到文档的足够的信息量,而且能够快速的训练.并且实验结果也表明利用深度信念网络实现文本分类的性能很好.     

Regularized margin-based conditional log-likelihood loss for prototype learning

The classification performance of nearest prototype classifiers largely relies on the prototype learning algorithm. The minimum classification error (MCE) method and the soft nearest prototype classifier (SNPC) method are two important algorithms using misclassification loss. This paper proposes a new prototype learning algorithm based on the conditional log-likelihood loss (CLL), which is based on the discriminative model called log-likelihood of margin (LOGM). A regularization term is added to avoid over-fitting in training as well as to maximize the hypothesis margin. The CLL in the LOGM algorithm is a convex function of margin, and so, shows better convergence than the MCE. In addition, we show the effects of distance metric learning with both prototype-dependent weighting and prototype-independent weighting. Our empirical study on the benchmark datasets demonstrates that the LOGM algorithm yields higher classification accuracies than the MCE, generalized learning vector quantization (GLVQ), soft nearest prototype classifier (SNPC) and the robust soft learning vector quantization (RSLVQ), and moreover, the LOGM with prototype-dependent weighting achieves comparable accuracies to the support vector machine (SVM) classifier.     

稀疏自编码和Softmax回归的快速高效特征学习

针对特征学习效果与时间平衡问题,提出了一种快速高效的特征学习方法.将稀疏自编码和Softmax回归组合成一个新的特征提取模型,在提取原始图像潜在信息的基础上,利用多分类器返回值可以反映输入信息的相似程度的特点,快速高效的学习利于分类的特征向量.鉴于标签信息已知,该算法在图像分类效果上明显优于几种典型的特征学习方法.为了使所提算法具有更好的泛化能力,回归模型的损失函数中加入了L2范数防止过拟合,同时,采用随机梯度下降的方法得到模型的最优参数.在4个标准数据集上的测试结果表明该算法是有效可行的.     

基于语义理解和机器学习的混合的中文文本情感分类算法框架

快速、准确和全面地从大量互联网文本信息中定位情感倾向是当前大数据技术领域面临的一大挑战.文本情感分类方法大致分为基于语义理解和基于有监督的机器学习两类.语义理解处理情感分类的优势在于其对不同领域的文本都可以进行情感分类,但容易受到中文存在的不同句式及搭配的影响,分类精度不高.有监督的机器学习虽然能够达到比较高的情感分类精度,但在一个领域方面得到较高分类能力的分类器不适应新领域的情感分类.在使用信息增益对高维文本做特征降维的基础上,将优化的语义理解和机器学习相结合,设计了一种新的混合语义理解的机器学习中文情感分类算法框架.基于该框架的多组对比实验验证了文本信息在不同领域中高且稳定的分类精度.     

An Artificial Neural Network Classifier Design Based-on Variable Kernel and Non-Parametric Density Estimation

This paper proposes a probabilistic variant of the SOM-kMER (Self Organising Map-kernel-based Maximum Entropy learning Rule) model for data classification. The classifier, known as pSOM-kMER (probabilistic SOM-kMER), is able to operate in a probabilistic environment and to implement the principles of statistical decision theory in undertaking classification problems. A distinctive feature of pSOM-kMER is its ability in revealing the underlying structure of data. In addition, the Receptive Field (RF) regions generated can be used for variable kernel and non-parametric density estimation. Empirical evaluation using benchmark datasets shows that pSOM-kMER is able to achieve good performance as compared with those from a number of machine learning systems. The applicability of the proposed model as a useful data classifier is also demonstrated with a real-world medical data classification problem.     

基于堆叠模型的司法短文本多标签分类

司法文书短文本的语义多样性和特征稀疏性等特点,对短文本多标签分类精度提出了很大的挑战,传统单一模型的分类算法已无法满足业务需求.为此,提出一种融合深度学习与堆叠模型的多标签分类方法.该方法将分类器划分成两个层次,第一层使用BERT、卷积神经网络、门限循环单元等深度学习方法作为基础分类器,每个基础分类器模型通过K折交叉验...