Probabilistic and More General Uncertainty-Based (e.g., Fuzzy) Approaches to Crisp Clustering Explain the Empirical Success of the K-Sets Algorithm

• المؤلفون الرئيسيون: Vladik Kreinovich, Olga Kosheleva, Shahnaz N. Shahbazova, Songsak Sriboonchitta
• التنسيق: Book Series
• منشور في: 2020
• الموضوعات: Computer Science; Mathematics
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081610724&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/68347
• المؤسسة: Chiang Mai University

© 2020, Springer Nature Switzerland AG. Recently, a new empirically successful algorithm was proposed for crisp clustering: the K-sets algorithm. In this paper, we show that a natural uncertainty-based formalization of what is clustering automatically leads to the mathematical ideas and definitions...