Combining Entropy Measures for Anomaly Detection

The combination of different sources of information is a problem that arises in several situations, for instance, when data are analysed using different similarity measures. Often, each source of information is given as a similarity, distance, or a kernel matrix. In this paper, we propose a new clas...

Full description

Bibliographic Details
Main Authors: Alberto Muñoz, Nicolás Hernández, Javier M. Moguerza, Gabriel Martos
Format: Article
Language:English
Published: MDPI AG 2018-09-01
Series:Entropy
Subjects:
Online Access:http://www.mdpi.com/1099-4300/20/9/698
id doaj-8fa53efc4eec4bcd8d085cfbcf4cce9c
record_format Article
spelling doaj-8fa53efc4eec4bcd8d085cfbcf4cce9c2020-11-25T00:41:16ZengMDPI AGEntropy1099-43002018-09-0120969810.3390/e20090698e20090698Combining Entropy Measures for Anomaly DetectionAlberto Muñoz0Nicolás Hernández1Javier M. Moguerza2Gabriel Martos3Department of Statistics, Universidad Carlos III de Madrid, 28903 Getafe, Madrid, SpainDepartment of Statistics, Universidad Carlos III de Madrid, 28903 Getafe, Madrid, SpainDepartment of Computer Science and Statistics, University Rey Juan Carlos, 28933 Móstoles, Madrid, SpainDepartment of Mathematics and Statistics, Universidad Torcuato Di Tella and CONICET, Buenos Aires C1428BCW, ArgentinaThe combination of different sources of information is a problem that arises in several situations, for instance, when data are analysed using different similarity measures. Often, each source of information is given as a similarity, distance, or a kernel matrix. In this paper, we propose a new class of methods which consists of producing, for anomaly detection purposes, a single Mercer kernel (that acts as a similarity measure) from a set of local entropy kernels and, at the same time, avoids the task of model selection. This kernel is used to build an embedding of data in a variety that will allow the use of a (modified) one-class Support Vector Machine to detect outliers. We study several information combination schemes and their limiting behaviour when the data sample size increases within an Information Geometry context. In particular, we study the variety of the given positive definite kernel matrices to obtain the desired kernel combination as belonging to that variety. The proposed methodology has been evaluated on several real and artificial problems.http://www.mdpi.com/1099-4300/20/9/698entropy kernelkernel combinationKarcher meananomaly detectionfunctional data
collection DOAJ
language English
format Article
sources DOAJ
author Alberto Muñoz
Nicolás Hernández
Javier M. Moguerza
Gabriel Martos
spellingShingle Alberto Muñoz
Nicolás Hernández
Javier M. Moguerza
Gabriel Martos
Combining Entropy Measures for Anomaly Detection
Entropy
entropy kernel
kernel combination
Karcher mean
anomaly detection
functional data
author_facet Alberto Muñoz
Nicolás Hernández
Javier M. Moguerza
Gabriel Martos
author_sort Alberto Muñoz
title Combining Entropy Measures for Anomaly Detection
title_short Combining Entropy Measures for Anomaly Detection
title_full Combining Entropy Measures for Anomaly Detection
title_fullStr Combining Entropy Measures for Anomaly Detection
title_full_unstemmed Combining Entropy Measures for Anomaly Detection
title_sort combining entropy measures for anomaly detection
publisher MDPI AG
series Entropy
issn 1099-4300
publishDate 2018-09-01
description The combination of different sources of information is a problem that arises in several situations, for instance, when data are analysed using different similarity measures. Often, each source of information is given as a similarity, distance, or a kernel matrix. In this paper, we propose a new class of methods which consists of producing, for anomaly detection purposes, a single Mercer kernel (that acts as a similarity measure) from a set of local entropy kernels and, at the same time, avoids the task of model selection. This kernel is used to build an embedding of data in a variety that will allow the use of a (modified) one-class Support Vector Machine to detect outliers. We study several information combination schemes and their limiting behaviour when the data sample size increases within an Information Geometry context. In particular, we study the variety of the given positive definite kernel matrices to obtain the desired kernel combination as belonging to that variety. The proposed methodology has been evaluated on several real and artificial problems.
topic entropy kernel
kernel combination
Karcher mean
anomaly detection
functional data
url http://www.mdpi.com/1099-4300/20/9/698
work_keys_str_mv AT albertomunoz combiningentropymeasuresforanomalydetection
AT nicolashernandez combiningentropymeasuresforanomalydetection
AT javiermmoguerza combiningentropymeasuresforanomalydetection
AT gabrielmartos combiningentropymeasuresforanomalydetection
_version_ 1725286347675009024