PUMA publications for /tag/inex08paperhttps://puma.uni-kassel.de/tag/inex08paperPUMA RSS feed for /tag/inex08paper2024-03-19T09:36:48+01:00k-means++: the advantages of careful seedinghttps://puma.uni-kassel.de/bibtex/2553bbfa74b13c47b4e9c7c0034a8406e/stephandoerfelstephandoerfel2010-01-19T11:49:24+01:00algorithm careful clustering inex08paper kmeans kmeans++ paper seeding <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="David Arthur" itemprop="url" href="/author/David%20Arthur"><span itemprop="name">D. Arthur</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei Vassilvitskii" itemprop="url" href="/author/Sergei%20Vassilvitskii"><span itemprop="name">S. Vassilvitskii</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms</span>, </em></span><em>Seite <span itemprop="pagination">1027--1035</span>. </em><em>Philadelphia, PA, USA, </em><em><span itemprop="publisher">Society for Industrial and Applied Mathematics</span>, </em>(<em><span>2007<meta content="2007" itemprop="datePublished"/></span></em>)Tue Jan 19 11:49:24 CET 2010Philadelphia, PA, USASODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms1027--1035k-means++: the advantages of careful seeding2007algorithm careful clustering inex08paper kmeans kmeans++ paper seeding A very precise implementation of k-means with carefull seeding