The Hop eld-style Network as a Maximal-Clique Graph Machine

Abstract

The Hop eld-style network, a variant of the popular Hop eld neural network, has earlier been shown to have xed points (stable states) that correspond 1-1 with the maximal cliques of the underlying graph. The network sequentially transforms an initial state (set of vertices) to a nal state (maximal clique) via certain greedy operations. It has also been… (More)

Topics

4 Figures and Tables

Slides referencing similar topics