Outlier robust fuzzy active learning method (ALM)

S. H. Klidbary, S. Shouraki, A. Ghaffari, Soroush Sheikhpour Kourabbaslou
{"title":"Outlier robust fuzzy active learning method (ALM)","authors":"S. H. Klidbary, S. Shouraki, A. Ghaffari, Soroush Sheikhpour Kourabbaslou","doi":"10.1109/ICCKE.2017.8167903","DOIUrl":null,"url":null,"abstract":"Active Learning Method (ALM) is a fuzzy learning method and is inspired by the approach of human's brain toward understanding complicated problems. In this algorithm, a Multi-Input Single-Output system is modeled by some Single-Input Single-Output sub-systems. Each sub-model tries to capture the input-output relationship of each sub-system on a plane called IDS plane. The output of the original system is then approximated by fuzzy aggregation of the output of all submodels. The most important step in ALM, though, is to choose an appropriate radius for ink drop spread, to achieve desirable result. In this paper, a novel method, based on the idea of K-Nearest Neighbor (KNN) algorithm, is proposed to locally choose appropriate radius for ink drop spread according to the density of the data points in each region of the IDS plane. It will be shown that by this criterion, not only the sparsity of data points in different regions of the dataset is taken into account, but also the algorithm will be equipped with the capability to identify and filter out the outliers. The mathematical analysis of this method is provided to confirm its validity and simulations were conducted on various datasets in order to evaluate its efficiency.","PeriodicalId":151934,"journal":{"name":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 7th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2017.8167903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Active Learning Method (ALM) is a fuzzy learning method and is inspired by the approach of human's brain toward understanding complicated problems. In this algorithm, a Multi-Input Single-Output system is modeled by some Single-Input Single-Output sub-systems. Each sub-model tries to capture the input-output relationship of each sub-system on a plane called IDS plane. The output of the original system is then approximated by fuzzy aggregation of the output of all submodels. The most important step in ALM, though, is to choose an appropriate radius for ink drop spread, to achieve desirable result. In this paper, a novel method, based on the idea of K-Nearest Neighbor (KNN) algorithm, is proposed to locally choose appropriate radius for ink drop spread according to the density of the data points in each region of the IDS plane. It will be shown that by this criterion, not only the sparsity of data points in different regions of the dataset is taken into account, but also the algorithm will be equipped with the capability to identify and filter out the outliers. The mathematical analysis of this method is provided to confirm its validity and simulations were conducted on various datasets in order to evaluate its efficiency.
异常鲁棒模糊主动学习方法(ALM)
主动学习方法(ALM)是一种模糊学习方法,其灵感来源于人类大脑理解复杂问题的方法。在该算法中,多输入单输出系统由一些单输入单输出子系统来建模。每个子模型试图在一个称为IDS平面的平面上捕获每个子系统的输入-输出关系。然后通过对所有子模型的输出进行模糊聚合来近似原始系统的输出。然而,在ALM中最重要的一步是选择合适的墨滴扩散半径,以达到理想的效果。本文提出了一种基于k -最近邻(KNN)算法的方法,根据IDS平面各区域的数据点密度,局部选择合适的墨滴扩散半径。通过该准则,不仅考虑了数据集不同区域的数据点的稀疏性,而且该算法将具有识别和过滤异常值的能力。对该方法进行了数学分析以验证其有效性,并在不同数据集上进行了仿真以评价其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信