Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

S. Stanley Young

Papers on DiSC'04


Learning a Complex Metabolomic Dataset Using Random Forests and Support Vector Machines

Learning a Complex Metabolomic Dataset Using Random Forests and Support Vector Machines

Publications


Note: Links lead to the DBLP on the Web.

S. Stanley Young

Jennifer Pittman , J. Sacks , S. Stanley Young: The Construction and Assessment of a Statistical Model for the Prediction of Protein Assay Data. Journal of Chemical Information and Computer Sciences 42 (3): 729-741 (2002)

Bingming Yi , Jacqueline M. Hughes-Oliver , Lei Zhu , S. Stanley Young: A Factorial Design To Optimize Cell-Based Drug Discovery Analysis. Journal of Chemical Information and Computer Sciences 42 (5): 1221-1229 (2002)

Xin Chen , Andrew Rusinko III , Alexander Tropsha , S. Stanley Young: Automated Pharmacophore Identification for Large Chemical Data Sets1. Journal of Chemical Information and Computer Sciences 39 (5): 887-896 (1999)

Andrew Rusinko III , Mark W. Farmen , Christophe G. Lambert , Paul L. Brown , S. Stanley Young: Analysis of a Large Structure/Biological Activity Data Set Using Recursive Partitioning. Journal of Chemical Information and Computer Sciences 39 (6): 1017-1026 (1999)

Xin Chen , Andrew Rusinko III , S. Stanley Young: Recursive Partitioning Analysis of a Large Structure-Activity Data Set Using Three-Dimensional Descriptors1. Journal of Chemical Information and Computer Sciences 38 (6): 1054-1062 (1998)

S. Stanley Young, Charles F. Sheffield , Mark Farmen : Optimum Utilization of a Compound Collection or Chemical Library for Drug Discovery. Journal of Chemical Information and Computer Sciences 37 (5): 892-899 (1997)

1 [ 3 ]

2 [ 2 ] [ 4 ]

3 [ 1 ]

4 [ 3 ]

5 [ 5 ]

6 [ 3 ]

7 [ 6 ]

8 [ 2 ] [ 3 ] [ 4 ]

9 [ 6 ]

10 [ 1 ]

11 [ 4 ]

12 [ 5 ]

13 [ 5 ]




©2005 Association for Computing Machinery