Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Höppner, Frank; Böttcher, Mirko License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12617


Reliably Capture Local Clusters in Noisy Domains From Parallel Universes



When seeking for small local patterns it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We propose a new approach that addresses this problem by exploiting temporal information which is contained in most business data sets. The algorithm enables the detection of local patterns in noisy data sets more reliable compared to the case when the temporal information is ignored. This is achieved by making use of the fact that noise does not reproduce its incidental structure but even small patterns do. In particular, we developed a method to track clusters over time based on an optimal match of data partitions between time periods.

BibTeX - Entry

  author =	{Frank H{\"o}ppner and Mirko B{\"o}ttcher},
  title =	{Reliably Capture Local Clusters in Noisy Domains From Parallel Universes},
  booktitle =	{Parallel Universes and Local Patterns},
  year =	{2007},
  editor =	{Michael R. Berthold and Katharina Morik and Arno Siebes},
  number =	{07181},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Local pattern, time, parallel universe}

Keywords: Local pattern, time, parallel universe
Seminar: 07181 - Parallel Universes and Local Patterns
Issue date: 2007
Date of publication: 11.12.2007

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