Evolutionary clustering algorithms for relational data

Research output: Contribution to journalConference article

2 Scopus citations

Abstract

Relational data clustering has received lot less attention than vector data clustering and the use of evolutionary techniques to optimize clustering parameters is even rare. We extend an earlier work where a relational data version of DBSCAN was presented and an evolutionary framework was proposed for optimizing clustering parameters. Five evolutionary techniques are presented in this paper – three algorithms based on particle swarm optimization, the firefly algorithm and the composite differential evolution technique. Clustering results from the proposed methodologies are tested on benchmark datasets from the UCI machine learning database.

Original languageEnglish (US)
Pages (from-to)276-283
Number of pages8
JournalProcedia Computer Science
Volume140
DOIs
StatePublished - Jan 1 2018
EventComplex Adaptive Systems Conference with Theme: Cyber Physical Systems and Deep Learning, CAS 2018 - Chicago, United States
Duration: Nov 5 2018Nov 7 2018

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Evolutionary clustering algorithms for relational data'. Together they form a unique fingerprint.

  • Cite this