Presentation 2003/5/23
Algorithms and Evaluations for Efficient Condensing based on Proximity Graphs
Takekazu KATO, Toshikazu WADA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We have proposed new theorems for efficient condensing algorithms based on proximity graphs. This paper presents implementations and evaluations of two condensing algorithms, called Direct condensing and Chip-off condensing, based on our theorems. The algorithms can efficiently obtain the same prototypes as the Voronoi condensing without the entire proximity graph of given patterns. The Direct condensing algorithm is more computationally efficient than any previous condensing algorithms for voronoi condensing, and the Chip-Off condensing algorithm can sequencially remove disused patterns while keeping the classifier boundaries. This paper shows the evaluations of proposed condensing algorithms, and demonstrates applications of the nearest-neighbor classifier and the condensing.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) nearest neighbor classifier / voronoi condensing / proximity graph
Paper # PRMU2003-15
Date of Issue

Conference Information
Committee PRMU
Conference Date 2003/5/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Pattern Recognition and Media Understanding (PRMU)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Algorithms and Evaluations for Efficient Condensing based on Proximity Graphs
Sub Title (in English)
Keyword(1) nearest neighbor classifier
Keyword(2) voronoi condensing
Keyword(3) proximity graph
1st Author's Name Takekazu KATO
1st Author's Affiliation Faculty of Systems Engineering, Wakayama University()
2nd Author's Name Toshikazu WADA
2nd Author's Affiliation Faculty of Systems Engineering, Wakayama University
Date 2003/5/23
Paper # PRMU2003-15
Volume (vol) vol.103
Number (no) 96
Page pp.pp.-
#Pages 6
Date of Issue