slugStudy of Euclidean and Manhattan Distance Metrics using Simple K-Means Clustering

Abstract

Clustering is the task of assigning a set of objects into groups called clusters in which objects in the same cluster are more similar to each other than to those in other clusters. Generally clustering is used to find out the similar, dissimilar and outlier items from the databases. The main idea behind the clustering is the distance between the data items. The work carried out in this paper is based on the study of two popular distance metrics viz. Euclidean and Manhattan. A series of experiments has been performed to validate the study. We use two real and one synthetic datasets on simple K-Means clustering. The theoretical analysis and experimental results show that the Euclidean method outperforms Manhattan method in terms of number of iterations performed during centroid calculation.

Authors and Affiliations

Deepak Sinwar, Rahul Kaushik

Keywords

Related Articles

Dynamic approach of Range Aggregate queries in Big Data environment

Range-aggregate queries are to apply a certain aggregate function on all tuples within given query ranges. Existing approaches to range-aggregate queries are insufficient to quickly provide accurate results in big data...

Our Future: Artificial Intelligence, Expert Systems & Robots

Artificial Intelligence is the concept of computer science which deals with building computers that exhibits the intelligent behaviour like us. In other words it concern with making intelligent machines which having abi...

A Wearable Device for Continuous Detection and Screening of Epilepsy during Daily Life

Epilepsy is a very fatal condition which is caused as a result of imbalance in the nervous system. The very common symptoms of epilepsy includes sudden fluctuations in heart beat rate and involuntary muscular movements...

Storage Optimization Using De Duplication: A Better Approach

Cloud storage is one of the services provide in cloud computing which has been increasing in reputation. With the growing data size of cloud computing, a decrease in data volumes could help provider reducing the costs o...

Identification of Suspicious Activities in Chat Logs using Support Vector Machine and Optimization with Genetic Algorithm

In the era of modern technology, the advancements in communication technology are leading to riveting trends in daily lives through instant messengers, social networking websites and many other popular communication tec...

Download PDF file
  • EP ID EP18115
  • DOI -
  • Views 296
  • Downloads 13

How To Cite

Deepak Sinwar, Rahul Kaushik (2014). slugStudy of Euclidean and Manhattan Distance Metrics using Simple K-Means Clustering. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 2(5), -. https://europub.co.uk/articles/-A-18115