We present Gaussian mixture trees for density estimation and one class classification. A Gaussian mixture tree is a tree, where each node is associated with a Gaussian component. Each level of the tree provides a refinement of the data description of the level above. We show how this approach is applied to one class classification and how the hierarchical structure is exploited to significantly reduce computation time to make the approach suitable for real time systems. Experiments with synthetic data and data from a visual inspection task show that our approach compares favorably to flat Gaussian mixture models as well as one class support vector machines regarding both predictive performance and computation time.
CITATION STYLE
Richter, M., Längle, T., & Beyerer, J. (2017). Gaussian mixture trees for one class classification in automated visual inspection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10317 LNCS, pp. 341–351). Springer Verlag. https://doi.org/10.1007/978-3-319-59876-5_38
Mendeley helps you to discover research relevant for your work.