Reducing Uncertainty and Increasing Confidence in Unsupervised Learning

Author:

Christakis Nicholas12,Drikakis Dimitris1ORCID

Affiliation:

1. Institute for Advanced Modelling and Simulation, University of Nicosia, Nicosia CY-2417, Cyprus

2. Laboratory of Applied Mathematics, University of Crete, GR-70013 Heraklion, Greece

Abstract

This paper presents the development of a novel algorithm for unsupervised learning called RUN-ICON (Reduce UNcertainty and Increase CONfidence). The primary objective of the algorithm is to enhance the reliability and confidence of unsupervised clustering. RUN-ICON leverages the K-means++ method to identify the most frequently occurring dominant centres through multiple repetitions. It distinguishes itself from existing K-means variants by introducing novel metrics, such as the Clustering Dominance Index and Uncertainty, instead of relying solely on the Sum of Squared Errors, for identifying the most dominant clusters. The algorithm exhibits notable characteristics such as robustness, high-quality clustering, automation, and flexibility. Extensive testing on diverse data sets with varying characteristics demonstrates its capability to determine the optimal number of clusters under different scenarios. The algorithm will soon be deployed in real-world scenarios, where it will undergo rigorous testing against data sets based on measurements and simulations, further proving its effectiveness.

Funder

European Union’s Horizon Europe Research and Innovation Actions programme

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference38 articles.

1. The “Wake-Sleep” Algorithm for Unsupervised Neural Networks;Hinton;Science,1995

2. Unsupervised learning by competing hidden units;Krotov;Proc. Natl. Acad. Sci. USA,2019

3. Dimensionality reduction by learning an invariant mapping;Hadsell;Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06),2006

4. Alloghani, M., Al-Jumeily Obe, D., Mustafina, J., Hussain, A., and Aljaaf, A. (2020). Supervised and Unsupervised Learning for Data Science, Springer.

5. Na, S., Xumin, L., and Yong, G. (2010, January 2–4). Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm. Proceedings of the 2010 Third International Symposium on Intelligent Information Technology and Security Informatics, Jian, China.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3