Nivarthi, C. P. & Sick, B.: Towards Few-Shot Time Series Anomaly Detection with Temporal Attention and Dynamic Thresholding.
International Conference on Machine Learning and Applications (ICMLA). IEEE, 2023, S. 1444-1450
[Kurzfassung]
[BibTeX]
Anomaly detection plays a pivotal role in diverse realworld applications such as cybersecurity, fault detection, network monitoring, predictive maintenance, and highly automated driving. However, obtaining labeled anomalous data can be a formidable challenge, especially when anomalies exhibit temporal evolution. This paper introduces LATAM (Long short-term memory Autoencoder with Temporal Attention Mechanism) for few-shot anomaly detection, with the aim of enhancing detection performance in scenarios with limited labeled anomaly data. LATAM effectively captures temporal dependencies and emphasizes significant patterns in multivariate time series data. In our investigation, we comprehensively evaluate LATAM against other anomaly detection models, particularly assessing its capability in few-shot learning scenarios where we have minimal examples from the normal class and none from the anomalous class in the training data. Our experimental results, derived from real-world photovoltaic inverter data, highlight LATAM’s superiority, showcasing a substantial 27% mean F1 score improvement, even when trained on a mere two-week dataset. Furthermore, LATAM demonstrates remarkable results on the open-source SWaT dataset, achieving a 12% boost in accuracy with only two days of training data. Moreover, we introduce a simple yet effective dynamic thresholding mechanism, further enhancing the anomaly detection capabilities of LATAM. This underscores LATAM’s efficacy in addressing the challenges posed by limited labeled anomalies in practical scenarios and it proves valuable for downstream tasks involving temporal representation and time series prediction, extending its utility beyond anomaly detection applications.
Mitchell, T.; Cohen, W.; Hruscha, E.; Talukdar, P.; Betteridge, J.; Carlson, A.; Dalvi, B.; Gardner, M.; Kisiel, B.; Krishnamurthy, J.; Lao, N.; Mazaitis, K.; Mohammad, T.; Nakashole, N.; Platanios, E.; Ritter, A.; Samadi, M.; Settles, B.; Wang, R.; Wijaya, D.; Gupta, A.; Chen, X.; Saparov, A.; Greaves, M. & Welling, J.: Never-Ending Learning.
AAAI. 2015
[Volltext]
[BibTeX]
Mnih, V.; Kavukcuoglu, K.; Silver, D.; Rusu, A. A.; Veness, J.; Bellemare, M. G.; Graves, A.; Riedmiller, M.; Fidjeland, A. K.; Ostrovski, G.; Petersen, S.; Beattie, C.; Sadik, A.; Antonoglou, I.; King, H.; Kumaran, D.; Wierstra, D.; Legg, S. & Hassabis, D.: Human-level control through deep reinforcement learning. In:
Nature 518 (2015), Nr. 7540, S. 529-533
[Volltext]
[BibTeX]
Ring, M.; Otto, F.; Becker, M.; Niebler, T.; Landes, D. & Hotho, A.: ConDist: A Context-Driven Categorical Distance Measure. In: ECMLPKDD2015 (Hrsg.): 2015
[BibTeX]
Krompass, D.; Nickel, M. & Tresp, V.: Large-scale factorization of type-constrained multi-relational data.
International Conference on Data Science and Advanced Analytics, DSAA 2014, Shanghai, China, October 30 - November 1, 2014. IEEE, 2014, S. 18-24
[Volltext]
[BibTeX]
Lehmann, J. & Voelker, J.: An Introduction to Ontology Learning. In: Lehmann, J. & Voelker, J. (Hrsg.):
Perspectives on Ontology Learning. AKA / IOS Press, 2014, S. ix-xvi
[Volltext]
[BibTeX]
Kluegl, P.; Toepfer, M.; Lemmerich, F.; Hotho, A. & Puppe, F.: Exploiting Structural Consistencies with Stacked Conditional Random Fields. In:
Mathematical Methodologies in Pattern Recognition and Machine Learning Springer Proceedings in Mathematics & Statistics 30 (2013), S. 111-125
[Kurzfassung]
[BibTeX]
Conditional Random Fields (CRF) are popular methods for labeling unstructured or textual data. Like many machine learning approaches, these undirected graphical models assume the instances to be independently distributed. However, in real-world applications data is grouped in a natural way, e.g., by its creation context. The instances in each group often share additional structural consistencies. This paper proposes a domain-independent method for exploiting these consistencies by combining two CRFs in a stacked learning framework. We apply rule learning collectively on the predictions of an initial CRF for one context to acquire descriptions of its specific properties. Then, we utilize these descriptions as dynamic and high quality features in an additional (stacked) CRF. The presented approach is evaluated with a real-world dataset for the segmentation of references and achieves a significant reduction of the labeling error.
Yu, H.-F.; Jain, P.; Kar, P. & Dhillon, I. S.:
Large-scale Multi-label Learning with Missing Labels. , 2013
[Volltext] [Kurzfassung]
[BibTeX]
The multi-label classification problem has generated significant interest in recent years. However, existing approaches do not adequately address two key challenges: (a) the ability to tackle problems with a large number (say millions) of labels, and (b) the ability to handle data with missing labels. In this paper, we directly address both these problems by studying the multi-label problem in a generic empirical risk minimization (ERM) framework. Our framework, despite being simple, is surprisingly able to encompass several recent label-compression based methods which can be derived as special cases of our method. To optimize the ERM problem, we develop techniques that exploit the structure of specific loss functions - such as the squared loss function - to offer efficient algorithms. We further show that our learning framework admits formal excess risk bounds even in the presence of missing labels. Our risk bounds are tight and demonstrate better generalization performance for low-rank promoting trace-norm regularization when compared to (rank insensitive) Frobenius norm regularization. Finally, we present extensive empirical results on a variety of benchmark datasets and show that our methods perform significantly better than existing label compression based methods and can scale up to very large datasets such as the Wikipedia dataset.
Mirowski, P.; Ranzato, M. & LeCun, Y.: Dynamic Auto-Encoders for Semantic Indexing. In: of the NIPS 2010 Workshop on Deep Learning, P. (Hrsg.): 2010
[Volltext]
[BibTeX]
Breiman, L.: Random Forests. In:
Machine Learning 45 (2001), Nr. 1, S. 5-32
[Volltext]
[Kurzfassung]
[BibTeX]
Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the forest becomes large. The generalization error of a forest of tree classifiers depends on the strength of the individual trees in the forest and the correlation between them. Using a random selection of features to split each node yields error rates that compare favorably to