Evolutionary algorithms for robust density-based data clustering

DOI10.1155/2013/931019MaRDI QIDQ355532zbMATH OpenOpenAlexWikidataFDO

Authors Amit Banerjee

Publication date 25 July 2013

Published in ISRN Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/931019

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Review text

Summary: 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.

Recommendations

• Evolutionary data clustering: algorithms and applications
• Artificial Intelligence and Soft Computing - ICAISC 2004
• scientific article; zbMATH DE number 2013519
• Clustering stability-based evolutionary K-means
• Evolutionary programming: an application to clustering
• Parallelizing Evolutionary Algorithms for Clustering Data

Cites work

• scientific article; zbMATH DE number 558543 (Why is no real title available?)
• Relational duals of the c-means clustering algorithms

Cited in

(4)

• Robustness of density-based clustering methods with various neighborhood relations
• Evolutionary clustering of relational data
• scientific article; zbMATH DE number 2040770 (Why is no real title available?)
• Evolutionary clustering using an incremental technique

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Evolutionary algorithms for robust density-based data clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355532)