Efficiency of K-Means Clustering Algorithm in Mining Outliers from Large Data Sets
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 9
Abstract
This paper presents the performance of k-means clustering algorithm, depending upon various mean values input methods. Clustering plays a vital role in data mining. Its main job is to group the similar data together based on the haracteristic they possess. The mean values are the centroids of the specified number of cluster groups. The centroids, though gets changed during the process of clustering, are alculated using several methods. Clustering algorithms can be applied for image analysis, pattern recognition, bio-informatics and in several other fields. The clustering algorithm consists to two stages with first stage forming the clusters-calculating centroid and the second stage determining the outliers. There are three methods for assigning the mean values in k-means clustering algorithm. The three mean value assignment methods are implemented, performance is analysed and comparison of every method is done. Outliers, the is advantage of the process are used in the analyzation to determine the performance with various mean inputs and methods.
Authors and Affiliations
Sridhar. A , Sowndarya. S
Keywords
Related Articles
- EP ID EP97295
- DOI -
- Views 150
- Downloads 0
Comparison of fingerprint enhancement techniques through Mean Square Error and Peak-Signal to Noise Ratio
In the fingerprint recognition system the main goal of the fingerprint enhancement algorithm is to reduce the noise present in the image. There are several factors that affect the quality of the acquired fingerprint imag...
A Lossless Recovery of Data Embedded in Color Image Based On Block Division Method
Today, digital media are getting more and more popular. Not only multilevel images, video and audio are in digital form, but gray scale images are also digitized in many applications. Data transmitted over the internet c...
Shortest Distance Message Broadcasting for an Applications in an irregular Mobile Topologies
This paper introduces data forwarding algorithm for a articular applications within Mobile Adhoc etworks that is based on the concept of electing the neighbor node from a set of esignated nodes. The algorithm, which...
Optimization of Transmission Conditions for Thin Interphase Layer Based on Imperialist Competitive Algorithm
The imperialist competitive algorithm (ICA) that was recently introduced has shown its good performance in optimization problems. In this paper a novel optimization algorithm based on ICA is used for obtaining transmissi...
Ternary Hierarchical Clustering with Data De-Duplication in Sensor Networks
Wireless Sensor Networks are resource constrained application specific adhoc networks. All the previous works have concentrated on the power aware techniques such as data aggregation, coordination of node operations for...