A Classification Algorithm with Reject Option Based on Adaptive Minimum Spanning Tree Covering Model in High-dimensional Space

Hu  Zheng-Ping; Xu  Cheng-Qian; Jia Qian-Wen

doi:10.3724/SP.J.1146.2009.00021

Volume 32 Issue 12

Jan. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2010 > 32(12): 2895-2900

Hu Zheng-Ping, Xu Cheng-Qian, Jia Qian-Wen. A Classification Algorithm with Reject Option Based on Adaptive Minimum Spanning Tree Covering Model in High-dimensional Space[J]. Journal of Electronics & Information Technology, 2010, 32(12): 2895-2900. doi: 10.3724/SP.J.1146.2009.00021

Citation:

Hu Zheng-Ping, Xu Cheng-Qian, Jia Qian-Wen. A Classification Algorithm with Reject Option Based on Adaptive Minimum Spanning Tree Covering Model in High-dimensional Space[J]. Journal of Electronics & Information Technology, 2010, 32(12): 2895-2900. doi: 10.3724/SP.J.1146.2009.00021

Citation:

Hu Zheng-Ping, Xu Cheng-Qian, Jia Qian-Wen. A Classification Algorithm with Reject Option Based on Adaptive Minimum Spanning Tree Covering Model in High-dimensional Space[J]. Journal of Electronics & Information Technology, 2010, 32(12): 2895-2900. doi: 10.3724/SP.J.1146.2009.00021

PDF( 247 KB)

A Classification Algorithm with Reject Option Based on Adaptive Minimum Spanning Tree Covering Model in High-dimensional Space

doi: 10.3724/SP.J.1146.2009.00021

Received Date: 2010-01-08
Rev Recd Date: 2010-08-17
Publish Date: 2010-12-19

Abstract

Abstract

For small sample size problem in high-dimensional space, conventional classifiers with reject option based on statistical model could not construct appropriate covering decision boundary on data distribution. In this case, a novel adaptive Minimum Spanning Tree (MST) covering model based classifier with reject option is proposed in this paper according to the data distribution in high-dimensional space. The algorithm describes the target class using MST with the assumption that the edges of the graph are also basic elements of the classifier which offers additional virtual training data for a better coverage. By this model, similar samples from the same class are divided into a connected geometric coverage area, and similar samples from different classes are divided into different geometric coverage areas. Furthermore, in order to reduce the degradation of the rejection performance due to the existence of unreasonable additional virtual training data, an adjustable coverage radius strategy is presented in coverage construction. Then the test pattern of non-training classes could be rejected by the coverage decision boundary, and if a pattern is accepted in the cross coverage area, the recognition result is decided by the data fields model. Experiments show that the method is valid and efficient.
- Signal processing,
- Classification model with reject option,
- High-dimensional space,
- Minimum Spanning Tree (MST),
- Adaptive covering model

FullText(HTML)

References(1)

References

Camci Fatih and Chinnam R B. General support vector representation machine for one-class classification of non-stationary classes[J].Pattern Recognition.2008, 41(10):3021-3034[2]Lee Ki-young, Kim Dae-won, Lee Kwang-H, and Lee Doheon. Density-induced support vector data description [J].IEEE Transactions on Neural Networks.2007, 18(1):284-289[3]Guo S M, Chen L C, and Tsai J S H. A boundary method for outlier detection based on support vector domain description[J].Pattern Recognition.2009, 42(1):77-83[4]Zhu Xiao-kai and Yang De-gui. Multi-class support vector domain description for pattern recognition based on a measure of expansibility. Acta Electronica Sinica, 2009, 37(3): 464-469.[5]Wu Jian-ming. Multilayer Potts perceptrons with Levenberg- Marquardt learning[J].IEEE Transactions on Neural Networks.2008, 19(12):2032-2043[6]Kokiopoulou Effrosyni and Frossard Pasca. Minimum distance between pattern transformation manifolds: algorithm and applications[J].IEEE Transactions on Pattern Analysis and Machine Intelligence.2009, 31(7):1225-1237[7]Wright J, Yang A Y, Ganesh A, Sastry S S, and Ma Yi. Robust face recognition via sparse representation [J].IEEE Transactions on Pattern Analysis and Machine Intelligence.2009, 31(2):210-227[8]Lin Jia-xiang, Ye Dong-yi, Chen Chong-cheng, and Gao Miao-xian. Minimum spanning tree based spatial outlier mining and its applications. 3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008, Chengdu, China, 2008(5009 LNAI): 508-515.[9]Wu Li-li and Wang Shou-jue. Study on closed-set speaker identification based on biomimetic pattern recognition[J]. Chinese Journal of Electronics, 2009, 18(2): 259-261.[10]Wang Shou-jue and Liu Xing-xing. Mathematical symbols and computing methods in high dimensional biomimetic informatics and their applications[J]. Chinese Journal of Electronics, 2008, 17(1): 1-7.

Relative Articles

Supplements(0)

Cited By

Proportional views