Community detection with spiking neural networks for neuromorphic hardware
Not on the map. Why?
Abstract (arXiv)
We present results related to the performance of an algorithm for community detection which incorporates event-driven computation. We define a mapping which takes a graph G to a system of spiking neurons. Using a fully connected spiking neuron system, with both inhibitory and excitatory synaptic connections, the firing patterns of neurons within the same community can be distinguished from firing patterns of neurons in different communities. On a random graph with 128 vertices and known community structure we show that by using binary decoding and a Hamming-distance based metric, individual communities can be identified from spike train similarities. Using bipolar decoding and finite rate thresholding, we verify that inhibitory connections prevent the spread of spiking patterns.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.
- 2021SpikE: spike-based embeddings for multi-relational graph datacited by 9
- 2021Randomized Algorithms for Scientific Computing (RASC)cited by 3
- 2022Neuro-symbolic computing with spiking neural networkscited by 2
- 2022Neuro-symbolic computing with spiking neural networks4 Aug 2022
- 2021SpikE: spike-based embeddings for multi-relational graph data27 Apr 2021
- 2021Randomized Algorithms for Scientific Computing (RASC)19 Apr 2021