Open AccessSensor fusion using entropic measures of dependence
Author(s) -
Paul B. Deignan
Publication year - 2011
Publication title -
revista de matemáticas
Language(s) - English
Resource type - Journals
eISSN - 2215-3373
pISSN - 1409-2433
DOI - 10.15517/rmta.v18i2.2099
Subject(s) - categorical variable , data mining , sensor fusion , computer science , set (abstract data type) , bayesian probability , probabilistic logic , data set , kullback–leibler divergence , anomaly detection , artificial intelligence , algorithm , machine learning , programming language
As opposed to standard methods of association which rely on measures of central dispersion, entropic measures quantify multivalued relations. This distinction is especially important when high fidelity models of the sensed phenomena do not exist. The properties of entropic measures are shown to fit within the Bayesian framework of hierarchical sensor fusion. A method of estimating probabilistic structure for categorical and continuous valued measurements that is unbiased for finite data collections is presented. Additionally, a branch and bound method for optimal sensor suite selection suitable for either target refinement or anomaly detection is described. Finally, the methodology is applied against a known data set used in a standard data mining competition that features both sparse categorical and ontinuous valued descriptors of a target. Excellent quantitative and computational results against this data set support the conclusion that the proposed methodology is promising for general purpose low level data fusion.