节点文献

支持向量机文本分类算法的研究及其应用

Research and Application of Text Classification Algorithm Based on SVM

【作者】 吴鹏

【导师】 王秀坤;

【作者基本信息】 大连理工大学 , 计算机应用技术, 2009, 硕士

【摘要】 随着信息技术和信息网络的飞速发展,从大量数据中挖掘出有用知识的数据挖掘已成为具有重要意义的研究领域。支持向量机(support vector machine)是近年来在统计学习理论的基础上发展起来的一种新的模式识别方法,在解决小样本、非线性及高维模式识别问题中表现出许多特有的优势。虽然统计学习理论(SLT)有比较坚实的理论基础和严格的理论分析,但是其从理论到应用还有很多尚未得到充分研究和解决的问题。例如,目前该领域的相关研究大多是试图设计某种分类器,使其对未来所有可能样本的预期性能最优,而在很多实际问题中,没有可能也没有必要用这样一个分类器对所有可能的样本进行识别,而往往只需要对一些特定的样本进行识别。于是可以考虑设计这样一种更为经济的分类器,用它来建立一种直接从有标签样本出发对特定的无标签样本进行识别和分类的方法和原则。相对于传统的归纳推理方式,这种推理方式被称为直推式学习(transductive inference)。直推式学习试图根据已知样本对特定的未知样本建立一套进行识别的方法和准则。渐进直推式支持向量机学习算法(progressive transductive support vector machine,PTSVM)可以较好地适应各种不同的训练样本分布,实现了较一般意义上的直推式学习。本文针对PTSVM中的区域成对儿标注法学习过程不自然且易出错和标签重置法纠错能力不强的缺陷,提出了一种改进的基于Cache的渐进直推式支持向量机学习算法。该算法用值域成对儿标注法和Cache纠错法分别取代了PTSVM中的区域成对儿标注法和标签重置法,不仅大大减少了错误标记的次数,提高了算法的速度和准确度,而且消除了PTSVM算法的死循环现象。通过UCI的Wisconsin Breast cancer和CWH03a的Svmguide3两个数据集的实验,表明该算法是有效的。将本文改进的基于Cache的渐进直推式支持向量机学习算法应用于大连市公安局警务综合应用平台的全文检索系统,显著提高了信息检索的准确性,提高了工作效率。同时由于本文给出的系统的设计和实现方案具有通用性,对不同领域的检索系统的实现具有一定的指导意义。

【Abstract】 As the rapid development of information technology and information network, data mining from a large number of useful knowledge has become an important research area. SVM is a new learning method developed in recent years based on the foundations of statistical learning theory. It is gaining popularity due to many attractive features and promising empirical performance in the fields of nonlinear and high dimensional pattern recognition.Although statistical learning theory (SLT) has more solid theoretical foundation and rigorous theoretical analysis, there are still many problems to be fully studied and solved from theory to application. For example, current research in the field is trying to design some kind of classifier, which is expected to have superior optimal performance for all possible samples. But in many practical problems, it is not possible, and no need as well, to use such classifier to identify all samples, but often only some specific ones. This requires designing a more economical classifier, which has the ability to identify and classify specific unlabeled samples starting from labeled ones. Compared with traditional methods of inductive inference, it is so called transductive inference. TSVM (transductive support vector machine) takes into account a particular test set and tries to minimize misclassifications of just those particular examples. PTSVM (progressive transductive support vector machine) can automatically adapt to different data distributions and realize a transductive learning of support vectors in a more general sense. However, the process of pairwise labeling of PTSVM in the margin band is unnatural and products errors more easily. Although dynamical adjusting offers some sort of error recovery function, its ability is limited. In allusion to the shortcomings of PTSVM learning algorithm, ICPTSVM (an improved cache-based PTSVM) learning algorithm is presented. The algorithm uses pairwise labeling in the range and error-correcting on Cache to replace pairwise labeling in the margin band and dynamical adjusting. Then it not only greatly reduces the number of mis-labeling and improves the speed and accuracy, but also eliminate dead cycle of PTSVM learning algorithm. Through experimenting on the Wisconsin Breast cancer dataset of UCI and the Svmguide3 dataset of CWH03a. we have show that this algorithm is valid.In this paper, the improved Cache-based PTSVM learning algorithm is used in the full-text retrieval system of the general application platform of Dalian police. It significantly improves the accuracy of information retrieval and the work efficiency. At the same time, the system design and implementation in this paper is general, and so it has a certain guiding significance to implementation of retrieval system in different fields.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络