Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · 2018 · 215 citations · 76 references
ComputingData ScienceBig Data AnalyticsData MiningMachine LearningData CleaningData PreprocessingData QualityData ReductionMissing Data ImputationNearest Neighbor SearchData ImputationData Processing AlgorithmsImputation Of Missing ValuesK-nearest Neighbor ImputationK-nearest Neighbor SearchK-nearest NeighborsK-nearest Neighbors ImputationMissing Value Imputation
The k‑nearest neighbors algorithm is a simple yet powerful data‑mining technique, but its performance degrades with massive noisy or imperfect data, prompting long‑standing research into preprocessing methods such as instance reduction and missing‑value imputation. This study investigates how smart‑data‑gleaning k‑NN variants can be applied within supervised learning, presenting emerging big‑data‑ready versions and novel methods to handle large datasets. The authors review smart‑data concepts, current and future k‑NN trends, and existing preprocessing techniques, then conduct extensive experiments on large datasets to provide guidelines for using k‑NN to generate high‑quality data. k‑NN transforms noisy, redundant, or incomplete big data into smart, high‑quality data, and the authors have released Spark packages implementing these smart‑data algorithms. The article is categorized under Technologies → Data Preprocessing → Fundamental Concepts of Data and Knowledge → Big Data Mining → Classification.
The k‐nearest neighbors algorithm is characterized as a simple yet effective data mining technique. The main drawback of this technique appears when massive amounts of data—likely to contain noise and imperfections—are involved, turning this algorithm into an imprecise and especially inefficient technique. These disadvantages have been subject of research for many years, and among others approaches, data preprocessing techniques such as instance reduction or missing values imputation have targeted these weaknesses. As a result, these issues have turned out as strengths and the k‐nearest neighbors rule has become a core algorithm to identify and correct imperfect data, removing noisy and redundant samples, or imputing missing values, transforming Big Data into Smart Data—which is data of sufficient quality to expect a good outcome from any data mining algorithm. The role of this smart data gleaning algorithm in a supervised learning context are investigated. This includes a brief overview of Smart Data, current and future trends for the k‐nearest neighbor algorithm in the Big Data context, and the existing data preprocessing techniques based on this algorithm. We present the emerging big data‐ready versions of these algorithms and develop some new methods to cope with Big Data. We carry out a thorough experimental analysis in a series of big datasets that provide guidelines as to how to use the k‐nearest neighbor algorithm to obtain Smart/Quality Data for a high‐quality data mining process. Moreover, multiple Spark Packages have been developed including all the Smart Data algorithms analyzed. This article is categorized under: Technologies > Data Preprocessing Fundamental Concepts of Data and Knowledge > Big Data Mining Technologies > Classification
76
Nearest neighbor pattern classification
Thomas M. Cover, Peter E. Hart · IEEE Transactions on Information Theory · 1967 · 16.1K citations