NEIGHBORHOOD GRAPHS IN CLASSIFICATION PROBLEMS FOR SYMBOLIC DATA(Symbolic Data Analysis)

Abstract

This paper presents new neighborhood graphs useful to solve feature selection problems in pattern recognition for symbolic data. In pattern recognition for symbolic data, each sample pattern is described not only by quantitative features but also by qualitative features. We introduce the Cartesian System Model (CSM) as a mathematical model to treat symbolic data. Then, we define the Generality Ordered Mutual Neighborhood Graph and the Generality Ordered Interclass Mutual Neighborhood Graph based on the CSM. These neighborhood graphs play central roles in seeing details of the interclass structures. We outline the basic idea of our classifier by using simple examples.

Journal

Journal of the Japanese Society of Computational Statistics   [List of Volumes]

Journal of the Japanese Society of Computational Statistics 15(2), 203-216, 2003-06  [Table of Contents]

Japanese Society of Computational Statistics

References:  8

You must have a user ID to see the references.If you already have a user ID, please click "Login" to access the info.New users can click "Sign Up" to register for an user ID.

Preview

Preview

Codes

  • NII Article ID (NAID) :
    110001235175
  • NII NACSIS-CAT ID (NCID) :
    AA10823693
  • Text Lang :
    ENG
  • Article Type :
    REV
  • ISSN :
    09152350
  • Databases :
    CJP  NII-ELS 

Export