Introduction
Anomaly detection aims to identify the samples that are deviant from the general data distribution zhao2019pyod. Most of the existing outlier detection algorithms are unsupervised due to the high cost of acquiring ground truth zhao2019lscp. It is noted that outlier detection can be viewed as a binary classification problem under extreme imbalance (i.e., the number of outliers is way smaller than the number of normal samples). As a result, using a single unsupervised model is risky by nature; it is sensible to use a large group of unsupervised models with variations, e.g., different algorithms, varying parameters, distinct views of the datasets, etc., and more reliable results may be achieved. Outlier ensemble methods that select and combine base detectors are designed for this purpose Aggarwal2013,zimek2014ensembles,Aggarwal2017. The simplest way is to take the average or maximum values across all the detectors as the final result Aggarwal2017. More complex combination can also be done in both unsupervised zhao2019lscp and semisupervised manners zhao2018xgbod.
However, both training and predicting with a large number of unsupervised detectors are computationally expensive. This problem is more severe on highdimensional large samples, especially for proximitybased algorithms that assume outliers behave very differently in specific regions aggarwal2016outlier. Most algorithms in this category, including k nearest neighbors (k
NN) Ramaswamy2000, local outlier factor (LOF) Breunig2000, and local outlier probabilities (LoOP) Kriegel2009, operate in Euclidean space and suffer from the curse of dimensionality. They can be prohibitively slow or even fail to work completely. The effort has been made to project highdimensional data to lower subspaces achlioptas2001database, like simple Principal Component Analysis (PCA) shyu2003novel and more complex subspace method HiCS keller2012hics. Engineering cures have been explored as well—the process can be expedited by parallelization on multiple workers (e.g., CPU cores) lozano2005parallel,oku2014parallel. Recently, knowledge distillation emerges as a popular way of compressing large neural network models hinton2015distilling, while its usage in outlier detection is still limited.
The aforementioned treatments face various challenges. First, deterministic projection methods, e.g., PCA, are fast but not ideal for building a large number of diversified outlier detectors—it results in the same subspace that cannot induce diversity for outlier ensembles. Complex projection and subspace methods may bring performance improvement for outlier mining, but the generalization capacity is often reduced with strong assumptions. They are not suited for generalpurpose outlier detector acceleration. Existing parallelization learning frameworks can be inefficient if training and prediction task assignments are not balanced among workers. In fact, a group of heterogeneous models can have significantly different computational cost. As a simple example, let us split 100 heterogeneous models into 4 groups (cores) for training. If group #2 takes significantly longer time than the others to finish, it will behave like the bottleneck of the system. More formally, the imbalanced task scheduling amplifies the impact of slower worker(s) in a system; the system efficiency is curbed by the slowest group. As we have shown in the later section, the existing parallel task scheduling algorithms in popular machine learning libraries like scikitlearn pedregosa2011scikit may be inefficient under this setting. In addition to these limitations, unsupervised models such as LOF can be slow (high time complexity), or even inappropriate, to predict on unseen data samples by nature. Another downside of unsupervised and nonparametric models is their limited interpretability. In summary, training and predicting with a large number of heterogeneous unsupervised models is computationally expensive, inefficient in parallelization, and limited in interpretability.
To tap the gap, we propose a threemodule acceleration framework called SUOD that leverages random projection, pseudosupervised approximation, and balanced parallel scheduling for scalability. For highdimensional data, SUOD
generates a random lowdimensional subspace for each unsupervised model by JohnsonLindenstrauss projection, on which the model is then trained. To improve the training and prediction efficiency in a distributed system, we propose a balanced parallel scheduling heuristic. The key idea is to forecast the running time of each model so that the workload could be evenly distributed among workers. If prediction is needed for unseen data, lower cost supervised regressors are initialized to approximate complex unsupervised models—the supervised models are trained on the original feature space using the outlier scores generated by unsupervised models as the “pseudo ground truth”. The rationale behind is efficient supervised models are faster for prediction and usually more interpretable; it can be viewed as a way of distilling knowledge from unsupervised models hinton2015distilling. Notably, all these three modules are designed to be fully independent for model acceleration from complementary perspectives. They have great flexibility to be mixed for different needs.
In this work, we make the following contributions:

Examine the effect of various deterministic and random projection methods on varying size and dimension datasets, and identify the applicable cases of using them for faster execution and diversity induction.

Identify an imbalanced scheduling issue in existing distributed learning systems for heterogeneous detectors and fix it by a new scheduling schema.

Conduct extensive experiments to analyze the results of using pseudosupervised regression models for approximating unsupervised outlier detectors. To our best knowledge, this is the first research attempt in outlier detection setting.

Demonstrate the effectiveness of the three modules independently, and the extensibility of combining them together as a scalable training and prediction framework.

To foster reproducibility, all code, figure, and datasets used in this study are openly shared^{1}^{1}1https://github.com/yzhao062/SUOD. A scalable implementation will also be included in PyOD zhao2019pyod soon.
Related Works
Outlier Detection and Outlier Ensembles
Anomaly detection has numerous important applications in various fields, such as rare disease detection li2018semi, fraudulent online review analysis akoglu2013opinion, and network intrusion detection lazarevic2003comparative. Despite, detecting outliers is a challenging classification task due to multiple reasons zhao2019lscp. First, anomalies only consist of a small portion of the entire data–extreme data imbalance incurs difficulty. Second, the limited amount of data and available labels impede learning data representation accurately. Third, the definition of outliers can be ambiguous; outliers may be heterogeneous that should be treated as a multiclass problem.
Most of the existing detection algorithms are unsupervised as ground truth is absent; acquiring labels can be prohibitively expensive in practice. As a result, there are a few established unsupervised anomaly detection algorithms like Isolation Forest liu2008isolation, Local Outlier Factor (LOF) Breunig2000, and Anglebased Outlier Detection (ABOD) Kriegel2009, with different assumptions of the underlying data. Regarding unsupervised deep models like autoencoders and generative adversarial networks liu2019generative, the amount of accessible data limits their effectiveness on learning representations. No algorithm could always outperform as the assumptions may be incorrect, and it is hard to asses without ground truth.
Therefore, relying on a single unsupervised model has an inherently high risk, and outlier ensembles that leverage a group of detectors become increasingly popular Aggarwal2013,zimek2014ensembles. There are a group of unsupervised outlier ensemble frameworks proposed in the last several years from simple average, maximization, weighted average, secondphase combination methods Aggarwal2017 to more complex selective models like SELECT rayana2016less and LSCP zhao2019lscp. Although unsupervised outlier ensembles methods can be effective in certain cases, they could not incorporate the existing ground truth information regardless of its richness. As a result, a group of semisupervised detection frameworks that leverage existing labels and enhance the data representation by unsupervised models are proposed. The representative ones include BORE micenkova2014learning and XGBOD zhao2018xgbod. They use unsupervised outlier detection scores as additional features to enhance the original feature space, which can be considered as unsupervised feature engineering or representation learning (extraction). It is noted that for both unsupervised and supervised outlier ensembles, a large group diversified unsupervised base detectors are needed—SUOD is therefore designed to facilitate this process.
Knowledge Distillation and Model Approximation
Knowledge distillation refers to the notion of compressing a or an ensemble of large, often cumbersome model(s) into a small and more interpretable model. This is often done by training an ensemble of large models (can be seen as “Teachers”) on a large dataset, followed by using a small and simple model (“Student”) to learn the output of the ensemble. There are two main motivations behind knowledge distillation: (i) to reduce the deploymenttime computational cost by replacing the large models with a small model and (ii) to increase interpretability as simple models are often more easy to be understood by human. This strategy has seen success in tasks including computer vision romero2014fitnets, automatic speech recognition hinton2015distilling, and neural machine translation Kim_2016. It is noted that the proposed
SUOD framework shares a similar concept as knowledge distillation for computational cost optimization but comes with a few fundamental differences as described in Algorithm Design section.Algorithm Design
The proposed SUOD contains three independent modules. As shown in Algorithm 1, the modules may be enabled if specific conditions are met. For highdimensional data, SUOD randomly project the original input onto lowerdimensional spaces (Module I). For expediting the training and prediction with a large number of models, a balanced parallel scheduling mechanism is proposed (Module II). If prediction on new samples is needed, an efficient supervised regressor may be initialized to approximate the output of each costly unsupervised detector for prediction (Module III).
Module I: Random Projection
A widely used algorithm to alleviate the curse of dimensionality on highdimensional data is the JohnsonLindenstraus (JL) projection johnson1984extensions, although its use in outlier mining is still unexplored. JL projection is a simple compression scheme without heavy distortion on the Euclidean distances of the data. Its builtin randomness is also useful for inducing diversity for outlier ensembles. Despite, projection may be less useful or even detrimental for methods like Isolation Forests and HBOS that rely on subspace splitting.
This linear transformation is defined as: given a set of data
each , let be a matrix with each entry drawing independently from a distribution or a Rademacher distribution. Then the JL projection is a function such that . JL projection randomly projects highdimensional data to lower dimension subspaces, but preserve the distance relationship between points. In fact, if we fix some , and let be the matrix such that each entry is from . For every , we have:(1) 
Furthermore, fix
to be the differences between vectors. Then, the above bound also shows that for a finite set of
vectors , the pairwise Euclidean distance is preserved within a factor of , if we reduce the vectors to dimensions.Four JL projection methods are therefore introduced for their great property in compression and diversity induction: (i) basic: the transformation matrix is generated by standard Gaussian; (ii) discrete: the transformation matrix is picked randomly from Rademacher distribution (uniform in ; (iii) circulant: the transformation matrix is obtained by rotating the subsequent rows from the first row which is generated from standard Gaussian and (iv) toeplitz: the first row and column of the transformation matrix are generated from standard Gaussian, and each diagonal uses a constant value from the first row and column.
Let denote a dataset with points and features. In this work, we only invoke the projection if the data dimension exceeds 20 (dimension threshold ) and reduce the original dimension by half (projection dimension ). SUOD check whether is higher the projection threshold . If so, a JL transformation matrix is initialized by one of the JL projection methods and is projected onto the dimension subspace by .
Module II: Balanced Parallel Scheduling
Balanced Parallel Scheduling (BPS) aims for assigning training and prediction tasks more evenly based on the model costs, across all available workers. For instance, one may train 25 detectors with varying parameters from each of the four algorithm groups {kNN, LOF, ABOD, OCSVM}, resulting in 100 models in total. The existing parallel frameworks, e.g., the voting machine in scikitlearn pedregosa2011scikit, will simply split the the models into 4 subgroups by order and schedule the first 25 models (all kNNs) on Core 1 (worker 1), the next 25 models on Core 2, etc. This does not account for the fact that within a group of heterogeneous detectors, the computational cost varies. Scheduling the task with equal number of models can result in highly imbalanced tasks. In the worst case scenario, one worker may be significantly slower than the rest, and the entire process halts. Obviously, this problem applies to both training and prediction stage.
The proposed BPS heuristic focuses on designing a more balanced schedule among workers. Ideally, all workers can finish the scheduled tasks within the similar duration of time and return the result. As shown in Fig. 1, we build a model cost predictor
to forecast the model running time (sum of 10 trails) given the input data size, input data dimension, and the algorithm embedding (onehot). Given the time and resource limitation, we built a training set with 11 algorithms on 47 benchmark datasets (see Experiment section for details), and a random forest regressor breiman2001random is trained on the dataset with 10fold cross validation. Although the fitted regressor does not have a high
score, the Spearman’s Rank correlation spearman1904proof consistently shows high value () with low pvalue (). This implies that even the cost predictor could not predict the running time precisely, it can predict the rank of the running time with high accuracy. As a result, we propose a scheduling heuristic by enforcing nearly equal sum of the rank on running time. Given there are models to be trained, cost predictor is first invoked to forecast the time cost for a given model in as . After the prediction is done, the predicted time is converted to a rank in . If there are cores (workers), each worker will be assigned a group of models to achieve the objective of minimizing the workload imbalance among workers (Eq. 2). So each group has a rank sum at around . One additional advantage of using rank is transferability: the running time will vary on different machines but the relative rank should preserve.(2) 
Module III: PseudoSupervised Approximation
Once the unsupervised models have been fitted on the reduced feature space generated in Module I or the original space (if no random projection is involved). SUOD can approximate and replace each of costly unsupervised model by a faster supervised regression model for predicting on unseen samples. In other words, not all unsupervised models should be replaced but only the expensive ones. There is no efficiency incentive to approximate fast algorithms like Isolation Forest. However, most of the proximitybased algorithms like kNN and LOF have high time complexity for prediction (upper bounded by ), which can be effectively replaced by fast supervised models like random forest (upper bounded by where
denotes the number of base trees). This “pseudosupervised” model uses the output of unsupervised models as “the pseudo ground truth”—the goal is to approximate and find a better mapping from the original input to “the output of an unsupervised model”. Ensemblebased tree models are recommended for their outstanding scalability, robustness to overfitting, and interpretability (e.g., feature importance). Notably, this process can also be viewed as using supervised regressors to distill knowledge from unsupervised models. However, our approximation is different from the established knowledge distillation mainly in three aspects. First, our approximation works in a fully unsupervised manner unlike the classic distillation under supervised settings. Second, our “teacher” and “student” models have totally different architectures with little to no similarity. For instance, we use random forest (an ensemble tree model) to approximate LOF (a proximitybased density estimation model). Third, our approximation leads to a clear interpretability improvement, whereas the student models in neural networks lack that. See Appendix
LABEL:append:approx_advantage.As shown in Algorithm 1, for each trained unsupervised model , a supervised regressor might be built with the original input and the pseudo ground truth (the output of ). The prediction on unseen data will be then made by . This approximation shows multiple benefits:

Compared with nonparametric unsupervised models, parametric supervised models may have lower space complexity and faster prediction speed.

Supervised models generally show better interpretability compared with unsupervised counterparts. For instance, random forest used in this work can generate feature importance automatically to facilitate understanding.

Not all unsupervised models are appropriate for making prediction. Taking LOF as an example, the fitted model is not supposed to predict on unseen data. A supervised approximator may be used for prediction in this case.
Numerical Experiments and Discussion
In this preliminary study, three independent experiments are conducted to understand: (i) how will random projection methods affect the performance of outlier detection algorithms; (ii) whether the proposed parallel scheduling algorithm brings performance improvement over the existing approaches and (iii) will pseudosupervised models lead to degraded prediction performance compared with the original unsupervised models? Because all three modules are independent and can be combined seamlessly, it is assumed that the (partly) combined framework should also work if individual components manage to work.
Datasets, Evaluation Metrics, and Implementation
More than 30 outlier detection benchmark datasets are used in this study^{2}^{2}2ODDS Library: http://odds.cs.stonybrook.edu^{3}^{3}3DAMI Datasets: http://www.dbs.ifi.lmu.de/research/outlierevaluation/DAMI); the detail is available on online supplementary due to the space limit. The data size varies from 219 (Glass) to 567,479 (HTTP) samples and the dimension ranges from 3 to 400. For both random projection and parallel scheduling experiments, full datasets are used for training. For the pseudosupervised approximation experiments, 60% of the data is used for training and the remaining 40% is set aside for validation. For all experiments, performance is evaluated by taking the average of 10 independent trials using area under the receiver operating characteristic (ROC) and precision at rank n (P@N). Both metrics are widely used in outlier research liu2008isolation,zimek2014ensembles,rayana2016less,Aggarwal2017,zhao2018xgbod,zhao2019lscp,liu2019generative.
All the unsupervised models are from Python Outlier Detection Toolbox (PyOD), a popular library for outlier mining zhao2019pyod. Supervised regressors and utility functions are from standard libraries (scikitlearn and numpy). For a fair comparison, none of the models involve parameter tuning process—the default values are used. As all three modules involve time profiling, the same machine (Intel i79700 @ 3.00 GHZ; 32 GB RAM) is used for a fair comparison.









Comparison among Projection Methods
To evaluate the effect of projection methods on outlier detector performance, we choose three expensive detection algorithms (ABOD, LOF, and kNN) to measure their execution time, ROC, and P@N with different projection methods. All three methods directly or indirectly measure sample similarity in the Euclidean space , e.g., pairwise sample distances, which is susceptible to the curse of dimensionality and projection may be particularly helpful.
Table 1 shows the comparison among four JL projection variations with original (no projection is used), PCA, and RS (randomly select features from the original features, used in Feature Bagging lazarevic2005feature and LSCP). First, all projection methods show superiority regarding time cost. Second, using RS method comes with high instability, and shows performance decrease on all three datasets. This observation agrees with the finding by Zhao et al. zhao2019lscp, in which they used an ensemble projection to overcome the instability. Third, PCA is slightly faster than JL projection methods, although the detector performance by PCA projection is not as good as the ones with JL projections as shown in subtable (b)(i). Moreover, PCA as a deterministic method, may not be ideal for inducing diversity in outlier ensembles, as it always result in the same sets of subspaces. Fourth, among all four JL projection methods, circulant and toeplitz outperform in most cases. Since toeplitz is slightly faster than circulant, it is a reasonable choice for reducing dimensionality and inducing diversity for the models that are susceptible to the curse of dimensionality.
The Effect of Balanced Parallel Scheduling
To verify the effectiveness of the proposed BPS algorithm, we run the following experiments by varying: (i) the size () and the dimension () of the datasets, (ii) the number of estimators to train () and (iii) the number of CPU cores (). The time elapsed is measured in seconds. Due to the space limit, we only show the comparison between the simple scheduling and BPS on Cardio (), PageBlocks (), and Pendigits (), by setting and .
More results can be found on the online supplementary, and the conclusion holds for all tested datasets. Table 2 shows that the proposed BPS has a clear edge over the simple scheduling mechanism (denoted as Simple in the tables) that equally splits the tasks by order. It yields a significant time reduction (denoted as % RED in the tables), and gets more significant if more estimators and cores are involved. For instance, if 500 estimators and 6 cores are used, the time reduction over the simple scheduling is more than 40%. This agrees with our assumption that the imbalanced task scheduling will lead to more inefficient consequences with the increasing number of estimators and workers, and will therefore benefit more from the proposed BPS heuristic.
The Analysis of PseudoSupervised Approximation
To better understand the behavior of the pseudosupervised approximation, we first generate 200 synthetic points with Normal distribution for outliers (40 points) and Uniform distribution for normal samples (160 points). In Fig.
2, we plot the decision surfaces of unsupervised models and their supervised approximators (random forest regressor). It is clear that the decision surfaces are different and some regularization effect appears (lower errors on Feature Bagging and kNN). One of the assumptions is that the approximation process improves the generalization ability of the model by “ignoring” the overfitted points. This fails to work with ABOD because it has a extremely coarse decision surfaces to approximate (see Fig. 2).Table 3 and 4 compare prediction performance between the original unsupervised models and pseudosupervised approximators on 8 datasets with 6 algorithms. These algorithms are known to be more computationally expensive than the supervised random forest regressors. The approximators with performance degradation are highlighted in bold and italicized in the tables. The prediction time comparison is omitted due to space limit, but the gain is clear (see online supplementary). Therefore, the focus is put on prediction ROC and P@N to see whether the approximators could predict unseen data as good as the original unsupervised models. The acceptable threshold of performance degradation between an approximator and its original unsupervised models is set as and any negative difference larger than will be regarded as degradation. The tables reveal that not all the algorithms can be approximated well by supervised regressors: ABOD has a performance decrease regarding ROC on multiple datasets. ABOD is a linear models that look for a lowerdimensional subspace to embed the normal samples aggarwal2016outlier, so the approximation may not work if it has extremely complex decision surfaces as mentioned before. In contrast, proximitybased models that aim to identify specific Euclidean regions in which outliers are different, benefit from the approximation. Both table shows, kNN, LoF, and AkNN (average kNN) experience an performance gain. Specifically, all three algorithms yield around 100% ROC increase on HTTP. Other algorithms, such as Feature Bagging and CBLOF, the ROC and PRC performances stay within the acceptable range. In other words, it is useful to perform pseudosupervised approximation for these estimators as the time efficiency is improved at little to no loss in accuracy. Through the visualization and quantitative comparisons, we believe that the proposed pseudosupervised approximation is meaningful for prediction acceleration.
Simple  BPS  % RED  

1831  21  100  2  26.33  19.85  24.61 
1831  21  100  4  17.93  13.69  23.65 
1831  21  100  6  19.16  15.23  20.51 
1831  21  500  2  100.51  72.16  28.21 
1831  21  500  4  80.38  39.46  50.91 
1831  21  500  6  55.3  32.78  40.72 
5393  10  100  2  51.11  35.17  31.19 
5393  10  100  4  42.49  16.23  61.80 
5393  10  100  6  38.45  16.97  55.86 
5393  10  500  2  197.84  137.46  30.52 
5393  10  500  4  167.36  76.14  54.51 
5393  10  500  6  127.08  66.29  47.84 
6870  16  100  2  80.89  67.23  16.89 
6870  16  100  4  68.31  35.29  48.34 
6870  16  100  6  49.19  24.18  50.84 
6870  16  500  2  336.54  286.14  14.98 
6870  16  500  4  345.69  164.02  52.55 
6870  16  500  6  211.34  113.13  46.47 
Conclusion and Future Directions
In this work, a threemodule framework called SUOD is proposed to accelerate the training and prediction with a large number of unsupervised anomaly detectors. The three modules in SUOD focus on different perspectives of scalability enhancement: (i) Random Projection module generates lowerdimensional subspaces to alleviate the curse of dimensionality using toeplitz JohnsonLindenstraus projection; (ii) Balanced Parallel Scheduling module ensures that nearly equal amount of workloads are assigned to multiple workers in parallel training and prediction and (iii) Pseudosupervised Approximation module could accelerate costly unsupervised models’ prediction speed by replacing them by scalable supervised regressors, which also brings the extra benefit regarding interpretability and storage cost. The extensive experiments on more than 30 benchmark datasets empirically show the great potential of SUOD, and many intriguing results are observed. To improve the model reproducibility and accessibility, all code, figures, implementation for demo and production, will be released^{4}^{4}4https://github.com/yzhao062/SUOD.
Many investigations are underway. First, we would like to demonstrate SUOD’s effectiveness as an endtoend framework by combining three modules, and provide an easy to use toolkit in Python. Three additional experiments may be conducted to show that SUOD is useful for: (i) simple combination like majority vote and maximization zhao2020combo; (ii) more complex unsupervised model combination like LSCP zhao2019lscp and (iii) supervised outlier combination algorithms such as XGBOD zhao2018xgbod. Second, although we provide a prebuilt model cost predictor as part of the framework, a retrainable cost predictor is expected so practitioners can make accurate prediction on their machines. Third, we would further emphasize the interpretability provided by the pseudosupervised approximation, which can be beyond simple feature importance provided in tree regressors. Fourth, we see there is room to investigate why and how the pseudosupervised approximation could work in a more strict and theoretical way. Specifically, we want to know how to choose supervised regressors and under what conditions the approximation could work. This study, as the first step, empirically shows that proximitybased models benefit from the approximation, whereas linear models may not. Lastly, we want to verify that SUOD can work with realworld use cases. We are in contact with a pharmaceutical consultancy firm to access their rare disease detection datasets (which can be viewed as an outlier detection task). Microsoft Malware Dataset^{5}^{5}5https://www.kaggle.com/c/microsoftmalwareprediction is also chosen to explore SUOD’s applicability.
Dataset  Annthyroid  Breastw  Cardio  HTTP  MNIST  Pendigits  Pima  Satellite  

Model  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr 
ABOD  0.83  0.71  0.92  0.93  0.63  0.53  0.15  0.13  0.81  0.79  0.67  0.82  0.66  0.70  0.59  0.68 
CBLOF  0.67  0.68  0.96  0.98  0.73  0.76  1.00  1.00  0.85  0.89  0.93  0.93  0.63  0.68  0.72  0.77 
FB  0.81  0.45  0.34  0.10  0.61  0.70  0.34  0.97  0.72  0.83  0.39  0.51  0.59  0.63  0.53  0.64 
KNN  0.80  0.79  0.97  0.97  0.73  0.75  0.19  0.85  0.85  0.86  0.74  0.87  0.69  0.71  0.68  0.75 
AKNN  0.81  0.82  0.97  0.97  0.67  0.72  0.19  0.88  0.84  0.85  0.72  0.87  0.69  0.71  0.66  0.74 
LOF  0.74  0.85  0.44  0.45  0.60  0.68  0.35  0.75  0.72  0.76  0.38  0.47  0.59  0.65  0.53  0.66 
Dataset  Annthyroid  Breastw  Cardio  HTTP  MNIST  Pendigits  Pima  Satellite  

Model  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr  Orig  Appr 
ABOD  0.31  0.08  0.80  0.83  0.27  0.20  0.00  0.00  0.40  0.27  0.05  0.05  0.48  0.52  0.41  0.46 
CBLOF  0.25  0.24  0.86  0.90  0.31  0.34  0.02  0.01  0.42  0.48  0.35  0.36  0.43  0.48  0.54  0.57 
FB  0.24  0.02  0.03  0.07  0.23  0.26  0.02  0.04  0.34  0.36  0.03  0.07  0.37  0.44  0.37  0.42 
KNN  0.30  0.32  0.89  0.89  0.37  0.46  0.03  0.03  0.42  0.45  0.08  0.06  0.47  0.47  0.49  0.53 
AKNN  0.30  0.33  0.88  0.89  0.34  0.40  0.03  0.03  0.41  0.45  0.05  0.13  0.48  0.49  0.47  0.52 
LOF  0.27  0.36  0.19  0.35  0.23  0.23  0.01  0.03  0.33  0.32  0.03  0.08  0.40  0.44  0.37  0.42 
References
 [Achlioptas2001] Achlioptas, D. 2001. Databasefriendly random projections. In PODS, 274–281. ACM.
 [Aggarwal and Sathe2017] Aggarwal, C. C., and Sathe, S. 2017. Outlier ensembles: An introduction. Springer, 1st edition.
 [Aggarwal2013] Aggarwal, C. C. 2013. Outlier ensembles: position paper. ACM SIGKDD Explorations Newsletter 14(2):49–58.
 [Aggarwal2016] Aggarwal, C. C. 2016. Outlier Analysis. Springer.
 [Akoglu, Chandy, and Faloutsos2013] Akoglu, L.; Chandy, R.; and Faloutsos, C. 2013. Opinion fraud detection in online reviews by network effects. In ICWSM.
 [Breiman2001] Breiman, L. 2001. Random forests. Machine learning.
 [Breunig et al.2000] Breunig, M. M.; Kriegel, H.P.; Ng, R. T.; and Sander, J. ö. r. 2000. LOF: Identifying DensityBased Local Outliers. SIGMOD 1–12.
 [Hinton, Vinyals, and Dean2015] Hinton, G.; Vinyals, O.; and Dean, J. 2015. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531.
 [Johnson and Lindenstrauss1984] Johnson, W. B., and Lindenstrauss, J. 1984. Extensions of lipschitz mappings into a hilbert space. Contemporary mathematics 26(189206):1.
 [Keller, Muller, and Bohm2012] Keller, F.; Muller, E.; and Bohm, K. 2012. Hics: High contrast subspaces for densitybased outlier ranking.
 [Kim and Rush2016] Kim, Y., and Rush, A. M. 2016. Sequencelevel knowledge distillation. EMNLP.
 [Kriegel et al.2009] Kriegel, H.P.; Kr ö ger, P.; Schubert, E.; and Zimek, A. 2009. LoOP: local outlier probabilities. CIKM.
 [Lazarevic and Kumar2005] Lazarevic, A., and Kumar, V. 2005. Feature bagging for outlier detection. In KDD, 157–166. ACM.
 [Lazarevic et al.2003] Lazarevic, A.; Ertoz, L.; Kumar, V.; Ozgur, A.; and Srivastava, J. 2003. A comparative study of anomaly detection schemes in network intrusion detection. In SDM.
 [Li et al.2018] Li, W.; Wang, Y.; Cai, Y.; Arnold, C.; Zhao, E.; and Yuan, Y. 2018. Semisupervised rare disease detection using generative adversarial network. In NeurIPS Workshop.

[Liu et al.2019]
Liu, Y.; Li, Z.; Zhou, C.; Jiang, Y.; Sun, J.; Wang, M.; and He, X.
2019.
Generative adversarial active learning for unsupervised outlier detection.
TKDE.  [Liu, Ting, and Zhou2008] Liu, F. T.; Ting, K. M.; and Zhou, Z.H. 2008. Isolation forest. In ICDM, 413–422. IEEE.
 [Lozano and Acufia2005] Lozano, E., and Acufia, E. 2005. Parallel algorithms for distancebased and densitybased outliers. In ICDM.
 [Micenková, McWilliams, and Assent2014] Micenková, B.; McWilliams, B.; and Assent, I. 2014. Learning outlier ensembles: The best of both worlds–supervised and unsupervised. In SIGKDD Workshop.
 [Oku, Tamura, and Kitakami2014] Oku, J.; Tamura, K.; and Kitakami, H. 2014. Parallel processing for distancebased outlier detection on a multicore cpu. In IWCIA.
 [Pedregosa et al.2011] Pedregosa, F.; Varoquaux, G.; Gramfort, A.; Michel, V.; Thirion, B.; Grisel, O.; Blondel, M.; Prettenhofer, P.; Weiss, R.; Dubourg, V.; et al. 2011. Scikitlearn: Machine learning in python. JMLR 12(Oct):2825–2830.
 [Ramaswamy et al.2000] Ramaswamy, S.; Rastogi, R.; Shim, K.; Hill, M.; Shim, K.; and Ramaswamy, Sridhar, Rajeev rastogi, K. S. 2000. Efficient algorithms for mining outliers from large data sets. ACM SIGMOD Record 29(2):427–438.
 [Rayana and Akoglu2016] Rayana, S., and Akoglu, L. 2016. Less is more: Building selective anomaly ensembles. TKDD 10(4):42.
 [Romero et al.2014] Romero, A.; Ballas, N.; Kahou, S. E.; Chassang, A.; Gatta, C.; and Bengio, Y. 2014. Fitnets: Hints for thin deep nets. arXiv preprint arXiv:1412.6550.

[Shyu et al.2003]
Shyu, M.L.; Chen, S.C.; Sarinnapakorn, K.; and Chang, L.
2003.
A novel anomaly detection scheme based on principal component classifier.
Technical report.  [Spearman1904] Spearman, C. 1904. The proof and measurement of association between two things. AJP.
 [Zhao and Hryniewicki2018] Zhao, Y., and Hryniewicki, M. K. 2018. Xgbod: Improving supervised outlier detection with unsupervised representation learning. In IJCNN. IEEE.
 [Zhao et al.2019] Zhao, Y.; Nasrullah, Z.; Hryniewicki, M. K.; and Li, Z. 2019. LSCP: locally selective combination in parallel outlier ensembles. In SDM, 585–593.
 [Zhao et al.2020] Zhao, Y.; Wang, X.; Cheng, C.; and Ding, X. 2020. Combining machine learning models and scores using combo library. In AAAI.
 [Zhao, Nasrullah, and Li2019] Zhao, Y.; Nasrullah, Z.; and Li, Z. 2019. PyOD: A python toolbox for scalable outlier detection. JMLR.
 [Zimek, Campello, and Sander2014] Zimek, A.; Campello, R. J.; and Sander, J. 2014. Ensembles for unsupervised outlier detection: challenges and research questions a position paper. ACM SIGKDD Explorations Newsletter 15(1):11–22.
Comments
There are no comments yet.