<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>book chapter</genre>

<titleInfo><title>Using a Set of Triangle Inequalities to Accelerate K-means Clustering</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Qiao</namePart>
  <namePart type="family">Yu</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Kuan-Hsun</namePart>
  <namePart type="family">Chen</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jian-Jia</namePart>
  <namePart type="family">Chen</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>















<originInfo><publisher>Springer International Publishing</publisher><dateIssued encoding="w3cdtf">2020</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo>
  <identifier type="issn">0302-9743</identifier>
  <identifier type="issn">1611-3349</identifier>
  <identifier type="isbn">9783030609351</identifier>
  <identifier type="isbn">9783030609368</identifier><identifier type="doi">10.1007/978-3-030-60936-8_23</identifier>
<part>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Yu Q, Chen K-H, Chen J-J. Using a Set of Triangle Inequalities to Accelerate K-means Clustering. In: &lt;i&gt;Lecture Notes in Computer Science&lt;/i&gt;. Springer International Publishing; 2020. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-030-60936-8_23&quot;&gt;10.1007/978-3-030-60936-8_23&lt;/a&gt;</ama>
<bibtex>@inbook{Yu_Chen_Chen_2020, place={Cham}, title={Using a Set of Triangle Inequalities to Accelerate K-means Clustering}, DOI={&lt;a href=&quot;https://doi.org/10.1007/978-3-030-60936-8_23&quot;&gt;10.1007/978-3-030-60936-8_23&lt;/a&gt;}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Yu, Qiao and Chen, Kuan-Hsun and Chen, Jian-Jia}, year={2020} }</bibtex>
<mla>Yu, Qiao, et al. “Using a Set of Triangle Inequalities to Accelerate K-Means Clustering.” &lt;i&gt;Lecture Notes in Computer Science&lt;/i&gt;, Springer International Publishing, 2020, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-030-60936-8_23&quot;&gt;10.1007/978-3-030-60936-8_23&lt;/a&gt;.</mla>
<chicago>Yu, Qiao, Kuan-Hsun Chen, and Jian-Jia Chen. “Using a Set of Triangle Inequalities to Accelerate K-Means Clustering.” In &lt;i&gt;Lecture Notes in Computer Science&lt;/i&gt;. Cham: Springer International Publishing, 2020. &lt;a href=&quot;https://doi.org/10.1007/978-3-030-60936-8_23&quot;&gt;https://doi.org/10.1007/978-3-030-60936-8_23&lt;/a&gt;.</chicago>
<short>Q. Yu, K.-H. Chen, J.-J. Chen, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.</short>
<apa>Yu, Q., Chen, K.-H., &amp;#38; Chen, J.-J. (2020). Using a Set of Triangle Inequalities to Accelerate K-means Clustering. In &lt;i&gt;Lecture Notes in Computer Science&lt;/i&gt;. Springer International Publishing. &lt;a href=&quot;https://doi.org/10.1007/978-3-030-60936-8_23&quot;&gt;https://doi.org/10.1007/978-3-030-60936-8_23&lt;/a&gt;</apa>
<ieee>Q. Yu, K.-H. Chen, and J.-J. Chen, “Using a Set of Triangle Inequalities to Accelerate K-means Clustering,” in &lt;i&gt;Lecture Notes in Computer Science&lt;/i&gt;, Cham: Springer International Publishing, 2020.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>66237</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-07-03T21:25:12Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-05T14:44:13Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
