Design of Multicolor Voronoi Classifier with Gradually Local Learning Ablility

Pei Ji-hong; Yang Xuan

Volume 26 Issue 10

Oct. 2004

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2004 > 26(10): 1613-1619

Pei Ji-hong, Yang Xuan. Design of Multicolor Voronoi Classifier with Gradually Local Learning Ablility[J]. Journal of Electronics & Information Technology, 2004, 26(10): 1613-1619.

Citation:

Pei Ji-hong, Yang Xuan. Design of Multicolor Voronoi Classifier with Gradually Local Learning Ablility[J]. Journal of Electronics & Information Technology, 2004, 26(10): 1613-1619.

Pei Ji-hong, Yang Xuan. Design of Multicolor Voronoi Classifier with Gradually Local Learning Ablility[J]. Journal of Electronics & Information Technology, 2004, 26(10): 1613-1619.

Citation:

Pei Ji-hong, Yang Xuan. Design of Multicolor Voronoi Classifier with Gradually Local Learning Ablility[J]. Journal of Electronics & Information Technology, 2004, 26(10): 1613-1619.

PDF( 1390 KB)

Design of Multicolor Voronoi Classifier with Gradually Local Learning Ablility

Pei Ji-hong^①;杨烜,
Yang Xuan

Received Date: 2003-06-10
Rev Recd Date: 2003-11-20
Publish Date: 2004-10-19

Abstract

Abstract

A novel MultiColor Voronoi Classifier (MCVC) is proposed, which can be ap-plied to linear and nonlinear classification problems. MCVC has sound ability to expend classification plane between samples. With increment of samples, it can be shown that the classification plane of MCVC can close to any classification function. MCVC has very good local ability too. When new learning sample is added, only local classification planed is modified and the whole classification characteristics are not modified greatly. So MCVC can solve the overfitting problem of neural network. Experiments show that MCVC is feasible to linear classification and nonlinear classification problems.

FullText(HTML)

References(1)

References

蔡元龙.模式识别.西安:西安电子科技大学出版社,1986年,第3章:67-101.[2]边肇祺,张学工.模式识别.北京:清华大学出版社,2000年,第7章:161-173;第13章:284-303.[3]Vapnik V N,张学工译.统计学习理论的本质.北京:清华大学出版社,2000年,第0章:1-10.[4]Vapnik V N. An overview of statistical learning theory[J].IEEE Trans. Neural Networks.1999,10(5):988-999[5]周培德.计算几何-算法分析与设计.北京:清华大学出版社,2000年,第4章,88-132;第10章: 236-271.[6]Fortune S. A sweepline algorithm for Voronoi diagrams[J].Algorithmica.1987, 2(2):153-174[7]Chen D Z. Efficient geometric algorithm on the EREW PRAM[J].IEEE Trans. Parallel Distrib.Syst.1995, 6(1):41-47[8]Shamos M I, Hoey D. Closest-point problems. Proc. 16tn IEEE Ann. Symp. on the Foundations of Computer Science, CA, USA, 1975: 151-162.[9]Amato N M, Preparata F P. An NC parallel 3D Convex hull algorithm. In: Proc. 19th Annual ACM Symp. Comput. Geom., San Diego, CA, USA, 1993: 289-297.[10]Amato N M, Goodrich M T, Ramos E A. Parallel algorithms for higher-dimensional convex hulls.In: Proc. 35th Annual IEEE Symp. Found. Comput. Sci., Santa Fe, NM, USA, 1994: 386-694.[11]Amato N M, Goodrich M T, Ramos E A. Computing faces in segment and simplex arrangements.In: Proc. 27th Annual ACM Symp. Theory Comput., Las Vegas, Nevada, USA, 1995: 672-682.

Relative Articles

Supplements(0)

Cited By

Proportional views