Welcome to the InfoSci Platform
Reference Hub5
Hamming Distance based Clustering Algorithm

Hamming Distance based Clustering Algorithm

Ritu Vijay, Prerna Mahajan, Rekha Kandwal
Copyright: © 2012 |Volume: 2 |Issue: 1 |Pages: 10
ISSN: 2155-6377|EISSN: 2155-6385|EISBN13: 9781466612617|DOI: 10.4018/ijirr.2012010102
Cite Article Cite Article

MLA

Vijay, Ritu, et al. "Hamming Distance based Clustering Algorithm." IJIRR vol.2, no.1 2012: pp.11-20. http://doi.org/10.4018/ijirr.2012010102

APA

Vijay, R., Mahajan, P., & Kandwal, R. (2012). Hamming Distance based Clustering Algorithm. International Journal of Information Retrieval Research (IJIRR), 2(1), 11-20. http://doi.org/10.4018/ijirr.2012010102

Chicago

Vijay, Ritu, Prerna Mahajan, and Rekha Kandwal. "Hamming Distance based Clustering Algorithm," International Journal of Information Retrieval Research (IJIRR) 2, no.1: 11-20. http://doi.org/10.4018/ijirr.2012010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Cluster analysis has been extensively used in machine learning and data mining to discover distribution patterns in the data. Clustering algorithms are generally based on a distance metric in order to partition the data into small groups such that data instances in the same group are more similar than the instances belonging to different groups. In this paper the authors have extended the concept of hamming distance for categorical data .As a data processing step they have transformed the data into binary representation. The authors have used proposed algorithm to group data points into clusters. The experiments are carried out on the data sets from UCI machine learning repository to analyze the performance study. They conclude by stating that this proposed algorithm shows promising result and can be extended to handle numeric as well as mixed data.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.