<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-05049680</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-15T22:42:13+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Accelerate K-Mode Algorithms Using The Triangle Inequality</title>
            <author role="aut">
              <persName>
                <forename type="first">Vu-Linh</forename>
                <surname>Nguyen</surname>
              </persName>
              <email type="md5">a094ec6df992ec8910ff432486a3d79f</email>
              <email type="domain">hds.utc.fr</email>
              <idno type="idhal" notation="string">vu-linh-nguyen</idno>
              <idno type="idhal" notation="numeric">1536631</idno>
              <idno type="halauthorid" notation="string">32089-1536631</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=J-PcfGgAAAAJ</idno>
              <idno type="IDREF">https://www.idref.fr/253136415</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1642-4468</idno>
              <affiliation ref="#struct-389870"/>
              <affiliation ref="#struct-1195794"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Toan</forename>
                <surname>Nguyen-Mau</surname>
              </persName>
              <idno type="halauthorid">3501025-0</idno>
              <affiliation ref="#struct-14122"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Van-Nam</forename>
                <surname>Huynh</surname>
              </persName>
              <idno type="halauthorid">1831674-0</idno>
              <affiliation ref="#struct-14122"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Vu-Linh</forename>
                <surname>Nguyen</surname>
              </persName>
              <email type="md5">59474e9af28cf35efbdbac7107688197</email>
              <email type="domain">hds.utc.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-04-28 15:14:44</date>
              <date type="whenModified">2025-06-24 10:16:03</date>
              <date type="whenReleased">2025-04-29 07:28:07</date>
              <date type="whenProduced">2024-11-27</date>
              <date type="whenEndEmbargoed">2025-04-28</date>
              <ref type="file" target="https://hal.science/hal-05049680v1/document">
                <date notBefore="2025-04-28"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-05049680v1/file/Accelerate%20K-Mode%20Algorithms%20Using%20The%20Triangle%20Inequality.pdf" id="file-5049680-4371737">
                <date notBefore="2025-04-28"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1668347">
                <persName>
                  <forename>Vu-Linh</forename>
                  <surname>Nguyen</surname>
                </persName>
                <email type="md5">59474e9af28cf35efbdbac7107688197</email>
                <email type="domain">hds.utc.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05049680</idno>
            <idno type="halUri">https://hal.science/hal-05049680</idno>
            <idno type="halBibtex">nguyen:hal-05049680</idno>
            <idno type="halRefHtml">&lt;i&gt;16th International Conference on Scalable Uncertainty Management (SUM 2024)&lt;/i&gt;, Nov 2024, Palermo, Italy. pp.325-339, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-031-76235-2_24"&gt;&amp;#x27E8;10.1007/978-3-031-76235-2_24&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">16th International Conference on Scalable Uncertainty Management (SUM 2024), Nov 2024, Palermo, Italy. pp.325-339, &amp;#x27E8;10.1007/978-3-031-76235-2_24&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-5049680-4371737"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-COMPIEGNE">Université de Technologie de Compiègne</idno>
            <idno type="stamp" n="HEUDIASYC" corresp="UNIV-COMPIEGNE">Laboratoire HEUDIASYC - Heuristique et Diagnostic des Systèmes Complexes</idno>
            <idno type="stamp" n="HDS_CID" corresp="HEUDIASYC">Connaissances, Incertitudes et Données </idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Accelerate K-Mode Algorithms Using The Triangle Inequality</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Vu-Linh</forename>
                    <surname>Nguyen</surname>
                  </persName>
                  <email type="md5">a094ec6df992ec8910ff432486a3d79f</email>
                  <email type="domain">hds.utc.fr</email>
                  <idno type="idhal" notation="string">vu-linh-nguyen</idno>
                  <idno type="idhal" notation="numeric">1536631</idno>
                  <idno type="halauthorid" notation="string">32089-1536631</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=J-PcfGgAAAAJ</idno>
                  <idno type="IDREF">https://www.idref.fr/253136415</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1642-4468</idno>
                  <affiliation ref="#struct-389870"/>
                  <affiliation ref="#struct-1195794"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Toan</forename>
                    <surname>Nguyen-Mau</surname>
                  </persName>
                  <idno type="halauthorid">3501025-0</idno>
                  <affiliation ref="#struct-14122"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Van-Nam</forename>
                    <surname>Huynh</surname>
                  </persName>
                  <idno type="halauthorid">1831674-0</idno>
                  <affiliation ref="#struct-14122"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">8</idno>
                <meeting>
                  <title>16th International Conference on Scalable Uncertainty Management (SUM 2024)</title>
                  <date type="start">2024-11-27</date>
                  <date type="end">2024-11-29</date>
                  <settlement>Palermo</settlement>
                  <country key="IT">Italy</country>
                </meeting>
                <imprint>
                  <publisher>Springer Nature Switzerland</publisher>
                  <pubPlace>Cham</pubPlace>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">15350</biblScope>
                  <biblScope unit="pp">325-339</biblScope>
                  <date type="datePub">2024-11-12</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-031-76235-2_24</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Clustering Categorical Data</term>
                <term xml:lang="en">K-Modes</term>
                <term xml:lang="en">Triangle Inequality</term>
                <term xml:lang="en">Decomposable Dissimilarities</term>
                <term xml:lang="en">Clustering Categorical Data K-Modes Triangle Inequality Decomposable Dissimilarities</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halDomain" n="info.info-lg">Computer Science [cs]/Machine Learning [cs.LG]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>&lt;div&gt;&lt;p&gt;Clustering is an unsupervised machine learning task that aims to discover natural groups in the given dataset. K-mode algorithms, which are adaptions of K-mean algorithms for continuous data, are among the most popular algorithms for discovering clusters in categorical data. In this paper, we present some results on how to accelerate them using the triangle inequality, while still always computing exactly the same result as the original K-mode algorithms. We also provide some empirical evidence to illustrate the potential gains provided by leveraging the triangle inequality. Finally, we envision future work aimed at providing a comprehensive understanding of the use of triangle inequality in accelerating other clustering algorithms for categorical data.&lt;/p&gt;&lt;/div&gt;</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-389870" status="VALID">
          <idno type="IdRef">110410807</idno>
          <idno type="ISNI">0000 0004 0452 2471</idno>
          <idno type="RNSR">201220263C</idno>
          <idno type="ROR">https://ror.org/0075hvk77</idno>
          <orgName>Heuristique et Diagnostic des Systèmes Complexes [Compiègne]</orgName>
          <orgName type="acronym">Heudiasyc</orgName>
          <desc>
            <address>
              <addrLine>UTC, CS 60319 - 57 avenue de Landshut - 60203 Compiègne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.hds.utc.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93027" type="direct"/>
            <relation name="UMR7253" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-1195794" status="INCOMING">
          <orgName>Université technologique de Compiège</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-14122" status="VALID">
          <orgName>Japan Advanced Institute of Science and Technology</orgName>
          <orgName type="acronym">JAIST</orgName>
          <desc>
            <address>
              <addrLine>1-1 Asahidai, Nomi, Ishikawa 923-1292 Japan</addrLine>
              <country key="JP"/>
            </address>
            <ref type="url">http://www.jaist.ac.jp/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-93027" status="VALID">
          <idno type="ROR">https://ror.org/04y5kwa70</idno>
          <orgName>Université de Technologie de Compiègne</orgName>
          <orgName type="acronym">UTC</orgName>
          <desc>
            <address>
              <addrLine>Université de Technologie de Compiègne - rue du Docteur Schweitzer- CS 60319 - 60203 Compiègne Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.utc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>