Harmony Search Optimization in K-Means Clustering

Journal Title: INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY - Year 2013, Vol 5, Issue 6

Abstract

Clustering is a data mining technique that classifies a set of observations into clusters based on some similarity measures. The most commonly used partitioning based clustering algorithm is K-means. However, the K-means algorithm has several drawbacks. The algorithm generates a local optimal solution based on the randomly chosen initial centroids. Harmony Search is a recently developed meta-heuristic optimization algorithm which helps to find out near global optimal solutions by searching the entire solution space. The hybrid algorithm that combines harmony search and K-means produce a better solution.

Authors and Affiliations

Samina Ahamed K T , Jasila E K

Keywords

Related Articles

Reconstruction Models for Attractors in the Technical and Economic Processes

The article discusses building models based on the reconstructed attractors of the time series. Discusses the use of the properties of dynamical chaos, namely to identify the strange attractors structure models. Here is...

Secured Packet Hiding Technique for Packet Jamming Attacks

Wireless networks are built upon a shared medium that makes it easy for adversaries to launch jamming-style attacks. Jamming attacks can severely interfere with the normal operation of Networks and, consequently, mechani...

OSI Reference Model: An Overview

A reference model is a conceptual blueprint of how communication should take place. It addresses all the process required for effective communication and divides these processes into logical grouping called layers. When...

A Review of Cyber Attack Classification Technique Based on Data Mining and Neural Network Approach

Cyber attack detection and classification is major challenge for web and network security. The increasing data traffic in network and web invites multiple cyber attack. The dynamic nature and large number of attribute of...

Study of TCP Packet Labeling to Alleviate Time-Out

Many applications (e.g., cluster based storage and Map Reduce) in modern data centers require a high fan-in, many- to-one type of data communication (known as TCP in cast), which could cause severe in cast congestion in...

Download PDF file
  • EP ID EP162193
  • DOI -
  • Views 105
  • Downloads 0

How To Cite

Samina Ahamed K T, Jasila E K (2013). Harmony Search Optimization in K-Means Clustering. INTERNATIONAL JOURNAL OF COMPUTER TRENDS & TECHNOLOGY, 5(6), 287-291. https://europub.co.uk/articles/-A-162193