Fuzzy Clustering of Incomplete Data by Means of Similarity Measures

Zhengbing Hu, Yevgeniy V. Bodyanskiy, O. Tyshchenko, A. Shafronenko
{"title":"Fuzzy Clustering of Incomplete Data by Means of Similarity Measures","authors":"Zhengbing Hu, Yevgeniy V. Bodyanskiy, O. Tyshchenko, A. Shafronenko","doi":"10.1109/UKRCON.2019.8879844","DOIUrl":null,"url":null,"abstract":"The current standing in the scope of Data Mining considers clustering to be one of the most useful and widely used tools. Multiple real-world datasets usually contain drops/gaps in the data due to various reasons. The currently known approaches are highly efficient only in those cases when original datasets do not change their volumes during the analysis. However, up-to-date problems mostly deal with sequential online data processing. On the other hand, there is no prior knowledge on which feature vectors contain overlooks. In this manuscript, the challenge of possibilistic and probabilistic online clustering approaches for processing incomplete data is solved through similarity measures of a specific kind which are capable of either loosening outliers’ influence or repressing them.","PeriodicalId":211302,"journal":{"name":"2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKRCON.2019.8879844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

The current standing in the scope of Data Mining considers clustering to be one of the most useful and widely used tools. Multiple real-world datasets usually contain drops/gaps in the data due to various reasons. The currently known approaches are highly efficient only in those cases when original datasets do not change their volumes during the analysis. However, up-to-date problems mostly deal with sequential online data processing. On the other hand, there is no prior knowledge on which feature vectors contain overlooks. In this manuscript, the challenge of possibilistic and probabilistic online clustering approaches for processing incomplete data is solved through similarity measures of a specific kind which are capable of either loosening outliers’ influence or repressing them.
基于相似性测度的不完全数据模糊聚类
目前在数据挖掘领域中,聚类被认为是最有用和最广泛使用的工具之一。由于各种原因,多个真实世界的数据集通常包含数据中的drop /gap。目前已知的方法只有在原始数据集在分析过程中不改变其体积的情况下才高效。然而,最新的问题主要是处理顺序在线数据处理。另一方面,没有关于哪些特征向量包含忽略的先验知识。在本文中,通过一种特定类型的相似性度量来解决处理不完整数据的可能性和概率在线聚类方法的挑战,这种相似性度量能够放松异常值的影响或抑制它们。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书