基于关联规则的人事档案信息资源分类方法

针对当前方法无法准确分析信息特征关系,导致信息资源分类结果的准确率较低的问题,提出了基于关联规则的人事档案信息资源分类方法.利用信息增益,提取待分类信息特征,以信息增益差值为基础,建立评估函数.将特征到对应类别中心的距离作为关联规则,实现信息间内在关系的深层挖掘,通过确定项集并采用训练的方式,完成对人事档案信息资源的分类.实验结果表明,所提方法的分类结果具有较高的可靠性,且在不同的最小支持度下,均可实现精准的资源分类.     

基于灰关系与信息增益融合的文本分类模型

针对信息增益模型在文本分类中的不足之处,提出了一种基于灰关系与信息增益的文本分类算法.首先基于改进的χ2统计进行类别特征选择用于类内文本表示,提高类别中心向量的表示能力;其次针对IG模型对低频词赋权过大问题,提出了基于频数和位置的改进加权方法;最后提出了基于灰关系的文本相似度计算途径,改善了基于距离的相似度计算模式的不足.试验表明,此算法提高了文本分类效率.     

一种基于频繁模式的时间序列分类框架

如何提取和选择时间序列的特征是时间序列分类领域两个重要的问题。该文提出MNOE(Mining Non- Overlap Episode)算法计算时间序列中的非重叠频繁模式,并将其作为时间序列特征。基于这些非重叠频繁模式,该文提出EGMAMC(Episode Generated Mixed memory Aggregation Markov Chain)模型描述时间序列。根据似然比检验原理,从理论上推导出频繁模式在时间序列中出现的次数和EGMAMC模型是否能显著描述时间序列之间的关系;根据信息增益定义,选择能显著描述时间序列的频繁模式作为时间序列特征输入分类模型。在UCI (University of California Irvine)公共数据集和实际智能楼宇数据集上的实验表明,选择频繁模式作为特征进行分类的准确率、召回率和F-Measure均优于不选择频繁模式作为特征的分类结果。高效的计算和有效的选择非重叠频繁模式作为时间序列特征有助于提高时间序列分类模型的各项评价指标。     

一种基于滑动窗口模型的数据流加权频繁模式挖掘方法

相对于传统的频繁模式挖掘,加权频繁模式挖掘能发现更有价值的模式信息.针对数据流中的数据只能一次扫描,本文提出了一种基于滑动窗口模型的数据流加权频繁模式挖掘方法WFP-SW(Sliding Window based Weighted Frequent Pattern minig),算法采用WE-tree(Weighted Enumeration Tree)存储模式和事务信息,利用虚权支持度维持模式的向下闭合特性,同时获取临界频繁模式.对临界频繁模式进一步计算其加权支持度获取加权频繁模式,使得计算更新模式更加便捷.实验结果显示算法具有较高的挖掘效率并且所需的内存更少.     

基于信息增益改进贝叶斯模型的汉语词义消歧

词义消歧一直是自然语言处理领域的关键问题和难点之一。通常把词义消歧作为模式分类问题进行研究,其中特征选择是一个重要的环节。该文根据贝叶斯假设提出基于信息增益的特征选择方法,并以此改进贝叶斯模型。通过信息增益计算,挖掘上下文中词语的位置信息,提高贝叶斯模型知识获取的效率,从而改善词义分类效果。该文在8个歧义词上进行了实验,结果发现改进后的贝叶斯模型在消歧正确率上比改进前平均提高了3.5个百分点,改进幅度较大,效果突出,证明了该方法的有效性。     

特征加权支持向量机

该文针对现有的加权支持向量机(WSVM)和模糊支持向量机(FSVM)只考虑样本重要性而没有考虑特征重要性对分类结果的影响的缺陷,提出了基于特征加权的支持向量机方法,即特征加权支持向量机(FWSVM)。该方法首先利用信息增益计算各个特征对分类任务的重要度,然后用获得的特征重要度对核函数中的内积和欧氏距离进行加权计算,从而避免了核函数的计算被一些弱相关或不相关的特征所支配。理论分析和数值实验的结果都表明,该方法比传统的SVM具有更好的鲁棒性和分类能力。     

基于回溯的最大频繁项集挖掘算法

针对Apriori类算法多次扫描数据库和FP-tree类算法需要构建大量条件模式树的问题,文中提出了挖掘最大频繁项集的GBMFI算法。采用垂直格式存储事务数据库,以枚举树为基础,利用子集非频繁性质和父子节点支持度信息在搜索过程中对枚举树进行剪枝,最终得到最大频繁项集。通过实验对比,结果证明了算法的有效性,尤其适用于稀疏数据集。     

多径信道下MPSK信号的调制分类算法

针对多径信道中MPSK信号的调制分类问题,提出一种新的基于小波变换的分类算法.算法所用的小波变换相位信息特征对平坦衰落信道具有衰落不变性,对频率选择性衰落信道也具有很强的抗多径能力.与已有方法相比,新算法极大地降低了对多径信道冲激响应模式的限制,更具有普适性.理论分析和计算机仿真试验都证明了新分类算法的稳健性和有效性.     

基于矩阵的最大频繁模式挖掘及其更新算法

提出了一种基于矩阵的挖掘最大频繁模式的算法(FPA),只需扫描数据集一遍,不生成候选项目集。在实际应用中用户经常需要调整最小支持度阀值获得信息,为此,提出了更新挖掘算法(UFPA)。实验结果表明,这两个算法具有很好性能。     

图数据中频繁模式挖掘算法研究综述

 本文对图数据中的频繁模式挖掘算法进行了综述.依据算法的特性和数学基础对算法进行了分类,主要集中于算法的求解思想和不同算法之间的关系的比较,并对一些著名的算法进行了详细的分析和讨论.基于算法的特性,比较了各种算法适用的范围以及应用领域.最后,讨论了频繁模式挖掘的最新进展及未来的研究方向.     

Feature discovering for image classification via wavelet-like pattern decomposition

In this paper, we propose a feature discovering method incorporated with a wavelet-like pattern decomposition strategy to address the image classification problem. In each level, we design a discriminative feature discovering dictionary learning (DFDDL) model to exploit the representative visual samples from each class and further decompose the commonality and individuality visual patterns simultaneously. The representative samples reflect the discriminative visual cues per class, which are beneficial for the classification task. Furthermore, the commonality visual elements capture the communal visual patterns across all classes. Meanwhile, the class-specific discriminative information can be collected by the learned individuality visual elements. To further discover the more discriminative feature information from each class, we then integrate the DFDDL into a wavelet-like hierarchical architecture. Due to the designed hierarchical strategy, the discriminative power of feature representation can be promoted. In the experiment, the effectiveness of proposed method is verified on the challenging public datasets.     

Robust discriminative broad learning system for hyperspectral image classification

With the advantages of simple structure and fast training speed, broad learning system (BLS) has attracted attention in hyperspectral images (HSIs). However, BLS cannot make good use of the discriminative information contained in HSI, which limits the classification performance of BLS. In this paper, we propose a robust discriminative broad learning system (RDBLS). For the HSI classification, RDBLS introduces the total scatter matrix to construct a new loss function to participate in the training of BLS, and at the same time minimizes the feature distance within a class and maximizes the feature distance between classes, so as to improve the discriminative ability of BLS features. RDBLS inherits the advantages of the BLS, and to a certain extent, it solves the problem of insufficient learning in the limited HSI samples. The classification results of RDBLS are verified on three HSI datasets and are superior to other comparison methods.     

Discriminative metric design for robust pattern recognition

Motivated by the development of discriminative feature extraction (DFE), many researchers have come to realize the importance of designing a front-end feature extraction unit with an appropriate link to backend classification. This paper proposes an advanced formalization of DFE, which we call the discriminative metric design (DMD), and elaborates on its exemplar implementation by using a simple, linear feature transformation matrix. The resulting DMD implementation is shown to have a close relationship to various discriminative pattern recognizers, including artificial neural networks. The utility of the proposed method is clearly demonstrated in speech pattern recognition experiments     

Network application profiling with traffic causality graphs

A network application profiling framework is proposed that is based on traffic causality graphs (TCGs), representing temporal and spatial causality of flows to identify application programs. The proposed framework consists of three modules: the feature vector space construction using discriminative patterns extracted from TCGs by a graph‐mining algorithm; a feature vector supervised learning procedure in the constructed vector space; and an application identification program using a similarity measure in the feature vector space. Accuracy of the proposed framework for application identification is evaluated, making use of ground truth packet traces from seven peer‐to‐peer (P2P) application programs. It is demonstrated that this framework achieves an overall 90.0% accuracy in application identification. Contributions are twofold: (1) using a graph‐mining algorithm, the proposed framework enables automatic extraction of discriminative patterns serving as identification features; 2) high accuracy in application identification is achieved, notably for P2P applications that are more difficult to identify because of their using random ports and potential communication encryption. Copyright © 2014 John Wiley & Sons, Ltd.     

Joint feature representation and classification via adaptive graph semi-supervised nonnegative matrix factorization

As an effective feature representation method, non-negative matrix factorization (NMF) cannot utilize the label information sufficiently, which makes it not be suitable for the classification task. In this paper, we propose a joint feature representation and classification framework named adaptive graph semi-supervised nonnegative matrix factorization (AGSSNMF). Firstly, to enhance the discriminative ability of feature representation and accomplish the classification task, a regression model with nonnegative matrix factorization (called as RNMF) is proposed, which exploits the relation between the label information and feature representation. Secondly, to overcome the drawback of insufficient labels, an adaptive graph-based label propagation (refereed as AGLP) model is established, which adopts a local constraint to reflect the local structure of data. Then, we integrate RNMF and AGLP into a unified framework for feature representation and classification. Finally, an iterative optimization algorithm is used to solve the objective function. Extensive experiments show that the proposed framework has excellent performance compared with some well-known methods.     

Histopathological image classification through discriminative feature learning and mutual information-based multi-channel joint sparse representation

Histopathological image classification is a very challenging task because of the biological heterogeneities and rich geometrical structures. In this paper, we propose a novel histopathological image classification framework, which includes the discriminative feature learning and the mutual information-based multi-channel joint sparse representation. We first propose a stack-based discriminative prediction sparse decomposition (SDPSD) model by incorporating the class labels information to predict deep discriminant features automatically. Subsequently, a mutual information-based multi-channel joint sparse model (MIMCJSM) is presented to jointly encode the common component and particular components of the discriminative features. Especially, the main advantage of the MIMCJSM is the construction of a joint dictionary using a mutual information criterion, which contains a common sub-dictionary and three particular sub-dictionaries. Based on the joint dictionary, the MIMCJSM captures the relationship of multi-channel features, which can improve discriminative ability of joint sparse representation coefficients. Finally, the joint sparse representation coefficients of different levels can be aggregated using the spatial pyramid matching (SPM) model, and the linear support vector machine (SVM) is used as the classifier. Experimental results on ADL and BreaKHis datasets demonstrate that our proposed framework consistently performs better than popular existing classification frameworks. Additionally, it can show promising strong-robustness performance for histopathological image classification.     

基于视点差异和多分类器的三维模型分类

基于视图的3维模型分类方法与深度学习融合能有效提升模型分类的准确率。但目前的方法将相同类别的3维模型所有视点上的视图归为一类,忽略了不同视点上的视图差异,导致分类器很难学习到一个合理的分类面。为解决这一问题,该文提出一个基于深度神经网络的3维模型分类方法。该方法在3维模型的周围均匀设置多个视点组,为每个视点组训练1个视图分类器,充分挖掘不同视点组下的3维模型深度信息。这些分类器共享1个特征提取网络,但却有各自的分类网络。为了使提取的视图特征具有区分性,在特征提取网络中加入注意力机制;为了对非本视点组的视图建模,在分类网络中增加了附加类。在分类阶段首先提出一个视图选择策略,从大量视图中选择少量视图用于分类,以提高分类效率。然后提出一个分类策略通过分类视图实现可靠的3维模型分类。在ModelNet10和ModelNet40上的实验结果表明,该方法在仅用3张视图的情况下分类准确率高达93.6%和91.0%。     

面向目标再辨识的空间和通道双重显著性挖掘算法

现有的目标再辨识方法常用全局特征池化层来聚合深度骨干网络所提取的特征映射以得到最终的图像特征。但是,全局特征池化层忽视了特征映射在空间和通道上的显著性,会限制所得图像特征的鉴别能力。为此,本文设计一个新颖的空间和通道双重显著性挖掘（Spatial Channel Dual Significance Mining, SC-DSM）模块,用于同时从空间和通道两个维度上充分挖掘特征映射的显著性,从而改善所得图像特征的鉴别能力,以提升目标再辨识的准确性。SC-DSM模块包含空间显著性挖掘子模块和通道显著性挖掘子模块。其中,空间显著性挖掘子模块在特征映射上构建空间图,聚合空间维度上的邻居节点特征并学习权重,实现空间显著性挖掘;通道显著性挖掘子模块在特征映射建立通道图聚合通道维度上的邻居节点并学习权重,实现通道显著性挖掘。实验结果表明,在目前最流行的车辆再辨识数据库VeRi776和行人再辨识数据库Market-1501上,所提出的方法能够优于现有的目标再辨识方法。      

Classification of sport videos using edge-based features and autoassociative neural network models

In this paper, we propose a method for classification of sport videos using edge-based features, namely edge direction histogram and edge intensity histogram. We demonstrate that these features provide discriminative information useful for classification of sport videos, by considering five sports categories, namely, cricket, football, tennis, basketball and volleyball. The ability of autoassociative neural network (AANN) models to capture the distribution of feature vectors is exploited, to develop class-specific models using edge-based features. We show that combining evidence from complementary edge features results in improved classification performance. Also, combination of evidence from different classifiers like AANN, hidden Markov model (HMM) and support vector machine (SVM) helps improve the classification performance. Finally, the performance of the classification system is examined for test videos which do not belong to any of the above five categories. A low rate of misclassification error for these test videos validates the effectiveness of edge-based features and AANN models for video classification.     

Hybrid IMM/SVM approach for wavelet-domain probabilistic model based texture classification

The Fisher kernel method was recently proposed to incorporate probabilistic (generative) models and discriminative methods for pattern recognition. This method uses parameter derivatives of log-likelihood calculated from probabilistic model(s), Fisher scores, to generate statistical feature vectors. It is followed by discriminative classifiers such as the support vector machine (SVM) for classification. In this work, the authors study the potential of the Fisher kernel method on texture classification. A hybrid system of independent mixture model (IMM) and SVM is introduced to extract and classify statistical texture features in the wavelet-domain. Compared to existing methods that apply Bayesian classification based on wavelet domain energy signatures and stand alone IMM, the new hybrid IMM/SVM method is able to achieve superior performance. Experimental results are presented to demonstrate the effectiveness of this proposed method.