一种新的基于三角计算和K-means聚类的支持向量查找方法

Seyed Muhammad Hossein Mousavi, S. Mirinezhad, Atiye Mirmoini
{"title":"一种新的基于三角计算和K-means聚类的支持向量查找方法","authors":"Seyed Muhammad Hossein Mousavi, S. Mirinezhad, Atiye Mirmoini","doi":"10.1109/IKT.2017.8258617","DOIUrl":null,"url":null,"abstract":"Finding and determining best Support vector samples, play and important role in the accuracy and efficiency of classification process. Many support vector methods have been proposed, which each one has its pros and cons. In this paper, a new support vector finder method, based on triangle, has been presented, which finds support vectors based on triangular calculations, like calculating triangle angles, area and defining threshold for them. According to those thresholds, Support vectors for each class will be defined. At the end of the whole process, K-means clustering method takes place on the remaining samples. Note that K-means could happen before the main process. After finding support vectors, the result will be classified by classification algorithms like SVM, Least Squares and Linear discriminant analysis algorithms, in the binary mode, and the acquired results will be compared with original data. The acquired results are satisfactory, precise and comparable with the best support vector finder methods.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A new support vector finder method, based on triangular calculations and K-means clustering\",\"authors\":\"Seyed Muhammad Hossein Mousavi, S. Mirinezhad, Atiye Mirmoini\",\"doi\":\"10.1109/IKT.2017.8258617\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding and determining best Support vector samples, play and important role in the accuracy and efficiency of classification process. Many support vector methods have been proposed, which each one has its pros and cons. In this paper, a new support vector finder method, based on triangle, has been presented, which finds support vectors based on triangular calculations, like calculating triangle angles, area and defining threshold for them. According to those thresholds, Support vectors for each class will be defined. At the end of the whole process, K-means clustering method takes place on the remaining samples. Note that K-means could happen before the main process. After finding support vectors, the result will be classified by classification algorithms like SVM, Least Squares and Linear discriminant analysis algorithms, in the binary mode, and the acquired results will be compared with original data. The acquired results are satisfactory, precise and comparable with the best support vector finder methods.\",\"PeriodicalId\":338914,\"journal\":{\"name\":\"2017 9th International Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 9th International Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT.2017.8258617\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 9th International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT.2017.8258617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

寻找和确定最佳支持向量样本,对分类过程的准确性和效率起着至关重要的作用。目前已经提出了许多支持向量方法,每种方法都有其优缺点。本文提出了一种新的基于三角形的支持向量查找方法,该方法通过三角形计算来查找支持向量,如计算三角形的角度、面积和定义阈值。根据这些阈值,定义每个类的支持向量。在整个过程的最后,对剩余的样本进行K-means聚类。注意K-means可能发生在主进程之前。找到支持向量后,用SVM、最小二乘、线性判别分析等分类算法对结果进行二值化分类,并与原始数据进行比较。所得结果令人满意,精度高,可与最佳支持向量查找方法相媲美。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new support vector finder method, based on triangular calculations and K-means clustering
Finding and determining best Support vector samples, play and important role in the accuracy and efficiency of classification process. Many support vector methods have been proposed, which each one has its pros and cons. In this paper, a new support vector finder method, based on triangle, has been presented, which finds support vectors based on triangular calculations, like calculating triangle angles, area and defining threshold for them. According to those thresholds, Support vectors for each class will be defined. At the end of the whole process, K-means clustering method takes place on the remaining samples. Note that K-means could happen before the main process. After finding support vectors, the result will be classified by classification algorithms like SVM, Least Squares and Linear discriminant analysis algorithms, in the binary mode, and the acquired results will be compared with original data. The acquired results are satisfactory, precise and comparable with the best support vector finder methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信