<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03630naa a22005297i 4500</leader>
  <controlfield tag="001">UMUN-OA-20261005-CS-033</controlfield>
  <controlfield tag="003">local</controlfield>
  <controlfield tag="005">20261005174811.0</controlfield>
  <controlfield tag="006">m     o  d        </controlfield>
  <controlfield tag="007">cr||||||||||||</controlfield>
  <controlfield tag="008">261005s2020    xx      o    u000 0 eng d</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="a">10.3390/electronics9081295</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">(local)OpenAlex:W3048804154</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">local</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">local</subfield>
  </datafield>
  <datafield tag="041" ind1="0" ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="0" ind2=" ">
    <subfield code="a">Mohiuddin Ahmed</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="4">
    <subfield code="a">The k-means Algorithm: A Comprehensive Survey and Performance Evaluation /</subfield>
    <subfield code="c">Mohiuddin Ahmed; Raihan Seraj; Syed Mohammed Shamsul Islam.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">[Place of publication not identified] :</subfield>
    <subfield code="b">Multidisciplinary Digital Publishing Institute,</subfield>
    <subfield code="c">2020.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">1 online resource (1 article).</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="a">text</subfield>
    <subfield code="b">txt</subfield>
    <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="a">computer</subfield>
    <subfield code="b">c</subfield>
    <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="a">online resource</subfield>
    <subfield code="b">cr</subfield>
    <subfield code="2">rdacarrier</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Publication type: Journal article.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Linked open-access copy: published version.</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Open access; no subscription required for the linked open-access version.</subfield>
    <subfield code="f">Unrestricted online access</subfield>
    <subfield code="2">star</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">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.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution (licence family recorded by the source; version not supplied in metadata).</subfield>
    <subfield code="u">https://openalex.org/W3048804154</subfield>
  </datafield>
  <datafield tag="546" ind1=" " ind2=" ">
    <subfield code="a">In English.</subfield>
  </datafield>
  <datafield tag="588" ind1="0" ind2=" ">
    <subfield code="a">Description generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.</subfield>
  </datafield>
  <datafield tag="590" ind1=" " ind2=" ">
    <subfield code="a">Course allocation: B. Sc. Computer Science.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">K-means clustering</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">centroid initialization</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">optimal number of clusters</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">cluster shape</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">outliers</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="4">
    <subfield code="a">algorithm comparison</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">B. Sc. Computer Science</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">UMUN open access collection</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">algorithms</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">Journal articles.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Raihan Seraj</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="700" ind1="0" ind2=" ">
    <subfield code="a">Syed Mohammed Shamsul Islam</subfield>
    <subfield code="e">author.</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
    <subfield code="t">Electronics</subfield>
    <subfield code="g">Vol. 9, no. 8, (2020), pages/article 1295</subfield>
    <subfield code="x">2079-9292</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
    <subfield code="u">https://www.mdpi.com/2079-9292/9/8/1295/pdf?version=1597814020</subfield>
    <subfield code="y">Read open-access publication</subfield>
    <subfield code="z">Open access. Access and licence reported by the source; this host could not be independently checked by automation.</subfield>
    <subfield code="7">0</subfield>
  </datafield>
  <datafield tag="884" ind1=" " ind2=" ">
    <subfield code="a">Course selection and automated MARC21 enrichment from OpenAlex metadata.</subfield>
    <subfield code="g">20261005</subfield>
    <subfield code="k">https://openalex.org/W3048804154</subfield>
    <subfield code="q">local</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="n">0</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">395</subfield>
    <subfield code="d">395</subfield>
  </datafield>
</record>
