z-logo
open-access-imgOpen Access
Similarity Graph Neighborhoods for Enhanced Supervised Classification
Author(s) -
Anirban Chatterjee,
Padma Raghavan
Publication year - 2012
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2012.04.062
Subject(s) - computer science , support vector machine , artificial intelligence , classifier (uml) , pattern recognition (psychology) , linear classifier , subspace topology , graph , machine learning , linear discriminant analysis , random subspace method , supervised learning , artificial neural network , theoretical computer science
We consider transformations to enhance classification accuracy that are applied during the training phase of a supervised classifier with prelabeled data. We consider similarity graph neighborhoods (SGN) in the feature subspace of the training data to obtain a transformed dataset by determining displacements for each entity. Our SGN classifier is a supervised learning scheme that is trained on these transformed data; the separating boundary obtained is thereafter used for future classification. We discuss improvements in classification accuracy for an artificial dataset and present empirical results for Linear Discriminant (LD) classifier, Support Vector Machine (SVM), SGN-LD, and SGN-SVM for 6 well-known datasets from the University of California at Irvine (UCI) repository [1]. Our results indicate that on average SGN-LD improves accuracy by 5.0% and SGN-SVM improves it by 4.52%

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom