A fast nearest neighbor classifier based on self-organizing incremental neural network
Neural NetworksPublished 7 July 2008
Furao Shen, Osamu Hasegawa
Citations114
SJR quartileQ1
SJR score1.49
SNIP2.02
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The proposed Adjusted SOINn Classifier (ASC) is based on SOINN (self-organizing incremental neural network), it automatically learns the number of prototypes needed to determine the decision boundary, and learns new information without destroying old learned information.
Abstract
A fast prototype-based nearest neighbor classifier is introduced. The proposed Adjusted SOINN Classifier (ASC) is based on SOINN (self-organizing incremental neural network), it automatically learns the number of prototypes needed to determine the decision boundary, and learns new information without destroying old learned information. It is robust to noisy training data, and it realizes very fast classification. In the experiment, we use some artificial datasets and real-world datasets to illustrate ASC. We also compare ASC with other prototype-based classifiers with regard to its classification error, compression ratio, and speed up ratio. The results show that ASC has the best performance and it is a very efficient classifier.
Keywords
Computer Science
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
19,345 Citations2013Trevor Hastie, Robert Tibshirani +1 more
IEEE Transactions on Information TheoryNearest neighbor pattern classification
16,134 Citations1967Thomas M. Cover, Peter E. Hart
The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points, so it may be said that half the classification information in an infinite sample set is contained in the nearest neighbor.
IEEE Transactions on Systems Man and CyberneticsAsymptotic Properties of Nearest Neighbor Rules Using Edited Data
2,050 Citations1972Dennis L. Wilson
The convergence properties of a nearest neighbor rule that uses an editing procedure to reduce the number of preclassified samples and to improve the performance of the rule are developed.
Machine LearningReduction Techniques for Instance-Based Learning Algorithms
1,188 Citations2000D.R. Wilson, Tony Martinez
Of those algorithms that provide substantial storage reduction, the DROP algorithms have the highest average generalization accuracy in these experiments, especially in the presence of uniform class noise.
Improved versions of learning vector quantization
497 Citations1990Teuvo Kohonen
It has turned out that the differences between the presented algorithms in regard to the remaining discretization error are not significant, and thus the choice of the algorithm may be based on secondary arguments, such as stability in learning, in which respect the variant introduced (LVQ2.1) seems to be superior to the others.
Neural NetworksAn incremental network for on-line unsupervised classification and topology learning
314 Citations2005Shen Furao, Osamu Hasegawa
The design of two-layer neural network enables this system to represent the topological structure of unsupervised on-line data, report the reasonable number of clusters, and give typical prototype patterns of every cluster without prior conditions such as a suitable number of nodes or a good initial codebook.
International Journal of Intelligent SystemsNearest prototype classifier designs: An experimental study
208 Citations2001James C. Bezdek, Ludmila I. Kuncheva
It is asserted that presupervised, extraction methods offer a better chance for success to the casual user than postsupervised, selection schemes.
Neural NetworksAn enhanced self-organizing incremental neural network for online unsupervised learning
198 Citations2007Shen Furao, Tomotaka Ogura +1 more
An enhanced self-organizing incremental neural network (ESOINN) is proposed to accomplish online unsupervised learning tasks and is more stable than SOINN.
IEEE Transactions on Systems Man and CyberneticsMinimal consistent set (MCS) identification for optimal nearest neighbor decision systems design
187 Citations1994B.V. Dasarathy
These results show that the nearest neighbor decision system performance suffers little degradation when the given large training set is replaced by its much smaller MCS in the operational phase of testing with an independent test set.
IEEE Transactions on Pattern Analysis and Machine IntelligenceThe nearest subclass classifier: a compromise between the nearest mean and nearest neighbor classifier
149 Citations2005Cor J. Veenman, M.J.T. Reinders
The nearest subclass classifier (NSC), which is a classification algorithm that unifies the flexibility of the nearest neighbor classifier with the robustness ofThe nearest mean classifier, is presented, which belongs to the class of prototype-based classifiers.
IEEE Transactions on Pattern Analysis and Machine IntelligenceDensity-based multiscale data condensation
138 Citations2002Pabitra Mitra, C.A. Murthy +1 more
A nonparametric data reduction scheme that selects representative points in a multiscale fashion which is novel from existing density-based approaches and is empirically found that the algorithm is efficient in terms of sample complexity.
From margins to probabilities in multiclass learning problems
17 Citations2002Andrea Passerini, Massimiliano Pontil +1 more
A new decoding function is proposed that combines the margins through an estimate of their class conditional probabilities, which leads to good estimates of kernel parameters and the corresponding classifiers attain high accuracy.
An On-Line Learning Mechanism for Unsupervised Classification and Topology Representation
7 Citations2005Shen Furao, Osamu Hasegawa
Experimental results show that this system can report a reasonable number of clusters and represent the topological structure of unsupervised on-line data with no prior conditions such as a suitable number of nodes or a good initial codebook.