Automatic generation of complementary descriptors with molecular graph networks.
We describe a method for the automatic generation of weakly correlated descriptors for molecular data sets. The method can be regarded as a statistical learning procedure that turns the molecular graph, representing the 2D formula of the compound, into an adaptive whole molecule composite descriptor. By translating the molecular graph structure into a dynamical system, the algorithm can compute an output value that is highly sensitive to the molecular topology. This system can be trained by gradient descent techniques, which rely on the efficient calculation of the gradient by back-propagation. We present computational experiments concerning the classification of the Developmental Therapeutics Program AIDS antiviral screen data set on which the performance of the method compares with that of approaches based on substructure comparison.
Merkwirth
Christian
C
Computational Biology and Applied Algorithmics Group, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany. cmerk@mpi-sb.mpg.de
Lengauer
Thomas
T
D000465:Algorithms; D019380:Anti-HIV Agents / Q000737:chemistry / Q000145:classification; D001331:Automation; D019295:Computational Biology / Q000379:methods*; D004353:Drug Evaluation, Preclinical
D019380:Anti-HIV Agents