Rot-SiLA: A Novel Ensemble Classification Approach Based on Rotation Forest and Similarity Learning Using Nearest Neighbor Algorithm

Muhammad Shaheryar, M. Khalid, A. M. Qamar
{"title":"Rot-SiLA: A Novel Ensemble Classification Approach Based on Rotation Forest and Similarity Learning Using Nearest Neighbor Algorithm","authors":"Muhammad Shaheryar, M. Khalid, A. M. Qamar","doi":"10.1109/ICMLA.2013.16","DOIUrl":null,"url":null,"abstract":"Recent years have seen a great inclination towards Machine Learning classification and researchers are thinking in terms of achieving accuracy and correctness. Many studied have proved that an ensemble of classifiers outperform individual ones in terms of accuracy. Qamar et al. have developed a Similarity Learning Algorithm (SiLA) based on a combination of k nearest neighbor algorithm and Voted Perceptron. This approach is different from other state of the art algorithms in the sense that it learns appropriate similarity metrics rather than distance-based ones for all types of datasets i.e. textual as well as non-textual. In this paper, we present a novel ensemble classifier Rot-SiLA which is developed by combining Rotation Forest algorithm and SiLA. The Rot-SiLA ensemble classifier is built upon two types of approaches, one based on standard kNN and another based on symmetric kNN (SkNN), just as was the case with SiLA algorithm. It has been observed that Rot-SiLA ensemble outperforms other variants of the Rotation Forest ensemble as well as SiLA significantly when experiments were conducted with 14 UCI repository data sets. The significance of the results was determined by s-test.","PeriodicalId":168867,"journal":{"name":"2013 12th International Conference on Machine Learning and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 12th International Conference on Machine Learning and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA.2013.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Recent years have seen a great inclination towards Machine Learning classification and researchers are thinking in terms of achieving accuracy and correctness. Many studied have proved that an ensemble of classifiers outperform individual ones in terms of accuracy. Qamar et al. have developed a Similarity Learning Algorithm (SiLA) based on a combination of k nearest neighbor algorithm and Voted Perceptron. This approach is different from other state of the art algorithms in the sense that it learns appropriate similarity metrics rather than distance-based ones for all types of datasets i.e. textual as well as non-textual. In this paper, we present a novel ensemble classifier Rot-SiLA which is developed by combining Rotation Forest algorithm and SiLA. The Rot-SiLA ensemble classifier is built upon two types of approaches, one based on standard kNN and another based on symmetric kNN (SkNN), just as was the case with SiLA algorithm. It has been observed that Rot-SiLA ensemble outperforms other variants of the Rotation Forest ensemble as well as SiLA significantly when experiments were conducted with 14 UCI repository data sets. The significance of the results was determined by s-test.
Rot-SiLA:一种基于旋转森林和最近邻算法相似性学习的集成分类方法
近年来,人们对机器学习分类有了很大的兴趣,研究人员正在从实现准确性和正确性的角度进行思考。许多研究已经证明,在准确率方面,分类器的集合优于单个分类器。Qamar等人基于k近邻算法和投票感知器的组合开发了一种相似学习算法(SiLA)。这种方法与其他先进算法的不同之处在于,它为所有类型的数据集(即文本和非文本)学习适当的相似性度量,而不是基于距离的度量。本文提出了一种新的集成分类器Rot-SiLA,该分类器将旋转森林算法与SiLA算法相结合。Rot-SiLA集成分类器建立在两种方法之上,一种基于标准kNN,另一种基于对称kNN (SkNN),就像SiLA算法的情况一样。在对14个UCI存储库数据集进行实验时,已经观察到Rot-SiLA集成明显优于旋转森林集成的其他变体以及SiLA。结果的显著性采用s检验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信