Online Arbitrary Shaped Clustering through Correlated Gaussian Functions

Ole Christian Eidheim
2/13/2023
cs.LGcs.CVcs.NE

No confident code implementation found for this paper.

Abstract

There is no convincing evidence that backpropagation is a biologically plausible mechanism, and further studies of alternative learning methods are needed. A novel online clustering algorithm is presented that can produce arbitrary shaped clusters from inputs in an unsupervised manner, and requires no prior knowledge of the number of clusters in the input data. This is achieved by finding correlated outputs from functions that capture commonly occurring input patterns. The algorithm can be deemed more biologically plausible than model optimization through backpropagation, although practical applicability may require additional research. However, the method yields satisfactory results on several toy datasets on a noteworthy range of hyperparameters.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{eidheim2023online,
  title  = {Online Arbitrary Shaped Clustering through Correlated Gaussian Functions},
  author = {Ole Christian Eidheim},
  year   = {2023},
  eprint = {2302.06335},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.06335v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.06335.svg)](https://codeofpaper.com/paper/2302.06335)

Discussion