.png){kind=icon}
.png){kind=icon}
Return
Online change-point detection with kernels
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2022.109022.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Change-points in time series data are usually defined as the time instants at which changes in their properties occur. Detecting change-points is critical in a number of applications as diverse as detecting credit card and insurance frauds, or intrusions into networks. Recently the authors introduced an online kernelbased change-point detection method built upon direct estimation of the density ratio on consecutive time intervals. This paper further investigates this algorithm, making improvements and analyzing its behavior in the mean and mean square sense, in the absence and presence of a change point. These theoretical analyses are validated with Monte Carlo simulations. The detection performance of the algorithm is illustrated through experiments on real-world data and compared to state of the art methodologies. (c) 2022 Elsevier Ltd. All rights reserved.
Keywords:
Non -parametric change -point detection
Reproducing kernel Hilbert space
Kernel least -mean -square algorithm
Online algorithm
Convergence analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W