Network Unfolding Map by Edge Dynamics Modeling
Filipe Alves Neto Verri, Paulo Roberto Urio, Liang Zhao

TL;DR
This paper introduces a novel network unfolding map based on edge dynamics modeling, using particles to solve semi-supervised learning problems by capturing complex connectivity patterns and class boundaries.
Contribution
The work develops a deterministic, low-complexity model that unfolds network edges to reveal data class structures, advancing beyond vertex-only dynamics approaches.
Findings
Model effectively identifies nonlinear class boundaries.
Unfolding map captures complex connectivity patterns.
Simulations demonstrate success on real and artificial data.
Abstract
The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network, which are called particles, to solve semi-supervised learning problems. Three actions govern the particles' dynamics: generation, walking, and absorption. Labeled vertices generate new particles that compete against rival particles for edge domination. Active particles randomly walk in the network until they are absorbed by either a rival vertex or an edge currently dominated by rival particles. The result from the model evolution consists of sets of edges arranged by the label dominance. Each set tends to form a connected subnetwork to represent a data class. Although the intrinsic dynamics of the model is a stochastic one, we prove there exists a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
