License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.1
URN: urn:nbn:de:0030-drops-65078
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6507/
Go to the corresponding LIPIcs Volume Portal

Ben-David, Shai

How Far Are We From Having a Satisfactory Theory of Clustering? (Invited Talk)

pdf-format:
LIPIcs-MFCS-2016-1.pdf (0.2 MB)

Abstract

This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016).

BibTeX - Entry

@InProceedings{bendavid:LIPIcs:2016:6507,
  author =	{Shai Ben-David},
  title =	{{How Far Are We From Having a Satisfactory Theory of Clusteringl (Invited Talk)}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{1:1--1:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6507},
  URN =		{urn:nbn:de:0030-drops-65078},
  doi =		{10.4230/LIPIcs.MFCS.2016.1},
  annote =	{Keywords: clustering, theory, algorithm tuning, computational complexity}
}

Keywords: clustering, theory, algorithm tuning, computational complexity
Collection: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Issue Date: 2016
Date of publication: 19.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI