A distance-based separator representation for pattern classification

Authors:
Frank Y. Shih;Kai Zhang
Affiliations:
Computer Vision Laboratory, College of Computing Sciences, New Jersey Institute of Technology, Newark, NJ 07102, United States;Computer Vision Laboratory, College of Computing Sciences, New Jersey Institute of Technology, Newark, NJ 07102, United States
Venue:
Image and Vision Computing
Year:
2008

Citing 4
Cited 1

Support-Vector Networks

Machine Learning
PCA versus LDA

IEEE Transactions on Pattern Analysis and Machine Intelligence
AI Game Programming Wisdom

AI Game Programming Wisdom
An improved incremental training algorithm for support vector machines using active query

Pattern Recognition

Quantitative Comparison of Similarity Measure and Entropy for Fuzzy Sets

ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In pattern classification, Principle Component Analysis (PCA) and Linear Discriminate Analysis (LDA) are commonly used to reduce the dimensionality of input feature space. However, there exist some problems such that how many eigen vectors are needed to be the most effective in the transformation map as well as the lack of optimal separability in low dimensional data. In this paper, we present a new distance-based separator representation to solve these problems. The representation frame structure keeps adjustment pertaining to the problem complexity, and its dimensionality corresponds to the number of classes. Experimental results show that the new representation outperforms the PCA and LDA representations in multi-class classification and low-dimensional classification.