An Automated and Goal-Oriented Clustering Procedure

Author:

Koren OdedORCID,Koren MichalORCID,Peretz OrORCID

Abstract

AbstractClustering techniques are convenient tools for preparing and organizing unstructured and unclassified data. Depending on the data, they can be used to prepare for an analysis or to gain insight. However, choosing a clustering technique can be challenging when dealing with high-dimensional datasets. Most often, application requirements and data distribution need to be considered. Since clustering is defined as a complex problem to calculate, different algorithms may produce different results that meet the application's needs. This study presents an automated threshold-based and goal-oriented clustering procedure. It is based on the AutoML mechanism to estimate the most suitable hyperparameters according to predefined needs and can learn four clustering performance metrics thresholds for a given dataset. The significant advantages of this method are the automatic selection of clustering technique (i.e., partitional, hierarchical, density-based, or graph-based) and the ability to determine the output dynamically, according to predefined goals. We tested our method over four datasets and analyzed the results according to different goals. The results show that our method improved the silhouette score by 549.5% (from 0.105 to 0.682) compared to popular and commonly used K-means. Furthermore, clustering based on multiple metrics yielded more information than clustering by a single metric.

Publisher

Springer Nature Singapore

Reference54 articles.

1. Barlow HB (1989) Unsupervised learning. Neural Comput 1(3):295–311. https://doi.org/10.1162/neco.1989.1.3.295

2. Sindhu Meena K, Suriya S (2019) A survey on supervised and unsupervised learning techniques. In: International conference on artificial intelligence, smart grid and smart city applications. Springer, Cham, pp 627–644. https://doi.org/10.1007/978-3-030-24051-6_58

3. Berry MW, Mohamed A, Yap BW (eds) (2019) Supervised and unsupervised learning for data science. Springer Nature, Cham

4. Elavarasi SA, Akilandeswari J, Sathiyabhama B (2011) A survey on partition clustering algorithms. Int J Enterp Comput Bus Syst 1(1):1–14

5. Patel S, Sihmar S, Jatain A (2015) A study of hierarchical clustering algorithms. In: 2015 2nd International conference on computing for sustainable global development (INDIACom). IEEE, New Delhi, pp 537–541

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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