{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:49:59Z","timestamp":1781106599848,"version":"3.54.1"},"reference-count":23,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/ijirr.2012010102","type":"journal-article","created":{"date-parts":[[2012,11,12]],"date-time":"2012-11-12T15:49:29Z","timestamp":1352735369000},"page":"11-20","source":"Crossref","is-referenced-by-count":7,"title":["Hamming Distance based Clustering Algorithm"],"prefix":"10.4018","volume":"2","author":[{"given":"Ritu","family":"Vijay","sequence":"first","affiliation":[{"name":"Bansthali University, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prerna","family":"Mahajan","sequence":"additional","affiliation":[{"name":"Prerna Mahajan, Research Scholar, Banasthali University, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rekha","family":"Kandwal","sequence":"additional","affiliation":[{"name":"Ministry of Earth Sciences & Science and Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijirr.2012010102-0","doi-asserted-by":"publisher","DOI":"10.1109\/69.553155"},{"key":"ijirr.2012010102-1","first-page":"845","article-title":"Feature selection for unsupervised learning.","volume":"5","author":"J.Dy","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"ijirr.2012010102-2","unstructured":"Ester, M., Kriegel, H., Sander, J., & Xu, X. (1996). A density - based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (pp. 226-231)."},{"key":"ijirr.2012010102-3","doi-asserted-by":"crossref","unstructured":"Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). CACTUS-Clustering categorical data using summaries. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (pp. 73- 83).","DOI":"10.1145\/312129.312201"},{"key":"ijirr.2012010102-4","unstructured":"Gibson, D., Kleiberg, J., & Raghavan, P. (1998). Clustering categorical data: An approach based on dynamic systems. In Proceedings of the International Conference on Very Large Databases (pp. 311-323)."},{"key":"ijirr.2012010102-5","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., & Shim, K. (1998). CURE: A clustering algorithm for large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 73-84).","DOI":"10.1145\/276305.276312"},{"key":"ijirr.2012010102-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(00)00022-3"},{"key":"ijirr.2012010102-7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02985802"},{"key":"ijirr.2012010102-8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02948829"},{"key":"ijirr.2012010102-9","author":"Z.He","year":"2003","journal-title":"K-Histograms: An efficient clustering algorithm for categorical dataset (Tech. Rep. No. Tr-2003-08)"},{"key":"ijirr.2012010102-10","unstructured":"Huang, Z. (1997). A fast clustering algorithm to cluster very large categorical data sets in data mining. In Proceedings of the SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Tucson, AZ (pp. 1-8)."},{"key":"ijirr.2012010102-11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009769707641"},{"key":"ijirr.2012010102-12","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ijirr.2012010102-13","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ijirr.2012010102-14","author":"L.Kaufman","year":"2005","journal-title":"Finding groups in data: An introduction to cluster analysis"},{"key":"ijirr.2012010102-15","unstructured":"Machine Learning Repository, W. E. K. A. (n.d.). Collections of datasets. Retrieved from http:\/\/www.cs.waikato.ac.nz\/ml\/weka\/index_datasets.html"},{"key":"ijirr.2012010102-16","unstructured":"Nanopoulos, A., Theodoridis, Y., & Manolopoulos, Y. (2001). C2P: Clustering based on closest. In Proceedings of the 27th Very Large Data Bases Conference, Rome, Italy (pp. 331-340)."},{"key":"ijirr.2012010102-17","unstructured":"Queen, M. J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematics, Statistics and Probability (Vol. 1, pp. 281-297)."},{"key":"ijirr.2012010102-18","unstructured":"Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998). WaveCluster: A multi- resolution clustering approach for very large spatial databases. In Proceedings of the International Conference on Very Large Databases (pp. 428-439)."},{"key":"ijirr.2012010102-19","doi-asserted-by":"crossref","unstructured":"Wang, K., Xu, C., & Uu, B. (1999). Clustering transactions using large items. In Proceedings of the ACM International Conference on Information and Knowledge Management (pp. 483-490).","DOI":"10.1145\/319950.320054"},{"key":"ijirr.2012010102-20","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000000312"},{"key":"ijirr.2012010102-21","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakishnan, R., & Livny, M. (1996). BIRTH: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, AZ (pp. 103-114).","DOI":"10.1145\/235968.233324"},{"key":"ijirr.2012010102-22","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Fu, A., Cai, C., & Heng, P. (2000). Clustering categorical data. In Proceedings of the IEEE International Conference on Data Engineering, San Diego, CA (pp. 305-306).","DOI":"10.1109\/ICDE.2000.839422"}],"container-title":["International Journal of Information Retrieval Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=72704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:55:09Z","timestamp":1654095309000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijirr.2012010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijirr.2012010102","relation":{},"ISSN":["2155-6377","2155-6385"],"issn-type":[{"value":"2155-6377","type":"print"},{"value":"2155-6385","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}