Proceedings of the IEEE · 1990 · 71 citations · 8 references
ComputingComputer ScienceAlgorithmsArtificial IntelligenceMachine LearningClassificationNearest Neighbor SearchNeural NetworksPattern RecognitionRepresentation LearningMultilayer PerceptronNearest-neighbor ClassificationNeural Network ClassificationPatternsPerceptronPolynomial Time ComplexityPolynomial-time AlgorithmsTraining
A three-layer perceptron that uses the nearest-neighbor pattern classification rule is presented. This neural network is of interest because it is designed specifically for the set of training patterns, and incorporating of the training of the network into the design eliminates the need for the use of training algorithms. The technique therefore provides an alternative to the limitations and unpredictability (such as having too many, too few, or inappropriate training patterns) of the known training techniques. Since the nearest-neighbor classification rule is used, the network is capable of forming arbitrarily complex decision regions. The design and training of the network can be completed in polynomial time, whereas it has been shown that training a neural network is an NP-complete problem.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
8
An introduction to computing with neural nets
Richard P. Lippmann · IEEE ASSP Magazine · 1987 · 7.9K citations
Pattern classification and scene analysis
Y.P. Chien · IEEE Transactions on Automatic Control · 1974 · 3.4K citations
Alexander Mullin, Frank F. Rosenblatt · American Mathematical Monthly · 1963 · 2.2K citations
Michael Ian Shamos, Dan Hoey · 1975 · 1.1K citations
Voronoi diagrams and arrangements
Herbert Edelsbrunner, Raimund Seidel · Discrete & Computational Geometry · 1986 · 349 citations · Full text