Improved Data Classification using Fuzzy Euclidean Hyperbox Classifier

Chandrashekhar Azad, A. Mehta, V. Jha
{"title":"Improved Data Classification using Fuzzy Euclidean Hyperbox Classifier","authors":"Chandrashekhar Azad, A. Mehta, V. Jha","doi":"10.1109/ICSCEE.2018.8538389","DOIUrl":null,"url":null,"abstract":"In this paper, a modification to the simple fuzzy min-max classifier has been proposed. The primary objective was the design of an efficient classifier that can be used in a wide range of application domains, unlike most prior works which focus on selected problems. This work retains the fuzzy neural structure of the original work but proposes a different membership function for the hyperboxes based on the Euclidean distance measure. The new function takes into consideration the centroids of the hyperboxes and not just the min and max points. The competence of the proposed classifier is tested on kinds of datasets. Further, a novel approach in which the classifier can also handle partly labeled data (or data with missing labels) is also discussed. One of the most important requisites of any classification algorithm is its efficiency. In the result-driven technological world of today, where mobile computing is a major thrust area, simple and elegant solutions are highly sought. Thus speed and efficiency were major considerations in the choice of the classifier for the classification system designed.","PeriodicalId":265737,"journal":{"name":"2018 International Conference on Smart Computing and Electronic Enterprise (ICSCEE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Smart Computing and Electronic Enterprise (ICSCEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCEE.2018.8538389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, a modification to the simple fuzzy min-max classifier has been proposed. The primary objective was the design of an efficient classifier that can be used in a wide range of application domains, unlike most prior works which focus on selected problems. This work retains the fuzzy neural structure of the original work but proposes a different membership function for the hyperboxes based on the Euclidean distance measure. The new function takes into consideration the centroids of the hyperboxes and not just the min and max points. The competence of the proposed classifier is tested on kinds of datasets. Further, a novel approach in which the classifier can also handle partly labeled data (or data with missing labels) is also discussed. One of the most important requisites of any classification algorithm is its efficiency. In the result-driven technological world of today, where mobile computing is a major thrust area, simple and elegant solutions are highly sought. Thus speed and efficiency were major considerations in the choice of the classifier for the classification system designed.
基于模糊欧几里得超盒分类器的改进数据分类
本文提出了一种对简单模糊最小最大分类器的改进。主要目标是设计一个有效的分类器,可以在广泛的应用领域中使用,不像大多数先前的工作,专注于选择的问题。本工作保留了原始工作的模糊神经结构,但提出了基于欧几里得距离度量的超盒的不同隶属函数。新函数考虑了超框的质心,而不仅仅是最小和最大点。在不同的数据集上测试了所提出的分类器的能力。此外,还讨论了一种分类器也可以处理部分标记数据(或缺少标签的数据)的新方法。任何分类算法的一个最重要的条件是它的效率。在今天以结果为导向的技术世界中,移动计算是一个主要的推力领域,人们高度寻求简单而优雅的解决方案。因此,在设计分类系统时,速度和效率是选择分类器的主要考虑因素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信