Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
Data mining: concepts and techniques
Data mining: concepts and techniques
Discretization: An Enabling Technique
Data Mining and Knowledge Discovery
Symbolic nearest mean classifiers
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study
IEEE Transactions on Evolutionary Computation
A divide-and-conquer recursive approach for scaling up instance selection algorithms
Data Mining and Knowledge Discovery
Constructing ensembles of classifiers by means of weighted instance selection
IEEE Transactions on Neural Networks
Distance measures in training set selection for debt value prediction
PerMIn'12 Proceedings of the First Indo-Japan conference on Perception and Machine Intelligence
Transfer learning approach to debt portfolio appraisal
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II
Hi-index | 0.00 |
Instance-based learning methods such as the nearest neighbor classifier have proven to perform well in pattern classification in several fields. Despite their high classification accuracy, they suffer from a high storage requirement, computational cost, and sensitivity to noise. In this paper, we present a data reduction method for instance-based learning, based on entropy-based partitioning and representative instances. Experimental results show that the new algorithm achieves a high data reduction rate as well as classification accuracy.