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
- EP ID EP650260
- DOI 10.24297/ijct.v10i7.3217
- Views 96
- Downloads 0
A review on Privacy Preservation and Collaborative Data Mining
Privacy preservation is major issue in current data transmission over internet and cloud network. For the integrity and security of data various methods are used such as cryptography, data transformation, Steganography,...
Identifying Effective Factors on Using Service Oriented Achitecture in E-Banking
One of the common problems of most banks in information technology in banking area is the lack of software integrity and data banks. For integrating goals, various methods and technologies have been developed. Service...
A Variable Step Size for Acoustic Echo Cancellation Using Normalized Sub band Adaptive Filter
Numerous various step size normalized least mean square (VSS-NLMS)Algorithms have been derived to solve the problem of fast convergence rate and low mean square error.Here we find out the ways to control the step size. A...
Secure Distributed Accountability Framework for Data Sharing in Cloud Environment
Cloud computing is used to provide scalable services which are easily used over the internet as per the requirement. A major feature of the cloud services is that users data are remotely processed in unknown machines tha...
Implementation of packet scheduling algorithms in LTE-Sim
In this research paper we have implemented downlink packet scheduling algorithms in LTE-Sim simulation for LTE cellular networks. The implementation includes adding two packet scheduling algorithms (Round Robin and MaxRa...