Classification of multi-class microarray datasets using a minimizing class-overlapping based ECOC algorithm

Haiyue Yu, Kunhong Liu
{"title":"Classification of multi-class microarray datasets using a minimizing class-overlapping based ECOC algorithm","authors":"Haiyue Yu, Kunhong Liu","doi":"10.1145/3035012.3035018","DOIUrl":null,"url":null,"abstract":"The classification of multi-class microarray datasets is much more difficult compared with the binary datasets because the former usually consist of unbalanced data with a smaller sample size in each class. Our paper focuses on the multi-class problem, and proposes a new method based on a class-overlapping measure, named as Minimum Class-Overlapping Error-Correcting Output Codes (MCO-ECOC). In this algorithm, important variables are selected through different filter methods firstly. Then, the class overlapping is measured in training sets, the algorithm searches all class splitting schemes, and select the one minimizing the class-overlapping measure. Each column of the coding matrix represents such a splitting scheme. And then all the coding matrixs are combined by eliminating the redundant columns to make the final ensemble system compact. Neural networks are used as binary classifiers. MCO-ECOC algorithm is applied to classify the different multi-class microarray datasets, and the output of each base learner are fused to produce the final decision based on the Hamming distance. The experimental results show that the performance of MCO-ECOC is significantly higher than those obtained by DECOC and Forest ECOC.","PeriodicalId":130142,"journal":{"name":"Proceedings of the 5th International Conference on Bioinformatics and Computational Biology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th International Conference on Bioinformatics and Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3035012.3035018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

The classification of multi-class microarray datasets is much more difficult compared with the binary datasets because the former usually consist of unbalanced data with a smaller sample size in each class. Our paper focuses on the multi-class problem, and proposes a new method based on a class-overlapping measure, named as Minimum Class-Overlapping Error-Correcting Output Codes (MCO-ECOC). In this algorithm, important variables are selected through different filter methods firstly. Then, the class overlapping is measured in training sets, the algorithm searches all class splitting schemes, and select the one minimizing the class-overlapping measure. Each column of the coding matrix represents such a splitting scheme. And then all the coding matrixs are combined by eliminating the redundant columns to make the final ensemble system compact. Neural networks are used as binary classifiers. MCO-ECOC algorithm is applied to classify the different multi-class microarray datasets, and the output of each base learner are fused to produce the final decision based on the Hamming distance. The experimental results show that the performance of MCO-ECOC is significantly higher than those obtained by DECOC and Forest ECOC.
基于最小化类重叠的ECOC算法的多类微阵列数据集分类
与二值数据集相比,多类微阵列数据集的分类要困难得多,因为多类微阵列数据集通常由不平衡数据组成,每一类数据的样本量较小。针对多类问题,提出了一种基于类重叠度量的最小类重叠纠错输出码(MCO-ECOC)方法。该算法首先通过不同的滤波方法选择重要变量;然后,在训练集上测量类的重叠度,算法搜索所有的类拆分方案,选择类重叠度最小的方案;编码矩阵的每一列表示这样一种分割方案。然后通过消除冗余列对所有编码矩阵进行组合,使最终的集成系统更加紧凑。神经网络被用作二值分类器。采用MCO-ECOC算法对不同的多类微阵列数据集进行分类,并融合各基学习器的输出,产生基于汉明距离的最终决策。实验结果表明,MCO-ECOC的性能明显高于DECOC和Forest ECOC。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信