Enhanced K-Means with Greedy Algorithm for Outlier Detection
Main Article Content
Abstract
Due to significant development in information technology, larger and huge volumes of data are accumulated in databases. In order to make the most out of this huge collection, well-organized and effective analysis techniques are essential that can obtain non-trivial, valid, and constructive information. Organizing data into valid groupings is one of the most basic ways of understanding and learning. Cluster analysis is the technique of grouping or clustering objects based on the measured or perceived fundamental features or similarity. The main objective of clustering is to discover structure in data and hence it is exploratory in nature. But the major risk for clustering approaches is to handle the outliers. Outliers occur because of the mechanical faults, any transformation in system behavior, fraudulent behavior, human fault, instrument mistake or any form of natural deviations. Outlier detection is a fundamental part of data mining and has huge attention from the research community recently. In this paper, the standard K-Means technique is enhanced using the Greedy algorithm for effective detection and removal of outliers (EKMOD). Experiments on iris dataset revealed that EKMOD automatically detect and remove outliers, and thus help in increasing the clustering accuracy. Moreover, the Means Squared Error and execution time is very less for the proposed EKMOD.
Keywords: K-Means, Greedy Algorithm, Outlier Detection.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.