Concepedia

Publication | Closed Access

Development and Validation of a Novel Variable Selection Technique with Application to Multidimensional Quantitative Structure−Activity Relationship Studies

94

Citations

11

References

1999

Year

Abstract

Variable selection is typically a time-consuming and ambiguous procedure in performing quantitative structure−activity relationship (QSAR) studies on overdetermined (regressor-heavy) data sets. A variety of techniques including stepwise and partial least squares/principlal components analysis (PLS/PCA) regression have been applied to this common problem. Other strategies, such as neural networks, cluster significance analysis, nearest neighbor, or genetic (function) or evolutionary algorithms have also evaluated. A simple random selection strategy that implements iterative generation of models, but directly avoids crossover and mutation, has been developed and is implemented herein to rapidly identify from a pool of allowable variables those which are most closely associated with a given response variable. The FRED (fast random elimination of descriptors) algorithm begins with a population of offspring models composed of either a fixed or variable number of randomly selected variables. Iterative elimination of descriptors leads naturally to subsequent generations of more fit offspring models. In contrast to common genetic and evolutionary algorithms, only those descriptors determined to contribute to the genetic makeup of less fit offspring models are eliminated from the descriptor pool. After every generation, a new random increment line search of the remaining descriptors initiates the development of the next generation of randomly constructed models. An optional algorithm that eliminates highly correlated descriptors in a stepwise manner prior to the development of the first generation of offspring greatly enhances the efficiency of the FRED algorithm. A comparison of the results of a FRED analysis of the Selwood data set (n = 31 compounds, k = 53 descriptors) with those obtained from alternative algorithms reveals that this technique is capable of identifying the same “optimal” solutions in an efficient manner.

References

YearCitations

Page 1