基于最优核优化感知器的改进OMKC算法

Bingjie Cheng, Shangping Zhong
{"title":"基于最优核优化感知器的改进OMKC算法","authors":"Bingjie Cheng, Shangping Zhong","doi":"10.1109/ICITEC.2014.7105612","DOIUrl":null,"url":null,"abstract":"Online Multiple Kernel Classification (OMKC) algorithm has been a popular method for exploring effective online combination of multiple kernel classifiers. The framework for OMKC is commonly obtained by learning multiple kernel classifiers and simultaneously their linear combination. However, the traditional perceptron algorithm which OMKC algorithm bases on does not achieve a much smaller mistake rate. In this paper, we put forward a novel algorithm based on OMKC using an improved perceptron algorithm. Our perceptron algorithm is applied with the best kernel. The algorithm produces an online validation procedure to search for the best kernel among the pool of kernels using the first 10% training examples. By using histograms analysis, our proposed algorithm can achieve smaller mistake rate and less time consuming. Extensive experimental results on twelve data sets demonstrate the effectiveness and efficiency of our algorithm.","PeriodicalId":293382,"journal":{"name":"Proceedings of 2nd International Conference on Information Technology and Electronic Commerce","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An improved algorithm of OMKC based on the optimized perceptron with the best kernel\",\"authors\":\"Bingjie Cheng, Shangping Zhong\",\"doi\":\"10.1109/ICITEC.2014.7105612\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online Multiple Kernel Classification (OMKC) algorithm has been a popular method for exploring effective online combination of multiple kernel classifiers. The framework for OMKC is commonly obtained by learning multiple kernel classifiers and simultaneously their linear combination. However, the traditional perceptron algorithm which OMKC algorithm bases on does not achieve a much smaller mistake rate. In this paper, we put forward a novel algorithm based on OMKC using an improved perceptron algorithm. Our perceptron algorithm is applied with the best kernel. The algorithm produces an online validation procedure to search for the best kernel among the pool of kernels using the first 10% training examples. By using histograms analysis, our proposed algorithm can achieve smaller mistake rate and less time consuming. Extensive experimental results on twelve data sets demonstrate the effectiveness and efficiency of our algorithm.\",\"PeriodicalId\":293382,\"journal\":{\"name\":\"Proceedings of 2nd International Conference on Information Technology and Electronic Commerce\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2nd International Conference on Information Technology and Electronic Commerce\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITEC.2014.7105612\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2nd International Conference on Information Technology and Electronic Commerce","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITEC.2014.7105612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在线多核分类(OMKC)算法是探索多核分类器在线有效组合的一种流行方法。OMKC的框架通常是通过学习多个核分类器并同时学习它们的线性组合来获得的。然而,基于OMKC算法的传统感知器算法并没有实现更小的错误率。本文提出了一种基于OMKC的改进感知机算法。我们的感知器算法应用于最佳核。该算法生成一个在线验证过程,使用前10%的训练样例在核池中搜索最佳核。通过使用直方图分析,我们提出的算法可以实现更小的错误率和更少的时间消耗。在12个数据集上的大量实验结果证明了该算法的有效性和高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved algorithm of OMKC based on the optimized perceptron with the best kernel
Online Multiple Kernel Classification (OMKC) algorithm has been a popular method for exploring effective online combination of multiple kernel classifiers. The framework for OMKC is commonly obtained by learning multiple kernel classifiers and simultaneously their linear combination. However, the traditional perceptron algorithm which OMKC algorithm bases on does not achieve a much smaller mistake rate. In this paper, we put forward a novel algorithm based on OMKC using an improved perceptron algorithm. Our perceptron algorithm is applied with the best kernel. The algorithm produces an online validation procedure to search for the best kernel among the pool of kernels using the first 10% training examples. By using histograms analysis, our proposed algorithm can achieve smaller mistake rate and less time consuming. Extensive experimental results on twelve data sets demonstrate the effectiveness and efficiency of our algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An user behavior credibility authentication model in cloud computing environment An region of interest based video compression for indoor surveillance A fast proof generating system for verifying cloud search A modified eigenvalue-based cooperative spectrum sensing algorithm Privacy protection beyond encryption for cloud big data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1