@inproceedings{bodesheim2013approximations,
    type = {inproceedings},
    key = {bodesheim2013approximations},
    title = {Approximations of Gaussian Process Uncertainties for Visual Recognition Problems},
    author = {Paul Bodesheim and Alexander Freytag and Erik Rodner and Joachim Denzler},
    booktitle = {Scandinavian Conference on Image Analysis (SCIA)},
    year = {2013},
    pages = {182-194},
    abstract = {Gaussian processes offer the advantage of calculating the classification uncertainty in terms of predictive variance associated with the classification result. This is especially useful to select informative samples in active learning and to spot samples of previously unseen classes known as novelty detection. However, the Gaussian process framework suffers from high computational complexity leading to computation times too large for practical applications. Hence, we propose an approximation of the Gaussian process predictive variance leading to rigorous speedups. The complexity of both learning and testing the classification model regarding computational time and memory demand decreases by one order with respect to the number of training samples involved. The benefits of our approximations are verified in experimental evaluations for novelty detection and active learning of visual object categories on the datasets C-Pascal of Pascal VOC 2008, Caltech-256, and ImageNet.},
    doi = {10.1007/978-3-642-38886-6_18},
    groups = {lifelonglearning,noveltydetection,gaussianprocesses},
    url = {https://doi.org/10.1007/978-3-642-38886-6_18},
}