The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
An Optimized Clustering Quality Analysis in K-Means Cluster Using Silhouette Scores
|
|
Author(s): F. Mohamed Ilyas (Bharath Institute of Higher Education and Research, India)and S. Silvia Priscila (Bharath Institute of Higher Education and Research, India)
Copyright: 2024
Pages: 15
Source title:
Explainable AI Applications for Human Behavior Analysis
Source Author(s)/Editor(s): P. Paramasivan (Dhaanish Ahmed College of Engineering, India), S. Suman Rajest (Dhaanish Ahmed College of Engineering, India), Karthikeyan Chinnusamy (Veritas, USA), R. Regin (SRM Institute of Science and Technology, India)and Ferdin Joe John Joseph (Thai-Nichi Institute of Technology, Thailand)
DOI: 10.4018/979-8-3693-1355-8.ch004
Purchase
|
Abstract
Data-driven problem-solving requires the capacity to use cutting-edge computational methods to explain fundamental phenomena to a large audience. These facilities are needed for political and social studies. Quantitative methods often involve knowledge of concepts, trends, and facts that affect the study programme. Researchers often don't know the data's structure or assumptions when analysing it. Data exploration may also obscure social science research methodology instruction. It was essential applied research before predictive modelling and hypothesis testing. Clustering is part of data mining and picking the right cluster count is key to improving predictive model accuracy for large datasets. Unsupervised machine learning (ML) algorithm K-means is popular. The method usually finds discrete, non-overlapping clusters with groups for each location. It can be difficult to choose the best k-means approach. In the human freedom index (HFI) dataset, the mini batch k-mean (MBK-mean) using the Hamely method reduces iteration and increases cluster efficiency. The silhouette score algorithm from Scikit-learn was used to obtain the average silhouette co-efficient of all samples for various cluster counts. A cluster with fewer negative values is considered best. Additionally, the silhouette with the greatest score has the optimum clusters.
Related Content
|
Kula A. Francis, Kenny A. Hendrickson.
© 2026.
26 pages.
|
|
Summyr Burton, Savannah Baus, Stephen A. Murphy.
© 2026.
50 pages.
|
|
Kesley Richardson, Colby Cavanaugh.
© 2026.
30 pages.
|
|
Angela M. Hill, Kevin B. Sneed, Deborah Austin, Deanna B. Wathington, Hiram B. Green, Michael B. Morgan, Janet B. Roman, Feng B. Cheng, John E. Clark, Natasha Rubie, Kristy Andre, Thea Moore, Antionette Davis, Feng Cheng, Karia Doreen MacAulay, Maisha Standifer, Judette Louis, Joseph Diamond, Kyaien Conner, Victor Obi, Samantha Thompson.
© 2026.
22 pages.
|
|
Angela Stephanie Mazzetti, Anniken Grønstad, John Blenkinsopp.
© 2026.
32 pages.
|
|
Marie Grace Avelino Gomez, Kenith B Villaruel.
© 2026.
30 pages.
|
|
Carolyn Allen.
© 2026.
30 pages.
|
|
|