Anomaly Ranking in a High Dimensional Space: The Unsupervised TreeRank Algorithm

Abstract

Ranking unsupervised data in a multivariate feature space X R d , d 1 by degree of abnormality is of crucial importance in many applications (e.g., fraud surveillance, monitoring of complex systems/infrastructures such as energy networks or aircraft engines, system management in data centers). However, the learning aspect of unsupervised ranking has only received attention in the machinelearning community in the past few years. The Mass-Volume (MV) curve has been recently introduced in order to evaluate the performance of any scoring function s W X ! R with regard to its ability to rank unlabeled data. It is expected that relevant scoring functions will induce a preorder similar to that induced by the density function f .x/ of the (supposedly continuous) probability distribution of the statistical population under study. As far as we know, there is no efficient algorithm to build a scoring function from (unlabeled) training data with nearly optimal MV curve when the dimension d of the feature space is high. It is the major purpose of this chapter to introduce such an algorithm which we call the UNSUPERVISED TREERANK algorithm. Beyond its description and the statistical analysis of its performance, numerical experiments are exhibited in order to provide empirical evidence of its accuracy.

A review on ranking problems in statistical learning

“…They extend their TreeRank algorithm for supervised binary ranking problems (see Subsection 3.2) to this case. See also Goix et al [2015], Clémençon et al [2016] and Clémençon and Thomas [2017] as well as references therein for further details on anomaly ranking.…”