Pattern Recognition with Partly Missing Data
- 1 January 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 9 (10) , 617-621
- https://doi.org/10.1109/tsmc.1979.4310090
Abstract
An experimental comparison of several simple inexpensive ways of doing pattern recognition when some data elements are missing (blank) is presented. Pattern recognition methods are usually designed to deal with perfect data, but in the real world data elements are often missing due to error, equipment failure, change of plans, etc. Six methods of dealing with blanks are tested on five data sets. Blanks were inserted at random locations into the data sets. A version of the K-nearest neighbor technique was used to classify the data and evaluate the six methods. Two methods were found to be consistently poor. Four methods were found to be generally good. Suggestions are given for choosing the best method for a particular application.Keywords
This publication has 7 references indexed in Scilit:
- The Distance-Weighted k-Nearest-Neighbor RuleIEEE Transactions on Systems, Man, and Cybernetics, 1976
- Error detection in data base systemsPublished by Association for Computing Machinery (ACM) ,1976
- k-Nearest-Neighbor Decision Rule Performance in a Speech Recognition SystemIEEE Transactions on Systems, Man, and Cybernetics, 1975
- A heuristic approach to inductive inference in fact retrieval systemsCommunications of the ACM, 1974
- Experiments with some cluster analysis algorithmsPattern Recognition, 1974
- Nearest neighbor pattern classificationIEEE Transactions on Information Theory, 1967
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936