Results of a New Classification Algorithm Combining K Nearest Neighbors and Recursive Partitioning

David W. Miller
Bioreason, Inc., 150 Washington Avenue, Suite 303, Santa Fe, New Mexico 87501
J. Chem. Inf. Comput. Sci., 2001, 41 (1), pp 168–175
DOI: 10.1021/ci0003348
Publication Date (Web): November 1, 2000
Copyright © 2001 American Chemical Society

 Phone:  (505) 995-8188, ext 211. Fax:  (505) 995-8186. E-mail:  dmiller@bioreason.com.

Abstract

We present results of a new computational learning algorithm combining favorable elements of two well-known techniques:  K nearest neighbors and recursive partitioning. Like K nearest neighbors, the method provides an independent prediction for each test sample under consideration, while like recursive partitioning, it incorporates an automatic selection of important input variables for model construction. The new method is applied to the problem of correctly classifying a set of chemical data samples designated as being either active or inactive in a biological screen. Training is performed at varying levels of intrinsic model complexity, and classification performance is compared to that of both K nearest neighbor and recursive partitioning models trained using the identical protocol. We find that the cross-validated performance of the new method outperforms both of these standard techniques over a considerable range of user parameters. We discuss advantages and drawbacks of the new method, with particular emphasis on its parameter robustness, required training time, and performance with respect to chemical structural class.

Tools

SciFinder Links

SciFinder subscribers:  Click to sign in | Not a SciFinder subscriber? Learn more at www.cas.org

History

  • Published In Issue January 22, 2001
  • Received July 24, 2000

Recommend & Share

Related Content

Other ACS content by these authors: