Low-Rank Methods in Event Detection With Subsampled Point-to-Subspace Proximity Tests
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00361628" target="_blank" >RIV/68407700:21230/22:00361628 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/ACCESS.2022.3152206" target="_blank" >https://doi.org/10.1109/ACCESS.2022.3152206</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ACCESS.2022.3152206" target="_blank" >10.1109/ACCESS.2022.3152206</a>
Alternative languages
Result language
angličtina
Original language name
Low-Rank Methods in Event Detection With Subsampled Point-to-Subspace Proximity Tests
Original language description
Monitoring of streamed data to detect abnormal behaviour (variously known as event detection, anomaly detection, change detection, or outlier detection) underlies many applications, especially within the Internet of Things. There, one often collects data from a variety of sources, with asynchronous sampling, and missing data. In this setting, one can detect abnormal behavior using low-rank techniques. In particular, we assume that normal observations come from a low-rank subspace, prior to being corrupted by a uniformly distributed noise. Correspondingly, we aim to recover a representation of the subspace, and perform event detection by running point-to-subspace distance query for incoming data. We use a variant of low-rank factorisation, which considers interval uncertainty sets around "known entries", on a suitable flattening of the input data to obtain a low-rank model. On-line, we compute the distance of incoming data to the low-rank normal subspace and update the subspace to keep it consistent with the seasonal changes present. For the distance computation, we consider subsampling. We bound the one-sided error as a function of the number of coordinates employed. In our computational experiments, we test the proposed algorithm on induction-loop data from Dublin, Ireland.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Access
ISSN
2169-3536
e-ISSN
2169-3536
Volume of the periodical
10
Issue of the periodical within the volume
29.3.2022
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
32525-32536
UT code for WoS article
000776133300001
EID of the result in the Scopus database
2-s2.0-85124847588