A Log-Based Anomaly Detection Method with Efficient Neighbor Searching and Automatic K Neighbor Selection

Abstract EN

Using the k-nearest neighbor (kNN) algorithm in the supervised learning method to detect anomalies can get more accurate results.

However, when using kNN algorithm to detect anomaly, it is inefficient at finding k neighbors from large-scale log data; at the same time, log data are imbalanced in quantity, so it is a challenge to select proper k neighbors for different data distributions.

In this paper, we propose a log-based anomaly detection method with efficient selection of neighbors and automatic selection of k neighbors.

First, we propose a neighbor search method based on minhash and MVP-tree.

The minhash algorithm is used to group similar logs into the same bucket, and MVP-tree model is built for samples in each bucket.

In this way, we can reduce the effort of distance calculation and the number of neighbor samples that need to be compared, so as to improve the efficiency of finding neighbors.

In the process of selecting k neighbors, we propose an automatic method based on the Silhouette Coefficient, which can select proper k neighbors to improve the accuracy of anomaly detection.

Our method is verified on six different types of log data to prove its universality and feasibility.