Compression Record Based Efficient k - Medoid Algorithm to Increase Scalability and Efficiency

Abstract

Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attri butes. K - medoid clustering algorithms are widely used for many practical applications. Original K - medoid algorithm select initial centroids and medoids randomly that affect the quality of the resulting clusters and sometimes it generates unstable and empty clusters which are meaningless. The original k - means algorithm is computationally expensive and requires time proportional to the product of the number of data items, number of clusters and the number of iterations. Improved k - Medoid clustering algorith m has the accuracy higher than the original .

Authors and Affiliations

Archana Kumari , Hritu Bhagat

Keywords

Related Articles

A Novel Low power and Area efficient Carry Look Ahead Adder Using GDI Technique  

A full adder is one of the essential component in digital circuit design, many improvements have been made to reduce the architecture of a full adder. The proposed method aims on Gate diffusion input (GDI) whic...

Surface and Embedded Micro Strip Lines Characteristic Impedance and its Signal Propagation Delay Time in Optical Spectrum Transmission Regions  

This paper has presented the characteristic impedance and signal propagation delay time for both surface and embedded microstrip lines that comprise a conducting strip line with width w, thickness t of conductivity...

A Survey of Performance based Secure Routing Protocols in MANET 

An ad-hoc network is a multi-hop wireless network where all nodes cooperatively maintain network connectivity without a centralized infrastructure. If these nodes change their positions dynamically, it is called a...

Review of Comparative Analysis of Empirical Propagation model for WiMAX  

The propagation models for path loss may give different results if they are used in different environment other than in which they were designed. In this paper we review of compare the different path loss empiric...

Fusion of Statistic, Data Mining and Genetic Algorithm for feature selection in Intrusion Detection

The security of information and data is a critical issue in a computer networked environment. In our society computer networks are used to store proprietary information and to provide services for organizations and socie...

Download PDF file
  • EP ID EP125774
  • DOI -
  • Views 83
  • Downloads 0

How To Cite

Archana Kumari, Hritu Bhagat (2013). Compression Record Based Efficient k - Medoid Algorithm to Increase Scalability and Efficiency. International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(8), 2398-2401. https://europub.co.uk./articles/-A-125774