<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <nonSort>The </nonSort>
    <title>k-means Algorithm: A Comprehensive Survey and Performance Evaluation</title>
  </titleInfo>
  <name type="personal">
    <namePart>Mohiuddin Ahmed</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Raihan Seraj</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Syed Mohammed Shamsul Islam</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="">Journal articles.</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">xx</placeTerm>
    </place>
    <dateIssued encoding="marc">2020</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>1 online resource (1 article).</extent>
  </physicalDescription>
  <abstract>The k-means clustering algorithm is considered one of the most powerful and popular data mining algorithms in the research community. However, despite its popularity, the algorithm has certain limitations, including problems associated with random initialization of the centroids which leads to unexpected convergence. Additionally, such a clustering algorithm requires the number of clusters to be defined beforehand, which is responsible for different cluster shapes and outlier effects. A fundamental problem of the k-means algorithm is its inability to handle various data types. This paper provides a structured and synoptic overview of research conducted on the k-means algorithm to overcome such shortcomings. Variants of the k-means algorithms including their recent developments are discussed, where their effectiveness is investigated based on the experimental analysis of a variety of datasets. The detailed experimental analysis along with a thorough comparison among different k-means clustering algorithms differentiates our work compared to other existing survey papers. Furthermore, it outlines a clear and thorough understanding of the k-means algorithm along with its different research directions.</abstract>
  <note type="statement of responsibility">Mohiuddin Ahmed; Raihan Seraj; Syed Mohammed Shamsul Islam.</note>
  <note>Publication type: Journal article.</note>
  <note>Linked open-access copy: published version.</note>
  <note>Open access; no subscription required for the linked open-access version. Unrestricted online access star</note>
  <note xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://openalex.org/W3048804154">Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata). https://openalex.org/W3048804154</note>
  <note>In English.</note>
  <subject>
    <topic>K-means clustering</topic>
  </subject>
  <subject>
    <topic>centroid initialization</topic>
  </subject>
  <subject>
    <topic>optimal number of clusters</topic>
  </subject>
  <subject>
    <topic>cluster shape</topic>
  </subject>
  <subject>
    <topic>outliers</topic>
  </subject>
  <subject>
    <topic>algorithm comparison</topic>
  </subject>
  <subject>
    <topic>B. Sc. Computer Science</topic>
  </subject>
  <subject>
    <topic>UMUN open access collection</topic>
  </subject>
  <subject>
    <topic>algorithms</topic>
  </subject>
  <relatedItem type="host">
    <titleInfo>
      <title>Electronics</title>
    </titleInfo>
    <identifier type="issn">2079-9292</identifier>
    <part>
      <text>Vol. 9, no. 8, (2020), pages/article 1295</text>
    </part>
  </relatedItem>
  <identifier type="uri">https://www.mdpi.com/2079-9292/9/8/1295/pdf?version=1597814020</identifier>
  <location>
    <url displayLabel="Read open-access publication">https://www.mdpi.com/2079-9292/9/8/1295/pdf?version=1597814020</url>
  </location>
  <accessCondition type="restrictionOnAccess">Open access; no subscription required for the linked open-access version.</accessCondition>
  <accessCondition type="useAndReproduction">Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).</accessCondition>
  <recordInfo>
    <recordContentSource authority="marcorg">local</recordContentSource>
    <recordCreationDate encoding="marc">261005</recordCreationDate>
    <recordChangeDate encoding="iso8601">20261005174811.0</recordChangeDate>
    <recordIdentifier source="local">UMUN-OA-20261005-CS-033</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
