Marzena Kryszkiewicz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marzena Kryszkiewicz has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Henryk Rybiński
Institute of Computer Science, Warsaw University of Technology, Warszawa, Poland
2 shared publications - Javier Del Ser
University of the Basque Country UPV/EHU
2 shared publications - Jesús López Lobo
TECNALIA Basque Research and Technology Alliance (BRTA) 48160 Derio Bizkaia Spain
2 shared publications - Piotr Maciąg
Institute of Computer Science Warsaw University of Technology Nowowiejska 15/19 00-665 Warsaw Poland
2 shared publications - Robert Bembenik
Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
2 shared publications - Bartłomiej Jańczak
Warsaw University of Technology
1 shared publication
Latest Publications
- 21 April 2025
- Published by Springer Nature
- p. 371-381
Jaccard Distance Under Incompleteness
- 13 August 2024
- Published by Springer Nature
- p. 341-349
A New Approach to Deriving Jaccard Similarity and Jaccard Distance Properties with and without Considering Feature Weights
- 13 August 2024
- Published by Springer Nature
- p. 341-349
A New Approach to Deriving Jaccard Similarity and Jaccard Distance Properties with and without Considering Feature Weights
- 16 September 2021
- Published by Springer Nature
- p. 18-34
Determining Tanimoto Similarity Neighborhoods of Real-Valued Vectors by Means of the Triangle Inequality and Bounds on Lengths
- 16 September 2021
- Published by Springer Nature
- p. 18-34
Determining Tanimoto Similarity Neighborhoods of Real-Valued Vectors by Means of the Triangle Inequality and Bounds on Lengths
- Open Access
- 1 July 2021
- Published by Elsevier in Neural Networks
- Vol. 139, 118-139
Unsupervised Anomaly Detection in Stream Data with Online Evolving Spiking Neural Networks
- 1 July 2021
- Published by Elsevier in Neural Networks
- Vol. 139, 118-139
Open AccessUnsupervised Anomaly Detection in Stream Data with Online Evolving Spiking Neural Networks
- Open Access
Unsupervised Anomaly Detection in Stream Data with Online Evolving Spiking Neural Networks
Unsupervised anomaly discovery in stream data is a research topic with many practical applications. However, in many cases, it is not easy to collect enough training data with labeled anomalies for supervised learning of an anomaly detector in order to deploy it later for identification of real anomalies in streaming data. It is thus important to design anomalies detectors that can correctly detect anomalies without access to labeled training data. Our idea is to adapt the Online evolving Spiking Neural Network (OeSNN) classifier to the anomaly detection task. As a result, we offer an Online evolving Spiking Neural Network for Unsupervised Anomaly Detection algorithm (OeSNN-UAD), which, unlike OeSNN, works in an unsupervised way and does not separate output neurons into disjoint decision classes. OeSNN-UAD uses our proposed new two-step anomaly detection method. Also, we derive new theoretical properties of neuronal model and input layer encoding of OeSNN, which enable more effective and efficient detection of anomalies in our OeSNN-UAD approach. The proposed OeSNN-UAD detector was experimentally compared with state-of-the-art unsupervised and semi-supervised detectors of anomalies in stream data from the Numenta Anomaly Benchmark and Yahoo Anomaly Datasets repositories. Our approach outperforms the other solutions provided in the literature in the case of data streams from the Numenta Anomaly Benchmark repository. Also, in the case of real data files of the Yahoo Anomaly Benchmark repository, OeSNN-UAD outperforms other selected algorithms, whereas in the case of Yahoo Anomaly Benchmark synthetic data files, it provides competitive results to the results recently reported in the literature.
Open AccessUnsupervised Anomaly Detection in Stream Data with Online Evolving Spiking Neural Networks
Unsupervised anomaly discovery in stream data is a research topic with many practical applications. However, in many cases, it is not easy to collect enough training data with labeled anomalies for supervised learning of an anomaly detector in order to deploy it later for identification of real anomalies in streaming data. It is thus important to design anomalies detectors that can correctly detect anomalies without access to labeled training data. Our idea is to adapt the Online evolving Spiking Neural Network (OeSNN) classifier to the anomaly detection task. As a result, we offer an Online evolving Spiking Neural Network for Unsupervised Anomaly Detection algorithm (OeSNN-UAD), which, unlike OeSNN, works in an unsupervised way and does not separate output neurons into disjoint decision classes. OeSNN-UAD uses our proposed new two-step anomaly detection method. Also, we derive new theoretical properties of neuronal model and input layer encoding of OeSNN, which enable more effective and efficient detection of anomalies in our OeSNN-UAD approach. The proposed OeSNN-UAD detector was experimentally compared with state-of-the-art unsupervised and semi-supervised detectors of anomalies in stream data from the Numenta Anomaly Benchmark and Yahoo Anomaly Datasets repositories. Our approach outperforms the other solutions provided in the literature in the case of data streams from the Numenta Anomaly Benchmark repository. Also, in the case of real data files of the Yahoo Anomaly Benchmark repository, OeSNN-UAD outperforms other selected algorithms, whereas in the case of Yahoo Anomaly Benchmark synthetic data files, it provides competitive results to the results recently reported in the literature.
- 14 February 2018
- Published by Springer Nature
- p. 550-561
Representative Rule Templates for Association Rules Satisfying Multiple Canonical Evaluation Criteria
- 14 February 2018
- Published by Springer Nature
- p. 550-561
Representative Rule Templates for Association Rules Satisfying Multiple Canonical Evaluation Criteria
- 26 February 2017
- Published by Springer Nature
- p. 673-684
Virtual Balancing of Decision Classes
- 24 December 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 148 (1-2) , 65-85
ACBC-Adequate Association and Decision Rules Versus Key Generators and Rough Sets Approximations
In this paper, we propose an ACBC-evaluation formula, which delivers a flexible way of formulating different kinds of criteria for association and decision rules. We prove that rules with minimal antecedents that fulfill ACBC-evaluation formulae are
- 24 December 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 148 (1-2) , 65-85
ACBC-Adequate Association and Decision Rules Versus Key Generators and Rough Sets Approximations
In this paper, we propose an ACBC-evaluation formula, which delivers a flexible way of formulating different kinds of criteria for association and decision rules. We prove that rules with minimal antecedents that fulfill ACBC-evaluation formulae are
- 14 July 2016
- Published by Springer Nature
- p. 80-94
Explicit Contrast Patterns Versus Minimal Jumping Emerging Patterns for Lazy Classification in High Dimensional Data
- 14 July 2016
- Published by Springer Nature
- p. 80-94
Explicit Contrast Patterns Versus Minimal Jumping Emerging Patterns for Lazy Classification in High Dimensional Data