An Instance Selection Algorithm Based On Reverse k Nearest Neighbor

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 10, Issue 7

Abstract

Classification is one of the most important data mining techniques. It belongs to supervised learning. The objective of classification is to assign class label to unlabelled data. As data is growing rapidly, handling it has become a major concern. So preprocessing should be done before classification and hence data reduction is essential. Data reduction is to extract a subset of features from a set of features of a data set. Data reduction helps in decreasing the storage requirement and increases the efficiency of classification. A way to measure data reduction is reduction rate. The main thing here is choosing representative samples to the final data set. There are many instance selection algorithms which are based on nearest neighbor decision rule (NN). These algorithms select samples on incremental strategy or decremental strategy. Both the incremental algorithms and decremental algorithms take much processing time as they iteratively scan the dataset. There is another instance selection algorithm, reverse nearest neighbor reduction (RNNR) based on the concept of reverse nearest neighbor (RNN). RNNR does not iteratively scan the data set. In this paper, we extend the RNN to RkNN and we use the concept of RNNR to RkNN. RkNN finds the query objects that has the query point as their k nearest-neighbors. Our approach utilizes the advantage of RNN and proposes to use the concept of RkNN. We have taken the dataset of theatres, hospitals and restaurants and extracted the sample set. Classification has been done the resultant sample data set. We observe two parameters here they are classification accuracy and reduction rate.

Authors and Affiliations

Y. Jagruthi, Dr. Y. Ramadevi, A. Sangeeta

Keywords

Related Articles

Optimization of Constituents of (Ni, MO, Cu)/Kieselguhr Catalyst by Response Surface Methodology for Glycerol Production by Hydrogenolysis of Sucrose

Sucrose hydrogenolysis is industrially important forthe production of polyols. To provide high glycerol yieldunder milder reaction conditions, a nickel catalyst promotedby Molybdenum and copper supported on kieselguhr wa...

ENHANCED DYNAMIC RESOURCE ALLOCATION SCHEME BASED ON PACKAGE LEVEL ACCESS IN CLOUD COMPUTING : A REVIEW

Cloud computing is Internet based development and use of computer technology. It is a style of computing in which dynamically scalable and often virtualized resources are provided as a service over the Internet. Users ne...

A NOVEL APPROACH OF HYBRID MODEL OF ENCRYPTION ALGORITHMS AND FRAGMENTATION TO ENSURE CLOUD SECURITY

Cloud is a term used as a metaphor for the wide area networks (like internet) or any such large networked environment. It came partly from the cloud-like symbol used to represent the complexities of the networks in the s...

Performance Comparison of Hartley Transform with Hartley Wavelet and Hybrid Hartley Wavelet Transforms for Image Data Compression

This paper proposes image compression using Hybrid Hartley wavelet transform. The paper compares the results of Hybrid Hartley wavelet transform with that of orthogonal Hartley transform and Hartley Wavelet Transform. Ha...

CONCEPTUAL THREE PHASE KDD MODEL AND FINANCIAL RESEARCH

KDD model becomes used in financial process. Data Mining tools can be used to improve the efficiency of the professionals. The integration of Data Mining tools with the traditional financial research methods is relative...

Download PDF file
  • EP ID EP650260
  • DOI 10.24297/ijct.v10i7.3217
  • Views 71
  • Downloads 0

How To Cite

Y. Jagruthi, Dr. Y. Ramadevi, A. Sangeeta (2013). An Instance Selection Algorithm Based On Reverse k Nearest Neighbor. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 10(7), 1858-1861. https://europub.co.uk/articles/-A-650260