z-logo
open-access-imgOpen Access
3N-Q: Natural Nearest Neighbor with Quality
Author(s) -
Zhang Shu,
Malek Mouhoub,
Samira Sadaoui
Publication year - 2014
Publication title -
computer and information science
Language(s) - English
Resource type - Journals
eISSN - 1913-8997
pISSN - 1913-8989
DOI - 10.5539/cis.v7n1p94
Subject(s) - computer science , k nearest neighbors algorithm , outlier , cluster analysis , nearest neighbor chain algorithm , data mining , pattern recognition (psychology) , nearest neighbor search , best bin first , artificial intelligence , quality (philosophy) , value (mathematics) , nearest neighbor graph , function (biology) , machine learning , fuzzy clustering , canopy clustering algorithm , philosophy , epistemology , evolutionary biology , biology
In this paper, a novel algorithm for enhancing the performance of classification is proposed. This new method provides rich information for clustering and outlier detection. We call it Natural Nearest Neighbor with Quality (3N-Q). Comparing to K-nearest neighbor and E-nearest neighbor, 3N-Q employs a completely different concept to find the nearest neighbors passively, which can adaptively and automatically get the K value. This value as well as distribution of neighbors and frequency of being neighbors of others offer precious foundation not only in classification but also in clustering and outlier detection. Subsequently, we propose a fitness function that reflects the quality of each training sample, retaining the good ones while eliminating the bad ones according to the quality threshold. From the experiment results we report in this paper, it is observed that 3N-Q is efficient and accurate for solving data mining problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom