%0 Conference Proceedings
%T Cycle Based Clustering Using Reversible Cellular Automata
%+ Department of Computer Science and Engineering
%+ Department of Information Technology [Howrah]
%A Mukherjee, Sukanya
%A Bhattacharjee, Kamalika
%A Das, Sukanta
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Stockholm, Sweden
%Y Hector Zenil
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-12286
%P 29-42
%8 2020-08-10
%D 2020
%R 10.1007/978-3-030-61588-8_3
%K Reversible cellular automata
%K Reachability
%K Large length cycle
%K Level-wise clustering
%K Connectivity
%K Silhouette score
%K Dunn index
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-03659463/document
%2 https://inria.hal.science/hal-03659463/file/496967_1_En_3_Chapter.pdf
%L hal-03659463
%U https://inria.hal.science/hal-03659463
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-12286