Author :
Shengqiao Li ; Harner, E. James ; Adjeroh, Donald A.
Author_Institution :
Dept. of Stat., West Virginia Univ., Morgantown, WV, USA
Abstract :
We present Random KNN, a novel generalization of traditional nearest-neighbor modeling. Random KNN consists of an ensemble of base k-nearest neighbor classifiers, each constructed from a random subset of the input variables. We study the properties of the proposed Random KNN. Using various datasets, we perform an empirical analysis of Random KNN performance and compare it with recently proposed methods for high-dimensional datasets. It is shown that Random KNN provides significant advantages in both the computational requirement and classification performance.
Keywords :
pattern classification; random processes; Random KNN; base k-nearest neighbor classifiers; high-dimensional datasets; nearest-neighbor modeling; Approximation methods; Complexity theory; Computational modeling; Convergence; Error analysis; Radio frequency; Random variables; Classification; Feature Selection; High Dimensional Data; KNN; Microarray Data; Random KNN;
Conference_Titel :
Data Mining Workshop (ICDMW), 2014 IEEE International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-4799-4275-6
DOI :
10.1109/ICDMW.2014.112
