1996
DOI: 10.1016/0167-8655(96)00041-4
|View full text |Cite
|
Sign up to set email alerts
|

A sample set condensation algorithm for the class sensitive artificial neural network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
31
0

Year Published

1998
1998
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 49 publications
(31 citation statements)
references
References 1 publication
0
31
0
Order By: Relevance
“…where x 1 , x 2 , y 1 , y 2 are normal random variables whose means and variances are (0, 10), (10,5), (3,10) and (20,5), respectively. The total number of vectors per class is 500.…”
Section: Experimental Datamentioning
confidence: 99%
“…where x 1 , x 2 , y 1 , y 2 are normal random variables whose means and variances are (0, 10), (10,5), (3,10) and (20,5), respectively. The total number of vectors per class is 500.…”
Section: Experimental Datamentioning
confidence: 99%
“…Some other algorithms artificially generate prototypes in locations accurately determined in order to reduce the TS size. Within this category, we can find the algorithms presented by Chang [3] and by Chen and Józwik [6].…”
Section: Prototype Selectionmentioning
confidence: 99%
“…Chen and Józwik [6] proposed an algorithm which consists of dividing the TS into some subsets using the concept of diameter of a set (distance between the two farthest points). It starts by partitioning the TS into two subsets by the middle point between the two farthest cases.…”
Section: Prototype Selectionmentioning
confidence: 99%
See 1 more Smart Citation
“…Well known methods for PG are PNN [28], learning quantization vector (LVQ) [29], Chen's algorithm [30], ICPL [27], HYB [31] and MixtGauss [32]. A good study of PS and PG can be found in [33].…”
Section: Introductionmentioning
confidence: 99%