.png){kind=icon}
.png){kind=icon}
Return
Minimum spanning tree based one-class classifier
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2008.05.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2008 Elsevier B.V. All rights reserved.
Keywords:
One-class classification
Novelty detection
Minimum spanning tree
Recognition
Class oriented description
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W