A Neural Relaxation Technique for Chemical Graph Matching
نویسنده
چکیده
We develop a binary relaxation scheme for graph matching in chemical databases. The technique works by iteratively pruning the list of matching possibilities for individual atoms based upon contextual information. Its key features include delayed decision-making, robustness to noise, and fast and eecient neural implementation. We illustrate the utility of the technique by comparing it with probabilistic relaxation for a small database of 2D structures, and suggest that it may be applicable to matching in large databases of both 2D and 3D chemical graphs.
منابع مشابه
Chemical Similarity Searching with neural graph matching methods
The thesis examines three novel structural similarity methods that employ a network of simple auto-associative neural networks for storing structural information about databases of molecular graphs. This information can be used to discover similarities from a query graph to any of the graphs in the model database. The fast learning and recall ability of the neural network facilitates efficient ...
متن کاملA Lagrangian relaxation network for graph matching
A Lagrangian relaxation network for graph matching is presented. The problem is formulated as follows: given graphs G and g, find a permutation matrix M that brings the two sets of vertices into correspondence. Permutation matrix constraints are formulated in the framework of deterministic annealing. Our approach is in the same spirit as a Lagrangian decomposition approach in that the row and c...
متن کاملCellular Associative Neural Networks (CANN)
We propose to present a novel syntactic pattern matching technique [1] that combines the correlative learning and generalisation properties of associative memories, with the parallel and distributed operation of cellular automata [2]. The tool is used for recognizing two dimensional objects in images. Each section of the object to be studied is represented by a cell, initially containing a low ...
متن کاملColor Matching of Blends Prepared From Black and White Fibers by Neural Networks (TECHNICAL NOTE)
The color of the blends of pre-colored fibers depends on the ratio of each fiber in the blends. Some theories have been introduced for color matching of blends of pre-colored fibers. Most however, are restricted in scope and accuracy. Kubelka and Munk presented the most applicable theory, which is still used in industry. In this work, the classical Kubelka-Munk method for color prediction of a ...
متن کاملA Neural Supergraph Matching Architecture
A neural supergraph matching architecture is introduced based on relaxation labeling and the minimum common supergraph of pairs of graphs. The system is implemented on correlation matrix memories and is efficient in constructing this supergraph. We test the effectiveness of this graphical cluster representation on two different sets of graphs.
متن کامل