Clustering of chemical data sets for drug discovery

Chemoinformatics clustering algorithms are important issues for drug discovery process. So, there are many clustering algorithms that are available for analyzing large chemical data sets of medium and high dimensionality. The quality of these algorithms depends on the nature of data sets and the accuracy needed by the application. The applications of clustering algorithms in the drug discovery process are compound selection, virtual library generation, High-Throughput Screening (HTS), Quantitative Structure-Activity Relationship (QSAR) analysis and Absorption, Distribution, Metabolism, Elimination and Toxicity (ADMET) prediction. Based on Structure-Activity Relationship (SAR) model, compounds with similar structure have similar biological activities. So, clustering algorithms must group more similar compounds in one cluster. K-Means, bisecting K-Means and Ward clustering algorithms are the most popular clustering algorithms that have a wide range of applications in chemoinformatics. In this paper, a comparative study between these algorithms is presented. These algorithms are applied over homogeneous and heterogeneous chemical data sets. The results are compared to determine which algorithms are more suitable depending on the nature of data sets, computation time and accuracy of produced clusters. Accuracy is evaluated using standard deviation metric. Experimental results show that K-Means algorithm is preferable for small number of clusters for homogeneous and heterogeneous data sets in terms of time and standard deviation. Bisecting K-Means and Ward algorithms are preferable for large number of clusters for homogeneous and heterogeneous data sets in term of standard deviation, but bisecting K-Means algorithm is preferable in term of time.

[1]  Ian A. Watson,et al.  Experimental Designs for Selecting Molecules from Large Chemical Databases , 1997, J. Chem. Inf. Comput. Sci..

[3]  Ying Liu,et al.  A Comparative Study on Feature Selection Methods for Drug Discovery , 2004, J. Chem. Inf. Model..

[4]  Steven P. van Helden,et al.  Exploiting Molecular Diversity: Pharmacophore Searching and Compound Clustering , 2007 .

[5]  György M Keseru,et al.  Hit discovery and hit-to-lead approaches. , 2006, Drug discovery today.

[6]  A. Khalid.  Design and Molecular Docking of Antioxidant Lead Compound and its Analogues Acting as Human Tyrosine Kinase Inhibitors , 2013 .

[7]  Thomas Engel,et al.  Basic Overview of Chemoinformatics , 2006, J. Chem. Inf. Model..

[8]  George Karypis,et al.  Comparison of descriptor spaces for chemical compound retrieval and classification , 2006, Sixth International Conference on Data Mining (ICDM'06).

[9]  S. Balbach,et al.  Compound selection for development - is salt formation the ultimate answer? Experiences with an extended concept of the "100mg approach". , 2014, European journal of pharmaceutical sciences : official journal of the European Federation for Pharmaceutical Sciences.

[10]  Jérôme Hert,et al.  New Methods for Ligand-Based Virtual Screening: Use of Data Fusion and Machine Learning to Enhance the Effectiveness of Similarity Searching , 2006, J. Chem. Inf. Model..

[11]  E. Fersini,et al.  Relational clustering and Bayesian networks for linking gene expression profiles and drug activity patterns , 2009, 2009 IEEE International Conference on Bioinformatics and Biomedicine Workshop.

[12]  D J Wild,et al.  VisualiSAR: a web-based application for clustering, structure browsing, and structure-activity relationship study. , 1999, Journal of molecular graphics & modelling.

[13]  Naomie Salim,et al.  Combining Multiple Clusterings of Chemical Structures Using Cumulative Voting-Based Aggregation Algorithm , 2013, ACIIDS.

[14]  John M. Barnard,et al.  Chemical Similarity Searching , 1998, J. Chem. Inf. Comput. Sci..

[15]  Thierry Kogej,et al.  Multifingerprint Based Similarity Searches for Targeted Class Compound Selection , 2006, J. Chem. Inf. Model..

[16]  Hongliang Fei,et al.  Computational prediction of toxicity , 2010, 2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).

[17]  Denis M. Bayada,et al.  Molecular Diversity and Representativity in Chemical Databases , 1999, J. Chem. Inf. Comput. Sci..

[18]  Nathan Brown,et al.  A Chemoinformatics Analysis of Hit Lists Obtained from High-Throughput Affinity-Selection Screening , 2006, Journal of biomolecular screening.

[19]  Ichigaku Takigawa,et al.  Graph mining: procedure, application to drug discovery and recent advances. , 2013, Drug discovery today.

[20]  Charu C. Aggarwal,et al.  Managing and Mining Graph Data , 2010, Managing and Mining Graph Data.

[21]  Peter C. Jurs,et al.  Cluster analysis of acrylates to guide sampling for toxicity testing , 1990, J. Chem. Inf. Comput. Sci..

[22]  A. Bender,et al.  In silico target fishing: Predicting biological targets from chemical structure , 2006 .