Clustering methods and their uses in computational chemistry

Reviews in Computational Chemistry

Volumn 18, Issue , 2002, Pages 1-40

  Downs, Geoff M ^a   Barnard, John M ^a  

^a Barnard Chemical Information Ltd   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645265985     PISSN: 10693599     EISSN: None     Source Type: Book Series    
DOI: 10.1002/0471433519.ch1     Document Type: Article

References (145)

1. P. H. A. Sneath and R. R. Sokal, Numerical Taxonomy, W. H. Freeman, San Francisco, CA, 1973.
2. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, Wiley-Interscience, New York, 1990.
3. B. S. Everitt, Cluster Analysis, 3rd ed., Edward Arnold, London, 1993.
4. A. D. Gordon, Classification, 2nd ed., Chapman and Hall, London, 1999.
5. P. Willett, Similarity and Clustering in Chemical Information Systems, Research Studies Press, Letchworth, UK, 1987.
6. N. Bratchell, Chemom. Intell. Lab. Systems, 6, 105 (1989). Cluster Analysis.
7. J. M. Barnard and G. M. Downs, J. Chem. Inf. Comput. Sci., 32 (6), 644 (1992). Clustering of Chemical Structures on the Basis of Two-Dimensional Similarity Measures.
8. G. M. Downs and P. Willett, in Advanced Computer-Assisted Techniques in Drug Discovery, H. van de Waterbeernd, Ed., VCH Publishers, Weinheim, 1994, pp. 111-130. Clustering of Chemical Structure Databases for Compound Selection.
9. R. A. Lewis, S. D. Pickett, and D. E. Clark, in Revieivs in Computational Chemistry, K. B. Lipkowitz and D. B. Boyd, Eds., Wiley-VCH, New York, 2000, Vol.16, pp. 1-51. Computer-Aided Molecular Diversity Analysis and Combinatorial Library Design.
10. Clustan Ltd., 16 Kingsburgh Road, Edinburgh, UK. http://www.clustan.com.
11. SAS Institute Inc., SAS Campus Drive, Cary, NC 27513, USA. http://www.sas.com.
12. Barnard Chemical Information Ltd., 46 Uppergate Road, Stannington, Sheffield S6 6BX, UK. http://wivw.bci.gb.com.
13. Chemical Computing Group Inc., 1010 Sherbrooke Street West, Suite 910, Montreal, Quebec H3A 2R7, Canada, http://www.chemcomp.com.
14. Daylight Chemical Information Systems Inc., 441 Greg Avenue, Santa Fe, NM 87501, USA. http://www.daylight.com.
15. Daylight Chemical Information Systems Inc., 441 Greg Avenue, Santa Fe, NM 87501, USA. http://www.daylight.com.
16. MDL Information Systems, Inc., 14600 Catalina Street, San Leandro, CA 94577, USA. http://www.mdl.com.
17. Accelrys (formerly Molecular Simulations Inc.), 9685 Scranton Road, San Diego, CA 92121-93752, USA. http://www.accelrys.com.
18. Tripos Inc., 1699 South Hanley Road, St. Louis, MO 63144, USA. http://www.tripos.com.
19. W. A. Warr, in Computational Methods for the Analysis of Molecular Diversity, P. Willett, Ed., Perspectives in Drug Discovery and Design, Vol.7/8, Kluwer/ESCOM, Dordrecht, The Netherlands, 1997, pp. 115-130. Commercial Software Systems for Diversity Analysis.
20. R. D. Brown, in Computational Methods for the Analysis of Molecular Diversity, P. Willett, Ed., Perspectives in Drug Discovery and Design, Vol.7/8, Kluwer/ESCOM, Dordrecht, The Netherlands, 1997, pp. 31-49. Descriptors for Diversity Analysis.
21. R. D. Brown and Y. C. Martin, J. Chem. Inf. Comput. Sci., 36 (3), 572 (1996). Use of Structure-Activity Data to Compare Structure-Based Clustering Methods and Descriptors for Use in Compound Selection.
22. R. D. Brown and Y. C. Martin, J. Chem. Inf. Comput. Sci., 37 (1), 1 (1997). The Information Content of 2D and 3D Structural Descriptors Relevant to Ligand-Receptor Binding.
23. G. M. Downs and P. Willett, in Reviews in Computational Chemistry, K. B. Lipkowitz and D. B. Boyd, Eds., VCH Publishers, New York, 1995, Vol.7, pp. 1-66. Similarity Searching in Databases of Chemical Structures.
24. P. Willett, J. M. Barnard, and G. M. Downs,J. Chem. Inf. Comput. Sci., 38 (6), 983 (1998). Chemical Similarity Searching.
25. J. M. Barnard, G. M. Downs, and P. Willett, in Virtual Screening for Bioactive Molecules, H.-J. Bohm and G. Schneider., Eds., Wiley, New York, 2000, pp. 59-80. Descriptor-Based Similarity Measures for Screening Chemical Databases.
26. J. S. Mason and S. D. Pickett, in Computational Methods for the Analysis of Molecular Diversity, P. Willett, Ed., Perspectives in Drug Discovery and Design, Vol.7/8, Kluwer/ ESCOM, Dordrecht, The Netherlands, 1997, pp. 85-114. Partition-Based Selection.
27. J. A. Hartigan, Clustering Algorithms, Wiley, New York, 1975.
28. F. Murtagh, COMPSTAT Lectures, 4, (1985). Multidimensional Clustering Algorithms.
29. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, Prentice Hall, Englewood Cliff, NJ, 1988.
30. G. N. Lance and W. T. Williams, Computer J., 9, 373 (1967). A General Theory of Classificatory Sorting Strategies. 1. Hierarchical Systems.
31. J. H. Ward, J. Am. Stat. Assoc, 58, 236 (1963). Hierarchical Grouping to Optimize an Objective Function.
32. E. M. Voorhees, Inf. Processing Management, 22 (6), 465 (1986). Implementing Agglom-erative Hierarchic Clustering Algorithms for Use in Document Retrieval.
33. X. Chen, A. Rusinko HI, and S. S. Young,J. Chem. Inf. Comput. Sci., 38 (6), 1054 (1998). Recursive Partitioning Analysis of a Large Structure-Activity Data Set Using Three-Dimen-sional Descriptors.
34. A. Guenoche, P. Hansen, and B. Jaumard, J. Classification, 8, 5 (1991). Efficient Algorithms for Divisive Hierarchical Clustering with the Diameter Criterion.
35. R. A. Jarvis and E. A. Patrick, IEEE Trans. Computers, C-22 (11), 1025 (1973). Clustering Using a Similarity Measure Based on Shared Near Neighbors.
36. S. A. Perry and P. Willett, J. Inf. Sci., 6, 59 (1983). A Review of the Use of Inverted Files for Best Match Searching in Information Rretrieval Systems.
37. A. P. Dempster, N. M. Laird, and D. B. Rubin, J. Royal Stat. Soc, B39, 1 (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm.
38. T. Kohonen, Self-organizing Maps, Springer-Verlag, Berlin, 1995.
39. J. Zupan and J. Gasteiger, Neural Networks for Chemists, An Introduction, VCH, Weinheim, 1993.
40. See also, K. L. Peterson, in Reviews in Computational Chemistry, K. B. Lipkowitz and D. B. Boyd, Eds., Wiley-VCH, New York, 2000, Vol.16, pp. 53-140. Artificial Neural Networks and Their Use in Chemistry.
41. F. Murtagh, in Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Reisende, Eds., Kluwer, Dordrecht, The Netherlands, 2001, pp. 401-545. Clustering in Massive Data Sets.
42. D. W. Matula, in Classification as a Tool of Research, W. Gaul and M. Schader, Eds., Elsevier Science (North-Holland), Amsterdam, 1986, pp. 289-301. Divisive vs. Agglomerative Average Linkage Hierarchical Clustering.
43. N. C.Jain, A. Indrayan, and L. R. Goel, Pattern Recognition, 19 (I), 95 (1986). Monte Carlo Comparison of Six Hierarchical Clustering Methods on Random Data.
44. J. Podani, Vegetatio, 81, 61 (1989). New Combinatorial Clustering Methods.
45. M. Roux, in Applied Multivariate Analysis in SAR and Environmental Studies, J. Devillers and W. Karcher, Eds., Kluwer, Dordrecht, The Netherlands, 1991, pp. 115-135. Basic Procedures in Hierarchical Cluster Analysis.
46. A. El-Hamdouchi and P. Willett, Computer J., 32, 220 (1989). Hierarchic Document Clustering using Ward's Method.
47. E. M. Rasmussen and P. Willett, J. Doc, 45 (2), 1 (1989). Efficiency of Hierarchical Agglomerative Clustering Using the ICL Distributed Array Processor.
48. G. M. Downs, P. Willett, and W. FisanickJ. Chem. Inf. Comput. Sci., 34 (5), 1094 (1994). Similarity Searching and Clustering of Chemical-Structure Databases Using Molecular Property Data.
49. S. Guha, R. Rastogi, and K. Shim, Technical Report, Bell Laboratories, Murray Hill, NJ, 1997. A Clustering Algorithm for Categorical Attributes.
50. S. Guha, R. Rastogi, and K. Shim, Inf. Systems, 25 (5), 345 (2000). ROCK: A Robust Clustering Algorithm for Categorical Attributes.
51. S. Guha, R. Rastogi, and K. Shim, in Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, WA, 1998, pp. 73-84. CURE: An Efficient Clustering Algorithm for Large Datasets.
52. G. Karypis, E.-H. Han, and V. Kumar, IEEE Computer: Special Issue on Data Analysis and Mining, 32 (8), 68 (1999). Chameleon: A Hierarchical Clustering Algorithm Using Dynamic Modeling.
53. G. Karypis, E.-H. Han, and V. Kumar, Technical Report No. 99-1020, Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN, 1999. Multilevel Refinement for Hierarchical Clustering.
54. D. Fasulo, Technical Report No. 01-03-102, Department of Computer Science & Engineering, University of Washington, Seattle, WA, 1999. An Analysis of Recent Work on Clustering Algorithms.
55. J. MacCuish, C. Nicolaou, and N. E. MacCuish, J. Chem. Inf. Comput. Sci., 41 (1), 134 (2001). Ties in Proximity and Clustering Compounds.
56. J. A. Garcia, J. Fdez-Valdivia, J. F. Cortijo, and R. Molina, Signal Processing, 44 (2), 181 (1994). A Dynamic Approach for Clustering Data.
57. Y. Wang, H.Yan, and C.SriskandarajahJ. Classification, 13,231 (1996). The Weighted Sum of Split and Diameter Clustering.
58. M. Steinbach, G. Karypis, and V. Kumar, Technical Report 00-034, Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN, 2000. A Comparison of Document Clustering Techniques.
59. D. M. Hawkins, S. S. Young, and A. Rusinko, Quant. Struct.-Act. Relat., 16, 396 (1997). Analysis of a Large Structure-Activity Data Set Using Recursive Partitioning.
60. X. Chen, A. Rusinko, and S. S. Young, J. Chem. Inf. Comput. Sci., 38 (6), 1054 (1998). Recursive Partitioning Analysis of a Large Structure-Activity Data Set Using Three-Dimen-sional Descriptors.
61. M. Wagenerand V. J. van GeeresteinJ. Chem. Inf. Compnt. Sci., 40 (2), 280 (2000). Potential Drugs and Nondrugs: Prediction and Identification of Important Structural Features.
62. D. W. Miller. Chem. Inf. Compnt. Sci., 41 (1), 168 (2001). Results of a New Classification Algorithm Combining K Nearest Neighbors and Recursive Partitioning.
63. T. Zhang, R. Ramakrishnan, and M. Livny, ACM SIGMOD Record, 25 (2), 103 (1996). BIRCH: An Efficient Data Clustering Method for Very Large Databases.
64. V. Ganti, R. Ramakrishnan, J. Gehrke, A. Powell, and J. French, Proceedings of the 15th International Conference on Data Engineering, Sydney, Australia, 1999, pp. 502-511. Clustering Large Datasets in Arbitrary Metric Spaces.
65. P. R. Menard, R. A. Lewis, and J. S. Mason J. Chem. Inf. Compnt. Sci., 38 (3), 379 (1998). Rational Screening Set Design and Compound Selection: Cascaded Clustering.
66. T. N. Doman, J. M. Cibulskis, M. J. Cibulskis, P. D. McCray, and D. P. Spangler, J. Chem. Inf. Compnt. Sci., 36 (6), 1195 (1996). Algorithm5: A Technique for Fuzzy Clustering of Chemical Inventories.
67. S. L. Taraviras, O. Ivanciuc, and D. Cabrol-Bass, J. Chem. Inf. Compnt. Sci., 40 (5), 1128 (2000). Identification of Groupings of Graph Theoretical Descriptors Using a Hybrid Cluster Analysis Approach.
68. K. C. Gowda and G. Krishna, Pattern Recognition, 10 (2), 105 (1978). Agglomerative Clustering Using the Concept of Mutual Nearest Neighborhood.
69. R. Dugad and N. Ahuja, IEEE International Conference on Acoustics Speech and Signal Processing, 5, 2761 (1998). Unsupervised Multidimensional Hierarchical Clustering.
70. E. Forgy, Biometrics, 21, 768 (1965). Cluster Analysis of Multivariate Data: Efficiency vs. Interpretability of Classifications.
71. J. MacQueen, in Proceedings of the Sth Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, CA, 1967, Vol.1, pp. 281-297. Some Methods for Classification and Analysis of Multivariate Observations.
72. J. A. Hartigan and M. A. Wong, Appl. Stat., 28,100 (1979). A K-Means Clustering Algorithm.
73. H. Spaeth, Eur.]. Operat. Res., 1,23 (1977). Computational Experiences with the Exchange Method.
74. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1973.
75. M. A. Ismail and M. S. Kamel, Pattern Recognition, 22, 75 (1989). Multidimensional Data Clustering Utilizing Hybrid Search Strategies.
76. Q. Zhang, Q. R. Wang, and R. D. Boyle, Pattern Recognition, 24 (4), 331 (1991). A Clustering Algorithm for Datasets with a Large Number of Classes.
77. Z. Huang, Int. J. Data Mining Knotuledge Disc, 2 (3), 283 (1998). Extensions to the K-Means Algorithm for Clustering Large Data Sets with Categorical Values.
78. Q. Zhang and R. D. Boyle, Pattern Recognition, 24 (9), 835 (1991). A New Clustering Algorithm with Multiple Runs of Iterative Procedures.
79. V. Estivell-Castro and J. Yang, Technical Report No. 99-103, Department of Computer Science & Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia. A Fast and Robust General Purpose Clustering Algorithm.
80. R. T. Ng and J. Han, in Proceedings of the 20th International Conference on Very Large Data Bases, Santiago, Chile, 1994, pp. 144-155. Efficient and Effective Clustering Methods for Spatial Data Mining.
81. R. E. Higgs, K. G. Bemis, I. A. Watson, and J. H. Wikel, ;. Chem. Inf. Compnt. Sci., 37 (5), 861 (1997). Experimental Designs for Selecting Molecules from Large Chemical Databases.
82. M. Snarey, N. K. Terrett, P. Willett, and D. J. Wilton, J. Mol. Graphics Modell., 15, 372 (1997). Comparison of Algorithms for Dissimilarity-Based Compound Selection.
83. D. Fisher, L. Xu, and N. Zard, in Proceedings of the 6th International Workshop on Machine Learning, Morgan Kaufmann, Aberdeen, UK, 1992, pp. 163-168. Ordering Effects in Clustering
84. G. W. Milligan, Psychometrika, 45 (3), 325 (1980). An Examination of the Effect of Six Types of Error Perturbation on Fifteen Clustering Algorithms.
85. D. Fisher, J. Artif. Intel], Res., 4, 147 (1996). Iterative Optimization and Simplification of Hierarchical Clusterings.
86. G. J. McLachlan and T. Krishnan, The EM Algorithm and Extensions, Wiley, New York, 1997.
87. J. D. Banfield and A. E. Raftery, Biometrics, 49, 803 (1993). Model-Based Gaussian and Non-Gaussian Clustering.
88. C. Fraley and A. E. Raftery, Computer J., 41 (S), 578 (1988). How Many Clusters? Which Clustering Method? Answers via Model-Based Cluster Analysis.
89. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, in Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 226-231. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.
90. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander, in Proceedings of the ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, 1999, pp. 49-60. OPTICS: Ordering Points to Identify Clustering Structure.
91. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, Proceedings of the Conference on Data Mining and Knowledge Discovery, Prague, Czech Repub., 1999.
92. In Lecture Notes in Computer Science, Springer, 1704, 262-270 (1999). OPTICS-OF: Identifying Local Outliers.
93. M. M. Breunig, H.-P. Kriegel, and J. Sander, in Proceedings of the European Conference on Principles and Practice of Knowledge Discovery in Databases, Lyon, France, 2000. Fast Hierarchical Clustering Based on Compressed Data and OPTICS.
94. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, in Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, WA, 1998, pp. 94-105. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications.
95. C. C. Aggarwal, C. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park, in Proceedings ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, 1999, pp. 61-72. Fast Algorithms for Projected Clustering.
96. H. S. Nagesh, M.Sc. Thesis, Northwestern University of Illinois, Evanston, IL, 1999. High Performance Subspace Clustering for Massive Data Sets.
97. D. W. Matula, in Classification and Clustering, J. van Ryzin, Ed., Academic Press, 1977, pp. 95-129. Graph Theoretic Techniques for Cluster Analysis Algorithms.
98. A. Ben-Dor, R.Shamir, and Z. Yakhini, J. Comput. Biol., 6 (3/4), 281 (1999). Clustering Gene Expression Patterns.
99. E. Hartuv, A. Schmitt, J. Lange, S. Meier-Ewart, H. Lehrach, and R. Shamir, in Proceedings 3rd International Conference on Computational Molecular Biology (RECOMB 99), Lyon, France, 1999. An Algorithm for Clustering cDNAs for Gene Expression Analysis.
100. R. Sharan and R. Shamir, in Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, CA, 2000, pp. 307-316. CLICK: A Clustering Algorithm with Application to Gene Expression Analysis.
101. I. Jonyer, L. B. Holder, and D. J. Cook, in Proceedings of the 13th Annual Florida AI Research Symposium, pp. 91-95, 2000 (http://www-cse.uta.edu/ ~cook/pubs). Graph-Based Hierarchical Conceptual Clustering.
102. F. Murtagh, Computer J., 26 (4), 354 (1983). A Survey of Recent Advances in Hierarchical Clustering Algorithms.
103. E. M. Rasmussen, G. M. Downs, and P. WillettJ. Comput. Chem., 9 (4), 378 (1988). Automatic Classification of Chemical Structure Databases Using a Highly Parallel Array Processor.
104. X. Li and Z. Fang, Parallel Computing, 11, 275 (1989). Parallel Clustering Algorithms.
105. X. Li, IEEE Trans. Pattern Anal. Machine Intelligence, 12 (11), 1088 (1990). Parallel Algorithms for Hierarchical Clustering and Cluster Validity.
106. F. Murtagh, IEEE Trans. Pattern Anal. Machine Intelligence, 14 (10), 1056 (1992). Comments on "Parallel Algorithms for Hierarchical Clustering and Cluster Validity".
107. C. F. Olson, Technical Report CSD-94-786, University of California, Berkeley, CA, 1994. Parallel Algorithms for Hierarchical Clustering.
108. R. Whaley and L. Hodes, J. Chem. Inf. Comput. Sci., 31 (2), 345 (1991). Clustering a Large Number of Compounds. 2. Using a Connection Machine.
109. A. McCallum, K. Nigam, and L. H. Ungar, in Advances in Knotvledge Discovery and Data Mining, MIT Press, Cambridge, MA, 2000. Efficient Clustering of High Dimensional Data Sets with Application to Reference Matching.
110. M. A. Johnson and G. M. Maggiora, Concepts and Applications of Molecular Similarity, Wiley, New York, 1990.
111. P. Willett, Anal. Chim. Acta, 136, 29 (1982). A Comparison of Some Hierarchical Agglomerative Clustering Algorithms for Structure-Property Correlation.
112. V. Rubin and P. Willett, Anal. Chim. Acta, 151, 161 (1983). A Comparison of Some Hierarchical Monothetic Divisive Clustering Algorithms for Structure-Property Correlation.
113. P. Willett, J. Chem. Inf. Comput. Sci., 24 (1), 29 (1984). Evaluation of Relocation Clustering Algorithms for the Automatic Classification of Chemical Structures.
114. R. G. Lawson and P. C. Jurs, J. Chem. Inf. Comput. Sci., 30 (1), 36 (1990). New Index for Clustering Tendency and Its Application to Chemical Problems.
115. J. W. McFarland and D.J. Gans,J. Med. Chem., 29,505-514 (1986). On the Significance of Clusters in Graphical Display of Structure-Activity Data.
116. S. Epter, M. Krishnamoorthy, and M. Zaki, Technical Report No. 99-106, Computer Science Department, Rensselaer Polytechnic Institute, Troy, NY, 1999. Clusterability Detection and Initial Seed Selection in Large Data Sets.
117. U. M. Fayyad, C. A. Reima, and P. S. Bradley, in Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, R. Agrawal, P. Stolorz, and G. Piatetsky-Shapiro, Eds., AAAI Press, Menlo Park, CA, 1998, pp. 194-198. Initialization of Iterative Refinement Clustering Algorithms.
118. P. S. Bradley and U. M. Fayyad, in Proceedings of the 15th International Conference on Machine Learning, Morgan Kaufmann, San Francisco, 1998, pp. 91-99. Refining Initial Points for K-Means Clustering.
119. G. W. Milligan and M. C. Cooper, Psychometrika, 50 (2), 159 (1985). An Examination of Procedures for Determining the Number of Clusters in a Data Set.
120. D. J. Wild and C. J. Blankley,J. Chem. Inf. Comput. Sci., 40 (1), 155 (2000). Comparison of 2D Fingerprint Types and Hierarchy Level Selection Methods for Structural Grouping Using Ward's Clustering.
121. L. A. Kelley, S. P. Gardner, and M.J. Sutcliffe, Protein Eng., 9, 1063 (1996). An Automated Approach for Clustering an Ensemble of NMR-Derived Protein Structures into Conformationally-Related Subfamilies.
122. G. W. Milligan, Psychometrika, 46 (2), 187 (1981). A Monte Carlo Study of Thirty Internal Criterion Measures for Cluster Analysis.
123. T. Calinski and J. Harabasz, Commun. Stat., 3 (1), 1 (1974). A Dendrite Method for Cluster Analysis.
124. D. M. Bayada, H. Hamersma, and V.J. van Geerestein,J. Chem. Inf. Comput. Set., 39 (1), 1 (1999). Molecular Diversity and Representativity in Chemical Databases.
125. V. J. van Geerestein, H. Hamersma, and S. P. van Helden, in Computer-Assisted Lead Finding and Optimization (Proceedings 9th European QSAR Meeting, Lausanne, Switzerland, 1996), H. van de Waterbeemd, B. Testa, and G. Folkers, Eds., Wiley-VCH, Basel, Switzerland, 1997, pp. 159-178. Exploiting Molecular Diversity: Pharmacophore Searching and Compound Clustering.
126. D.J. Wild and C.J. Blankley,J. Mol. Graphics Modell., 17(2), 85 (1999). VisualiSAR: A Web-Based Application for Clustering, Structure Browsing, and Structure-Activity Relationship Study.
127. M. F. M. Engels, T. Thielmans, D. Verbinnen, J. P. Tollenaere,, and R. Verbeeck,;. Chem. Inf. Compnt. Sci., 40 (2), 241 (2000). CerBeruS: A System Supporting the Sequential Screening Process.
128. M. F. M. Engels and P. Venkatarangan, Curr. Opin. Drug Discovery Dev., 4 (3), 275 (2001). Smart Screening: Approaches to Efficient HTS.
129. D. T. Stanton, T. W. Morris, S. Roychoudhury, and C. N. Parker, J. Chem. Inf. Comput. Sci., 39 (1), 21 (1999). Application of Nearest-Neighbor and Cluster Analyses in Pharmaceutical Lead Discovery.
130. D. T. Stanton, J. Chem. Inf. Comptit. Sci., 39 (1), 11 (1999). Evaluation and Use of BCUT Descriptors in QSAR and QSPR Studies.
131. R. S. Pearlman and K. M. Smith,;. Chem. Inf. Comput. Sci., 39 (1) 28-35 (1999). Metric Validation and the Receptor-Relevant Subspace Concept.
132. L. Hodes, ;. Chem. Inf. Comput. Sci., 29 (2), 66 (1989). Clustering a Large Number of Compounds. 1. Establishing the Method on an Initial Sample.
133. R. Whaley and L. Hodes, J. Chem. Inf. Comput. Sci., 31 (2), 347 (1991). Clustering a Large Number of Compounds. 3. The Limits of Classification.
134. D. ButinaJ. Chem. Inf. Comput. Sci., 39 (4), 747 (1999). Unsupervised Data Base Clustering Based on Daylight's Fingerprint and Tanimoto Similarity a Fast and Automated Way to Cluster Small and Large Data Sets.
135. C. H. Reynolds, R. Druker, and L. B. PfahlerJ. Chem. Inf. Comput. Sci., 38 (2), 305 (1998). Lead Discovery Using Stochastic Cluster Analysis (SCA): A New Method for Clustering Structurally Similar Compounds.
136. R. D. Clark and W. J. Langton, J. Chem. Inf. Comput. Sci., 38 (6), 1079 (1998). Balancing Representativeness Against Diversity Using Optimizable K-dissimilarity and Hierarchical Clustering.
137. P. Willett, V. Winterman, and D. BawdenJ. Chem. Inf. Comput. Sci., 26 (3), 109 (1986). Implementation of Nonhierarchic Cluster-Analysis Methods in Chemical Information Systems; Selection of Compounds for Biological Testing and Clustering of Substructure Search Output.
138. M. J. McGregor and P. V. PallaiJ. Chem. Inf. Comput. Sci., 37 (3), 443 (1997). Clustering Large Databases of Compounds: Using the MDL "Keys" as Structural Descriptors.
139. N. E. Shemetulskis, J. B. Dunbar, B. W. Dunbar, D. W. Moreland, and C. Humbler, J. Comput.-Aided Mol. Design, 9, 407 (1995). Enhancing the Diversity of a Corporate Database using Chemical Database Clustering and Analysis.
140. J. B. Dunbar, in Computational Methods for the Analysis of Molecular Diversity, P. Willett, Ed., Perspectives in Drug Discovery and Design, Vol.7/8, Kluwer/ESCOM, Dordrecht, The Netherlands, 1997, pp. 51-63. Cluster-Based Selection.
141. G. M. Downs and P. Willett, in Applied Multivariate Analysis in SAR and Environmental Studies, J. Devillers and W. Karcher, Eds., Kluwer, Dordrecht, The Netherlands, 1991, pp. 247-279. The Use of Similarity and Clustering Techniques for the Prediction of Molecular Properties.
142. J. Nouwen and B. Hansen, SAR and QSAR in Environmental Research, 4, 1 (1995). An Investigation of Clustering as a Tool in Quantitative Structure-Activity Relationships (QSARs).
143. J. Nouwen, F. Lindgren, B. Hansen, W. Karcher, H. J. M. Verhaar, and J. L. M. Hermens, J. Chemometrics, 10, 385 (1996). Fast Screening of Large Databases Using Clustering and PCA based on Structure Fragments.
144. R. G. Lawson and P. C. Jurs, J. Chem. Inf. Comput. Sci., 30 (2), 137 (1990). Cluster Analysis of Acrylates to Guide Sampling for Toxicity Testing.
145. J. Sadowski, M. Wagener, and J. Gasteiger, Angew. Client., Int. Ed. Engl., 34 (23/24), 2674 (1995/1996). Assessing Similarity and Diversity of Combinatorial Libraries by Spatial Autocorrelation Functions and Neural Networks.