Evolutionary Algorithms for Robust Density-Based Data Clustering

  • Banerjee A
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Density-based clustering methods are known to be robust against outliers in data; however, they are sensitive to user-specified parameters, the selection of which is not trivial. Moreover, relational data clustering is an area that has received considerably less attention than object data clustering. In this paper, two approaches to robust density-based clustering for relational data using evolutionary computation are investigated.

Cite

CITATION STYLE

APA

Banerjee, A. (2013). Evolutionary Algorithms for Robust Density-Based Data Clustering. ISRN Computational Mathematics, 2013, 1–8. https://doi.org/10.1155/2013/931019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free