Minimum spanning tree based one-class classifier

  • Authors:
  • Piotr Juszczak;David M. J. Tax;Elbieta Pekalska;Robert P. W. Duin

  • Affiliations:
  • Information and Communication Theory Group, Delft University of Technology, Delft, The Netherlands;Information and Communication Theory Group, Delft University of Technology, Delft, The Netherlands;School of Computer Science, University of Manchester, Manchester, UK;Information and Communication Theory Group, Delft University of Technology, Delft, The Netherlands

  • Venue:
  • Neurocomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

In the problem of one-class classification one of the classes, called the target class, has to be distinguished from all other possible objects. These are considered as non-targets. The need for solving such a task arises in many practical applications, e.g. in machine fault detection, face recognition, authorship verification, fraud recognition or person identification based on biometric data. This paper proposes a new one-class classifier, the minimum spanning tree class descriptor (MST_CD). This classifier builds on the structure of the minimum spanning tree constructed on the target training set only. The classification of test objects relies on their distances to the closest edge of that tree, hence the proposed method is an example of a distance-based one-class classifier. Our experiments show that the MST_CD performs especially well in case of small sample size problems and in high-dimensional spaces.