Pattern recognition based on similarity in linear semi-ordered spaces

  • Authors:

  • Juliusz L. Kulikowski;Malgorzata Przytulska

  • Affiliations:

  • M. Nalecz Institute of Biocybernetics and Biomedical Engineering PAS, Warsaw, Poland;M. Nalecz Institute of Biocybernetics and Biomedical Engineering PAS, Warsaw, Poland

  • Venue:
  • HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

In the paper an approach to pattern recognition based on a notion of similarity in linear semi-ordered (Kantorovitsch) space is presented. It is compared with other approaches based on the metric distance and on angular dilation measures in observation spaces. Basic assumptions of the Kantorovitsch space are shortly presented. It is shown that finite reference sets for pattern recognition take on in Kantorovitsch space formal structures presented by connectivity graphs which facilitate finding the reference vectors for pattern recognition.