#
Alone We Can Do So Little; Together We Cannot Be Detected^{ †}

^{1}

^{2}

^{*}

^{†}

^{‡}

## Abstract

**:**

## 1. Introduction

**cl**uster

**o**ver-time

**s**tability

**e**valuation measure called CLOSE [15] that is significantly less computationally expensive. Moreover, the results are based on a much more intuitive threshold that incorporates the cluster membership of time series. We compare the obtained results with those of Tatusch et al. [16].

#### 1.1. Notation and Definitions

**Definition**

**1**

**.**A time series $T{S}_{x}={x}_{1},\dots ,{x}_{n}$ is an ordered set of n real-valued data points of any dimension. The data points are ordered chronologically by time. The order is represented by the corresponding indices of the data points.

**Definition**

**2**

**.**A subsequence ${S}_{x,[k,m]}={x}_{k},\dots ,{x}_{m}$ of a time series $T{S}_{x}$ is an ordered subset of $m-k$ real-value data points of $T{S}_{x}$ with $k<m$ and $\forall {x}_{l}\in T{S}_{x}:k<l<m:{x}_{l}\in {S}_{x,[k,m]}$.

**Definition**

**3**

**.**A data set $D=\{T{S}_{1},\dots ,T{S}_{m}\}$ is a set of m time series of the same length n and equivalent points in time.

**Definition**

**4**

**.**A cluster ${C}_{i,t}$ at time t with $i\in 1,\dots ,p$ being an unique identifier, is a set of similar data points, identified by a clustering algorithm. All clusters have distinct labels regardless of time.

**Definition**

**5**

**.**A cluster ${C}_{i,t}$ at time t with $i\in 1,\dots ,p$ being an unique identifier, is a set of similar data points identified by a clustering algorithm. All clusters have distinct labels regardless of time.

## 2. Related Work

## 3. Method

## 4. Experiments

#### 4.1. Eikon Financial Data Set

#### 4.2. Airline On-Time Performance Data Set

## 5. Conclusions and Future Work

## Author Contributions

## Funding

## Institutional Review Board Statement

## Informed Consent Statement

## Data Availability Statement

## Acknowledgments

## Conflicts of Interest

## Abbreviations

DOOTS | Detecton of outliers in time series (method) |

CLOSE | cluster over-time stability evaluation (measure) |

DTW | dynamic time warping |

## References

- Ferdousi, Z.; Maeda, A. Unsupervised Outlier Detection in Time Series Data. In Proceedings of the 22nd International Conference on Data Engineering Workshops, Atlanta, GA, USA, 3–7 April 2006; IEEE: New York, NY, USA, 2006. [Google Scholar]
- Golmohammadi, K.; Zaiane, O.R. Time series contextual anomaly detection for detecting market manipulation in stock market. In Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), Paris, France, 19–21 October 2015; IEEE: New York, NY, USA, 2015. [Google Scholar]
- Gao, J.; Liang, F.; Fan, W.; Wang, C.; Sun, Y.; Han, J. On community outliers and their efficient detection in information networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD’10, Washington, DC, USA, 25–7 July 2010; ACM Press: New York, NY, USA, 2010. [Google Scholar]
- Ghoting, A.; Otey, M.; Parthasarathy, S. LOADED: Link-Based Outlier and Anomaly Detection in Evolving Data Sets. In Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM’04), Brighton, UK, 1–4 November 2004; IEEE: New York, NY, USA, 2004. [Google Scholar]
- Keogh, E.; Lin, J.; Fu, A.; Herle, H.V. Finding Unusual Medical Time-Series Subsequences: Algorithms and Applications. IEEE Trans. Inf. Technol. Biomed.
**2006**, 10, 429–439. [Google Scholar] [CrossRef] [PubMed] - Nouira, K.; Trabelsi, A. Time Series Analysis and Outlier Detection in Intensive Care Data. In Proceedings of the 2006 8th international Conference on Signal Processing, Guilin, China, 16–20 November 2006; IEEE: New York, NY, USA, 2006. [Google Scholar]
- Biem, A.; Feng, H.; Riabov, A.V.; Turaga, D.S. Real-time analysis and management of big time-series data. IBM J. Res. Dev.
**2013**, 57, 8:1–8:12. [Google Scholar] [CrossRef] - Ren, H.; Xu, B.; Wang, Y.; Yi, C.; Huang, C.; Kou, X.; Xing, T.; Yang, M.; Tong, J.; Zhang, Q. Time-Series Anomaly Detection Service at Microsoft. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Anchorage, AK, USA, 4–8 August 2019; ACM Press: New York, NY, USA, 2019. [Google Scholar]
- Benkabou, S.E.; Benabdeslem, K.; Canitia, B. Unsupervised outlier detection for time series by entropy and dynamic time warping. Knowl. Inf. Syst.
**2017**, 54, 463–486. [Google Scholar] [CrossRef] - Diab, D.M.; AsSadhan, B.; Binsalleeh, H.; Lambotharan, S.; Kyriakopoulos, K.G.; Ghafir, I. Anomaly Detection Using Dynamic Time Warping. In Proceedings of the 2019 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC), New York, NY, USA, 1–3 August 2019; IEEE: New York, NY, USA, 2019. [Google Scholar]
- Granger, C.W.J. Investigating Causal Relations by Econometric Models and Cross-spectral Methods. Econometrica
**1969**, 37, 424. [Google Scholar] [CrossRef] - Qiu, H.; Liu, Y.; Subrahmanya, N.A.; Li, W. Granger Causality for Time-Series Anomaly Detection. In Proceedings of the 2012 IEEE 12th International Conference on Data Mining, Brussels, Belgium, 10 December 2012; IEEE: New York, NY, USA, 2019. [Google Scholar]
- Lloyd, S. Least squares quantization in PCM. IEEE Trans. Inf. Theory
**1982**, 28, 129–137. [Google Scholar] [CrossRef][Green Version] - Chakrabarti, D.; Kumar, R.; Tomkins, A. Evolutionary clustering. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery Furthermore, Data Mining—KDD’06, Philadelphia, PA, USA, 20–23 August 2006; ACM Press: New York, NY, USA, 2006. [Google Scholar]
- Tatusch, M.; Klassen, G.; Bravidor, M.; Conrad, S. How is your team spirit? cluster over-time stability evaluation. In Machine Learning and Data Mining in Pattern Recognition, Proceedings of the 16th International Conference on Machine Learning and Data Mining, MLDM 2020, New York, NY, USA, 18–23 July 2020; IBAI Publishing: Leipzig, Germany, 2020; pp. 155–170. [Google Scholar]
- Tatusch, M.; Klassen, G.; Bravidor, M.; Conrad, S. Show Me Your Friends and I will Tell You Who You Are. Finding Anomalous Time Series by Conspicuous Cluster Transitions. In Communications in Computer and Information Science; Springer: Singapore, 2019; pp. 91–103. [Google Scholar]
- Hawkins, D.M. Identification of Outliers; Springer: Cham, The Netherlands, 1980. [Google Scholar]
- Blázquez-García, A.; Conde, A.; Mori, U.; Lozano, J.A. A review on outlier/anomaly detection in time series data. ACM Comput. Surv.
**2021**, 54, 56:1–56:33. [Google Scholar] [CrossRef] - Sun, P.; Chawla, S.; Arunasalam, B. Mining for Outliers in Sequential Databases. In Proceedings of the 2006 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, Bethesda, MD, USA, 20–22 April 2006. [Google Scholar]
- Lin, J.; Keogh, E.; Wei, L.; Lonardi, S. Experiencing SAX: A novel symbolic representation of time series. Data Min. Knowl. Discov.
**2007**, 15, 107–144. [Google Scholar] [CrossRef][Green Version] - Munir, M.; Siddiqui, S.A.; Dengel, A.; Ahmed, S. DeepAnT: A Deep Learning Approach for Unsupervised Anomaly Detection in Time Series. IEEE Access
**2019**, 7, 1991–2005. [Google Scholar] [CrossRef] - Hyndman, R.J.; Wang, E.; Laptev, N. Large-Scale Unusual Time Series Detection. In Proceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW), Atlantic City, NJ, USA, 14–17 November 2015; IEEE: New York, NY, USA, 2019. [Google Scholar]
- Hyndman, R.J. Computing and Graphing Highest Density Regions. Am. Stat.
**1996**, 50, 120. [Google Scholar]

**Figure 2.**(

**a**) Result of Tatusch et al. Colors: cluster memberships, red dashed boxes: outlier by distance, black dashed boxes: intuitive outliers. (

**b**) Result of our method. Colors: cluster memberships, red dashed boxes: outliers, black dashed boxes: preoutliers.

**Figure 3.**Airline on-time performance data set. (

**a**) Outlier detection result of the method of Tatusch et al. (

**b**) Result of our method.

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |

© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Korlakov, S.; Klassen, G.; Bravidor, M.; Conrad, S.
Alone We Can Do So Little; Together We Cannot Be Detected. *Eng. Proc.* **2022**, *18*, 3.
https://doi.org/10.3390/engproc2022018003

**AMA Style**

Korlakov S, Klassen G, Bravidor M, Conrad S.
Alone We Can Do So Little; Together We Cannot Be Detected. *Engineering Proceedings*. 2022; 18(1):3.
https://doi.org/10.3390/engproc2022018003

**Chicago/Turabian Style**

Korlakov, Sergej, Gerhard Klassen, Marcus Bravidor, and Stefan Conrad.
2022. "Alone We Can Do So Little; Together We Cannot Be Detected" *Engineering Proceedings* 18, no. 1: 3.
https://doi.org/10.3390/engproc2022018003