2026-07-28T08:11:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1261 2024-03-06T11:07:31Z ddc:004 open_access

Reliably Capture Local Clusters in Noisy Domains From Parallel Universes Höppner, Frank Böttcher, Mirko Local pattern time parallel universe 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Frank Höppner and Mirko Böttcher 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07181.9 urn:nbn:de:0030-drops-12617 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.9 eng https://creativecommons.org/licenses/by/4.0/legalcode