Comparing Structures Using a Hopfield-Style Neural Network

  • Authors:
  • Kristina Schädler;Fritz Wysotzki

  • Affiliations:
  • FR 5-8, Department of Computer Science, Technical University of Berlin, Franklinstr. 28/29, 10587 Berlin, Germany. schaedle@cs.tu-berlin.de;FR 5-8, Department of Computer Science, Technical University of Berlin, Franklinstr. 28/29, 10587 Berlin, Germany. wysotzki@cs.tu-berlin.de

  • Venue:
  • Applied Intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Labeled graphs are an appropriate and popularrepresentation of structured objects in many domains. If the labelsdescribe the properties of real world objects and their relations,finding the best match between two graphs turns out to be the weaklydefined, NP-complete task of establishing a mapping between them thatmaps similar parts onto each other preserving as much as possible oftheir overall structural correspondence. In this paper, formerapproaches of structural matching and constraint relaxation byspreading activation in neural networks and the method of solvingoptimization tasks using Hopfield-style nets are combined. Theapproximate matching task is reformulated as the minimization of aquadratic energy function. The design of the approach enables theuser to change the parameters and the dynamics of the net so thatknowledge about matching preferences is included easily andtransparently. In the last section, some examples demonstrate thesuccessful application of this approach in classification andlearning in the domain of organic chemistry.