A Case Study of Clustering Algorithms for Categorical Data sets

Abstract

The data clustering, an unsupervised pattern recognition process is the task of assigning a set of objects into groups called clusters so that the objects in the same cluster are more similar to each other than to those in other clusters. Most traditional clustering algorithms are limited to handling numerical data. However, these cannot be directly applied for clustering of nominal data, where domain values are discrete and have no ordering. In this paper various categorical data clustering algorithms are going to be addressed in detail. A detailed survey on existing algorithms will be made and the scalability of some of the existing algorithms will be examined.

Authors and Affiliations

Ms. V. Sujitha| Anurag Group of Institutions Hyderabad, India, Mr. B. Venkateshwar Reddy| Anurag Group of Institutions Hyderabad, India, Mr. G. Vishnu Murthy| Anurag Group of Institutions Hyderabad, India

Keywords

Related Articles

Distributed Manipulation Through Unidentified Data Accumulated In Cloud

Cloud computing is a rising registering standard in which resources of the processing structure are given as an administration over the Internet. As ensuring as it might be, this standard also conveys quite a few peo...

Radiaton Pattern Reconfiguration Using Parasitic Elements

A parasitic surface based reconfiguration technique for microstrip antenna beam steering has been presented and discussed in this paper. This concept can be used in reconfigurable antennas without additional modifica...

New Multilevel Inverter D-STATCOM Topology To Compensate Reactive And Nonlinear Loads

This work proposes an enhanced half and half dissemination static compensator (D-STATCOM) topology to address some reasonable issues, for example, control rating, channel measure, remuneration execution, and power mi...

Advances the Forward Security in Parallel Network File System using An Efficient and Reliable Key Exchange Protocols

In parallel file system we can disperse data over numerous nodes to permit simultaneous access by various errands of a parallel application. By play out the numerous errands in a parallel system is commonly to reduce...

Procedure To Establish A Secure Self-Configured Environment For Data Distribution And Services Sharing Among Users

A spontaneous network is a particular case of ad hocnetworks. They usually have little or no dependence on acentralized administration. Spontaneous networks can bewired or wireless. We regard as only wireless spontan...

Download PDF file
  • EP ID EP16217
  • DOI -
  • Views 470
  • Downloads 22

How To Cite

Ms. V. Sujitha, Mr. B. Venkateshwar Reddy, Mr. G. Vishnu Murthy (2013). A Case Study of Clustering Algorithms for Categorical Data sets. International Journal of Science Engineering and Advance Technology, 1(3), 53-57. https://europub.co.uk/articles/-A-16217