A Hybrid Text Classification Method Based on K-Congener-Nearest-Neighbors and Hypersphere Support Vector Machine

Y. H. Chen, Y. F. Zheng, J. Pan, N. Yang
{"title":"A Hybrid Text Classification Method Based on K-Congener-Nearest-Neighbors and Hypersphere Support Vector Machine","authors":"Y. H. Chen, Y. F. Zheng, J. Pan, N. Yang","doi":"10.1109/ITA.2013.120","DOIUrl":null,"url":null,"abstract":"Our work implements a novel text classifier by combining k congener nearest neighbors-Support Vector Machine(KCNN-SVM) with hyper sphere Support Vector Machine(hyper sphere-SVM) training algorithm. Hyper plane Support Vector Machine has been widely used to divide the samples into two equal categories. However, the hyper sphere Support Vector Machine can not only separate the samples, but also divide them into two different parts. Since the probability inside and outside the hyper sphere is not same, hyper sphere-SVM is helpful to the classification when the datasets are imbalanced that we can control the radius of hyper sphere to get higher accuracy. The KCNN-SVM algorithm distinguishes a sample with its nearest neighbor's category label as well as the average distance between it and its k nearest same kind of neighbors which can enhance the accuracy when the samples are chaotic imbalanced. In this paper, we propose the hyper sphere-KCNN-SVM(HS-KCNN-SVM) hybrid approach which can validly improve the classification accuracy especially for those chaotic imbalanced samples.","PeriodicalId":285687,"journal":{"name":"2013 International Conference on Information Technology and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2013.120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Our work implements a novel text classifier by combining k congener nearest neighbors-Support Vector Machine(KCNN-SVM) with hyper sphere Support Vector Machine(hyper sphere-SVM) training algorithm. Hyper plane Support Vector Machine has been widely used to divide the samples into two equal categories. However, the hyper sphere Support Vector Machine can not only separate the samples, but also divide them into two different parts. Since the probability inside and outside the hyper sphere is not same, hyper sphere-SVM is helpful to the classification when the datasets are imbalanced that we can control the radius of hyper sphere to get higher accuracy. The KCNN-SVM algorithm distinguishes a sample with its nearest neighbor's category label as well as the average distance between it and its k nearest same kind of neighbors which can enhance the accuracy when the samples are chaotic imbalanced. In this paper, we propose the hyper sphere-KCNN-SVM(HS-KCNN-SVM) hybrid approach which can validly improve the classification accuracy especially for those chaotic imbalanced samples.
基于k -收敛近邻和超球支持向量机的混合文本分类方法
本文将k近邻支持向量机(KCNN-SVM)与超球面支持向量机(hyper sphere- svm)训练算法相结合,实现了一种新的文本分类器。超平面支持向量机被广泛用于将样本划分为两个相等的类别。然而,超球面支持向量机不仅可以分离样本,而且可以将样本分成两个不同的部分。由于超球内外概率不相同,超球支持向量机有助于数据集不平衡时的分类,我们可以控制超球半径以获得更高的精度。KCNN-SVM算法通过样本最近邻的类别标签以及与k个最近邻的同类邻居的平均距离来区分样本,可以提高样本混沌不平衡时的准确率。本文提出了超球- kcnn - svm (HS-KCNN-SVM)混合方法,可以有效地提高分类精度,特别是对混沌不平衡样本的分类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信