资源论文Robust Random Cut Forest Based Anomaly Detection On Streams

Robust Random Cut Forest Based Anomaly Detection On Streams

2020-03-06 | |  114 |   54 |   0

Abstract

In this paper we focus on the anomaly detection problem for dynamic data streams through the lens of random cut forests. We investigate a robust random cut data structure that can be used as a sketch or synopsis of the input stream. We provide a plausible definition of non-parametric anomalies based on the infiuence of an unseen point on the remainder of the data, i.e., the exter nality imposed by that point. We show how the sketch can be efficiently updated in a dynamic data stream. We demonstrate the viability of the algorithm on publicly available real data.

上一篇:PAC learning of Probabilistic Automaton based on the Method of Moments

下一篇: Opponent Modeling in Deep Reinforcement Learning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...