Cycle Based Clustering Using Reversible Cellular Automata - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2020

Cycle Based Clustering Using Reversible Cellular Automata

Abstract

This work proposes cycle based clustering technique using reversible cellular automata (CAs) where ‘closeness’ among objects is represented as objects belonging to the same cycle, that is reachable from each other. The properties of such CAs are exploited for grouping the objects with minimum intra-cluster distance while ensuring that limited number of cycles exist in the configuration-space. The proposed algorithm follows an iterative strategy where the clusters with closely reachable objects of previous level are merged in the present level using an unique auxiliary CA. Finally, it is observed that, our algorithm is at least at par with the best algorithm existing today.
Fichier principal
Vignette du fichier
496967_1_En_3_Chapter.pdf (509.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03659463 , version 1 (05-05-2022)

Licence

Attribution

Identifiers

Cite

Sukanya Mukherjee, Kamalika Bhattacharjee, Sukanta Das. Cycle Based Clustering Using Reversible Cellular Automata. 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Aug 2020, Stockholm, Sweden. pp.29-42, ⟨10.1007/978-3-030-61588-8_3⟩. ⟨hal-03659463⟩
37 View
33 Download

Altmetric

Share

Gmail Facebook X LinkedIn More