Abstract
Clustering is very central to the concept of data mining applications and data analysis. It is a very desirable capability to be able to identify regions of highly co-related objects as their count becomes very high and at the same time the data sets enlarge and changes in their properties and relationships among the datasets also altered. It is important to note that the concept of clustering is fundamentally a partitioning of some or many objects based on a set of rules. In the literature, a considerable number of clustering algorithms are available which are classified into various categories. In this paper, an attempt is made to perform a comparative analysis of some state-of-the-art clustering algorithms based on different parameters. At the end, some recent advances of clustering algorithms are also highlighted. Keywords:Data mining; clustering; comparison; evaluation parameters; recent advances
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Advanced Research in Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.