A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets

Xiaolu Huang, Qiuming Zhu

Research output: Contribution to journalArticlepeer-review

48 Scopus citations


Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false results. In this paper, we study the effect of a missing data recovery method, namely the pseudo-nearest-neighbor substitution approach, on Gaussian distributed data sets that represent typical cases in data discrimination and data mining applications. The error rate of the proposed recovery method is evaluated by comparing the clustering results of the recovered data sets to the clustering results obtained on the originally complete data sets. The results are also compared with that obtained by applying two other missing data handling methods, the constant default value substitution and the missing data ignorance (non-substitution) methods. The experiment results provided a valuable insight to the improvement of the accuracy for data discrimination and knowledge discovery on large data sets containing missing values.

Original languageEnglish (US)
Pages (from-to)1613-1622
Number of pages10
JournalPattern Recognition Letters
Issue number13
StatePublished - Nov 2002


  • Data clustering
  • Data imputation
  • Data mining
  • Gaussian data distribution
  • Missing data
  • Missing data recovery

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


Dive into the research topics of 'A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets'. Together they form a unique fingerprint.

Cite this