@inproceedings{4637164c85694d70a5cd6ca964f0d33e, title = "Incremental One-Class Learning with Bounded Computational Complexity", abstract = "An incremental one-class learning algorithm is proposed for the purpose of outlier detection. Outliers are identified by estimating - and thresholding - the probability distribution of the training data. In the early stages of training a non-parametric estimate of the training data distribution is obtained using kernel density estimation. Once the number of training examples reaches the maximum computationally feasible limit for kernel density estimation, we treat the kernel density estimate as a maximally-complex Gaussian mixture model, and keep the model complexity constant by merging a pair of components for each new kernel added. This method is shown to outperform a current state-of-the-art incremental one-class learning algorithm (Incremental SVDD [5]) on a variety of datasets, while requiring only an upper limit on model complexity to be specified.", author = "Sillito, {Rowland R.} and Bob. Fisher", year = "2007", doi = "10.1007/978-3-540-74690-4_7", language = "English", isbn = "978-3-540-74689-8", volume = "4668", series = "Lecture Notes in Computer Science", publisher = "Springer-Verlag GmbH", pages = "58--67", editor = "{Marques de Sa}, {Joaquim } and Alexandre, {Luis A} and Wlodzislaw Duch and Danilo Mandic", booktitle = "Artificial Neural Networks - ICANN 2007", }