Use of asynchronous cellular automata in clustering problem
From MaRDI portal
Cites work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Characterization of 1-d periodic boundary reversible CA
- CLOUDS IN THE BASINS OF FULLY ASYNCHRONOUS CELLULAR AUTOMATA
- Clustering Using Cyclic Spaces of Reversible Cellular Automata
- Computation and construction universality of reversible cellular automata
- Cycle based clustering using reversible cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Dynamics groups of asynchronous cellular automata
- Guided tour of asynchronous cellular automata
- Hierarchical clustering using reversible binary cellular automata for high-dimensional data
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 1070886 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- scientific article; zbMATH DE number 6257036 (Why is no real title available?)
- On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view
- Reachability problem in non-uniform cellular automata
- Reversibility in asynchronous cellular automata
- Reversibility of elementary cellular automata under fully asynchronous update
- Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence
- Reversible cellular automata: a natural clustering technique
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Well-Separated Clusters and Optimal Fuzzy Partitions
This page was built for publication: Use of asynchronous cellular automata in clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7300517)