Abstract
Data stream mining seeks to extract useful information from quickly-arriving, infinitely-sized and evolving data streams. Although these challenges have been addressed throughout the literature, none of them can be considered "solved." We contribute to closing this gap for the task of data stream clustering by proposing two modifications to the well-known ClusTree data stream clustering algorithm: pruning unused branches and detecting concept drift. Our experimental results show the difficulty in tackling these aspects of data stream mining and the sensitivity of stream mining algorithms to parameter values. We conclude that further research is required to better equip stream learners for the data stream clustering task.

Abstract

Abstract
Existing approaches for detecting anomalous events in time-evolving networks usually focus on detecting events involving the majority of the nodes, which affect the overall structure of the network. Since events involving just a small subset of nodes usually do not affect the overall structure of the network, they are more difficult to spot. In this context, tensor decomposition based methods usually beat other techniques in detecting global events, but fail at spotting localized event patterns. We tackle this problem by replacing the batch decomposition with a sliding window decomposition, which is further mined in an unsupervised way using statistical tools. Via experimental results in one synthetic and four real-world networks, we show the potential of the proposed method in the detection and specification of local events. © Springer Nature Switzerland AG 2019.

Abstract

Abstract

Abstract
The high asymmetry of international termination rates, where calls are charged with higher values, are fertile ground for the appearance of frauds in Telecom Companies. In this paper, we present a solution for a real problem called Interconnect Bypass Fraud. This problem is one of the most expressive in the telecommunication domain and can be detected by the occurrence of burst of calls from specific numbers. Based on this assumption, we propose the adoption of a new fast forgetting technique that works together with the Lossy Counting algorithm. Our goal is to detect as soon as possible items with abnormal behaviours, e.g. bursts of calls, repetitions and mirror behaviours. The results shows that our technique not only complements the techniques used by the telecom company but also improves the performance of the Lossy Counting algorithm in terms of runtime, memory used and sensibility to detect the abnormal behaviours. Copyright © by the paper's authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).