Hamming Distance based Clustering Algorithm

Ritu Vijay, Prerna Mahajan and Rekha Kandwal
Additional contact information
Ritu Vijay: Bansthali University, India
Prerna Mahajan: Prerna Mahajan, Research Scholar, Banasthali University, India
Rekha Kandwal: Ministry of Earth Sciences & Science and Technology, India

International Journal of Information Retrieval Research (IJIRR), 2012, vol. 2, issue 1, 11-20

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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijirr.2012010102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jirr00:v:2:y:2012:i:1:p:11-20

Access Statistics for this article

International Journal of Information Retrieval Research (IJIRR) is currently edited by Zhongyu Lu

More articles in International Journal of Information Retrieval Research (IJIRR) from IGI Global
Bibliographic data for series maintained by Journal Editor ().