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

Security Enhancement Using Mutual Authentication in Existing CDMA Systems

Abstract— Even though CDMA2000 wireless networks are being widely deployed as a cellular digital standard around the world, it has some hidden vulnerabilities concerned with security issues. The existing CDMA systems use...

Performance Evaluation of Ad Hoc On Demand Distance Vector in MANETs with varying Network Size using NS-2 Simulation

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically forming a network topology without the use of any existing network infrastructure or centralized administration. Routing is the task of...

Analyzing Theoretical Basis and Inconsistencies of Object Oriented Metrics

Metrics help in identifying potential problem areas and finding these problems in the phase they are developed decreases the cost and avoids major ripple effects from these in later development stages. These days, Object...

Rebroadcasting for Routing Reduction based upon Neighbor coverage in Ad Hoc Networks

Cause of nodes high mobility in mobile ad hoc networks (MANETs), there are frequent link breakages exist which escort to frequent route discoveries and path failures. The route discovery procedure cannot be ignored. In a...

Ubiquitous Computing-Approach to Intelligence Building

Ubiquitous computing (often abbreviated to “ubicomp”) refers to a new genre of computing in which the computer completely permeates the life of the user. In ubiquitous computing, computers become a helpful but invisible...

Download PDF file
  • EP ID EP97295
  • DOI -
  • Views 135
  • Downloads 0

How To Cite

Sridhar. A, Sowndarya. S (2010). Efficiency of K-Means Clustering Algorithm in Mining Outliers from Large Data Sets. International Journal on Computer Science and Engineering, 2(9), 3043-3045. https://europub.co.uk/articles/-A-97295