Density-based averaging - A new operator for data fusion

  • Authors:
  • P. Angelov;R. Yager

  • Affiliations:
  • The School of Computing and Communications, InfoLab21, Lancaster University, Lancaster LA1 4WA, UK;Machine Intelligence Institute, Iona College, NY, USA

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.07

Visualization

Abstract

A new data fusion operator based on averaging that is weighted by the density of each particular data sample is introduced in this paper. The proposed approach differs from other weighted averages by its suitability to on-line, real-time applications due to the fact that recursive calculations are being used. It also differs by the fact that it is non-parametric. The proposed operator has a very wide area of possible applications same as the traditional average and most of the other weighted averages. This includes, but is not limited to clustering, classification, pattern recognition, group decision making approaches, data fusion, etc. Some illustrative numerical examples are provided mainly as a proof of concept, including its application to classification. Two simple, yet very effective classification approaches based on the density-based weights called 'one-rule-per-class' or 1R/C and on the minimum distance to weighted class mean has been introduced. Further work will focus on more application-oriented studies that cover various practical applications to clustering and use of different distance measures.