<?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>conference paper</genre>

<titleInfo><title>Information theoretic clustering using minimal spanning trees</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

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


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Andreas</namePart>
  <namePart type="family">Müller</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Sebastian</namePart>
  <namePart type="family">Nowozin</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Christoph</namePart>
  <namePart type="family">Lampert</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40C20FD2-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-8622-7887</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">ChLa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>DAGM: German Association For Pattern Recognition</namePart>
</name>






<abstract lang="eng">In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficient algorithm with low runtime complexity. The algorithm has a single free parameter, the number of clusters to find. We demonstrate superior performance on several synthetic and real datasets.
</abstract>

<originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">2012</dateIssued><place><placeTerm type="text">Graz, Austria</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><identifier type="doi">10.1007/978-3-642-32717-9_21</identifier>
<part><detail type="volume"><number>7476</number></detail><extent unit="pages">205 - 215</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Müller, A., Nowozin, S., &amp;#38; Lampert, C. (2012). Information theoretic clustering using minimal spanning trees (Vol. 7476, pp. 205–215). Presented at the DAGM: German Association For Pattern Recognition, Graz, Austria: Springer. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-32717-9_21&quot;&gt;https://doi.org/10.1007/978-3-642-32717-9_21&lt;/a&gt;</apa>
<chicago>Müller, Andreas, Sebastian Nowozin, and Christoph Lampert. “Information Theoretic Clustering Using Minimal Spanning Trees,” 7476:205–15. Springer, 2012. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-32717-9_21&quot;&gt;https://doi.org/10.1007/978-3-642-32717-9_21&lt;/a&gt;.</chicago>
<ama>Müller A, Nowozin S, Lampert C. Information theoretic clustering using minimal spanning trees. In: Vol 7476. Springer; 2012:205-215. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-32717-9_21&quot;&gt;10.1007/978-3-642-32717-9_21&lt;/a&gt;</ama>
<mla>Müller, Andreas, et al. &lt;i&gt;Information Theoretic Clustering Using Minimal Spanning Trees&lt;/i&gt;. Vol. 7476, Springer, 2012, pp. 205–15, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-32717-9_21&quot;&gt;10.1007/978-3-642-32717-9_21&lt;/a&gt;.</mla>
<ista>Müller A, Nowozin S, Lampert C. 2012. Information theoretic clustering using minimal spanning trees. DAGM: German Association For Pattern Recognition, LNCS, vol. 7476, 205–215.</ista>
<short>A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215.</short>
<ieee>A. Müller, S. Nowozin, and C. Lampert, “Information theoretic clustering using minimal spanning trees,” presented at the DAGM: German Association For Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 205–215.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>3126</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:01:32Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2021-01-12T07:41:14Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
