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.