DagSemProc.07181.9.pdf
- Filesize: 66 kB
- 2 pages
Document
Reliably Capture Local Clusters in Noisy Domains From Parallel Universes
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7181
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-12-11
Cite AsGet BibTex
Frank Höppner and Mirko Böttcher. Reliably Capture Local Clusters in Noisy Domains From Parallel Universes. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.07181.9
https://doi.org/10.4230/DagSemProc.07181.9
Abstract
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.
Keywords
- Local pattern
- time
- parallel universe
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads