On the design of an ECOC-Compliant Genetic Algorithm

Genetic Algorithms (GA) have been previously applied to Error-Correcting Output Codes (ECOC) in state-of-the-art works in order to find a suitable coding matrix. Nevertheless, none of the presented techniques directly take into account the properties of the ECOC matrix. As a result the considered search space is unnecessarily large. In this paper, a novel Genetic strategy to optimize the ECOC coding step is presented. This novel strategy redefines the usual crossover and mutation operators in order to take into account the theoretical properties of the ECOC framework. Thus, it reduces the search space and lets the algorithm to converge faster. In addition, a novel operator that is able to enlarge the code in a smart way is introduced. The novel methodology is tested on several UCI datasets and four challenging computer vision problems. Furthermore, the analysis of the results done in terms of performance, code length and number of Support Vectors shows that the optimization process is able to find very efficient codes, in terms of the trade-off between classification performance and the number of classifiers. Finally, classification performance per dichotomizer results shows that the novel proposal is able to obtain similar or even better results while defining a more compact number of dichotomies and SVs compared to state-of-the-art approaches.     

k-NN classification of handwritten characters via accelerated GAT correlation

This paper addresses the problem of reinforcing the ability of the k-NN classification of handwritten characters via distortion-tolerant template matching techniques with a limited quantity of data. We compare three kinds of matching techniques: the conventional simple correlation, the tangent distance, and the global affine transformation (GAT) correlation. Although the k-NN classification method is straightforward and powerful, it consumes a lot of time. Therefore, to reduce the computational cost of matching in k-NN classification, we propose accelerating the GAT correlation method by reformulating its computational model and adopting efficient lookup tables. Recognition experiments performed on the IPTP CDROM1B handwritten numerical database show that the matching techniques of the simple correlation, the tangent distance, and the accelerated GAT correlation achieved recognition rates of 97.07%, 97.50%, and 98.70%, respectively. The computation time ratios of the tangent distance and the accelerated GAT correlation to the simple correlation are 26.3 and 36.5 to 1.0, respectively.     

Using ontology-based text classification to assist Job Hazard Analysis

The dangers of the construction industry due to the risk of fatal hazards, such as falling from extreme heights, being struck by heavy equipment or materials, and the possibility of electrocution, are well known. The concept of Job Hazard Analysis is commonly used to mitigate and control these occupational hazards. This technique analyzes the major tasks in a construction activity, identifies all potential task-related hazards, and suggests safe approaches to reduce or avoid each of these hazards. In this paper, the authors explore the possibility of leveraging existing construction safety resources to assist JHA, aiming to reduce the level of human effort required. Specifically, the authors apply ontology-based text classification (TC) to match safe approaches identified in existing resources with unsafe scenarios. These safe approaches can serve as initial references and enrich the solution space when performing JHA. Various document modification strategies are applied to existing resources in order to achieve superior TC effectiveness. The end result of this research is a construction safety domain ontology and its underlying knowledge base. A user scenario is also discussed to demonstrate how the ontology supports JHA in practice.     

基于特征融合的核量化图像分类方法

局部特征和全局特征是图像的两种重要的特征描述,在图像分类时起着至关重要的作用。据此提出一种通过融合全局与局部特征核量化图像分类方法。首先,分析全局特征及局部特征各自优缺点,并对图像进行特征提取;其次,通过核方法将特征映射到适当的高维空间中,来进行码书的获取与量化,并进行特征的融合以更好地对图像进行描述;最后,采用基于直方图交叉核的支持向量机对获取的量化特征进行分类。通过实验证明了所提出的方法的可行性。     

面向增量同生主题的维吾尔文爬虫的研究

针对传统的主题爬虫对网页信息缺乏在知识层面上的处理和理解的问题进行了研究,提出了一种面向增量同生主题的维吾尔文爬虫,通过建立一个增量主题词库优化传统的主题模型,来描述维吾尔文关键词的应用语境及场景,提高了计算网页相关度的准确率。用改进的IC主题敏感算法来预测子页面优先级,过滤无关的网页地址。依据上述方法编写爬虫系统,用构建的维吾尔文语料库进行实验,表明了基于此模型的爬虫具有更好的稳定性和准确度。     

文本分类中训练集相关数量指标的影响研究

针对训练集对分类性能的影响,从训练集的文本数、类别数以及特征项数这三项数量指标出发进行研究。使用多因素方差分析方法及多种语料库定量探讨该三项数量指标对分类性能的影响规律。结果发现特征项数对分类性能的影响在不同的文本数和类别数时是不同的,分类性能受训练集的这三项指标的交互影响,通过对训练集的这三项指标进行优化,提出了从分类算法、特征项选择法以外提高分类性能的途径。在真实数据上的实验结果表明,该方法可有效提高分类性能。     

一种快速的判别公共向量分类方法

在传统DCV的基础上,提出了一种改进的快速DCV分类方法。该方法与传统的DCV分类方法相比,在保证识别率相同的情况下具有较快的分类速率。传统的DCV分类方法通过计算特征向量之间的距离来进行分类,而所提快速DCV分类方法则通过标量计算完成分类。理论分析及复杂度计算表明,快速DCV分类方法的分类速率是传统DCV分类方法的2倍左右,在Yale、ORL和PIE 3种人脸数据库得到的对比仿真实验结果验证了该算法的有效性。     

改进贝叶斯分类的智能短信分类方法

随着移动通信技术的不断发展,手机的普及率在不断上升,而短信作为传统的移动通信服务,长久以来一直在人们的日常生活中占据着极为重要的位置。可以说,短信在一定程度上记录了人们生活的轨迹。但是,现有的短信管理系统仅对短信进行以联系人为特征分类、以时间为顺序显示的简单非智能化的管理,导致了用户手机中各类短信混杂不清,短信的管理效率极低。通过研究短信的特征,分析传统的基于文档频率的特征值提取方法和基于互信息的特征值提取方法的优势与不足,提出了一种适用于短信的基于词频和互信息的特征值提取方法,并结合短信长度实现了一种改进的贝叶斯分类算法。实验证明,算法在进行短信分类时可以得到相当可观的召回率和准确率。     

基于混合PSO的高斯混合模型地形分类

提出了一种基于改进的混合粒子群优化(particle swarm optimization,PSO)算法的高斯混合模型地形分类方法。高斯混合模型的求解通常是使用期望最大化算法(expectation maximization,EM),然而EM算法易陷入局部最优,收敛速度不稳定且对初值敏感。因此引入混合PSO算法,并对其进行了一系列改进。实验结果表明:改进后的算法较其它优化算法提高了全局搜索能力和收敛速度,利用该算法求解高斯混合模型可以提高参数估计的精度,并且在户外场景图像的地形分类实验中所提出的地形分类方法也表现优良。     

基于区间直觉模糊的情感分类模型

随着电子商务,个人博客,社交网站和微博的蓬勃发展,互联网进入了一个崭新的时代,而在线评论的情感分类关系到个人决策、企业管理甚至社会安全．提出了一种基于区间直觉模糊的情感分类模型,采用了区间直觉模糊算子来计算特征词的区间直觉模糊数,利用区间直觉模糊集的隶属度、非隶属度和犹豫度分别定量地描述特征词,通过情感合成确定文本的情感倾向,从而获得准确率较高的情感倾向性分析结果．最后通过相同语料库的比较实验证明该分类模型的可行性、正确性和较高的分类性能．