메뉴 건너뛰기




Volumn 12, Issue 1, 2009, Pages 98-107

Clustering and its application in multi-target prediction

Author keywords

Chemical databases; Cluster analysis; Computational toxicology; CYP450; QSAR; Similarity analysis

Indexed keywords

CYTOCHROME P450; CYTOCHROME P450 1A2; CYTOCHROME P450 2B6; CYTOCHROME P450 2C19; CYTOCHROME P450 2C9; CYTOCHROME P450 2D6; CYTOCHROME P450 3A4; DIBENZO[C,F][2,7]NAPHTHYRIDINE DERIVATIVE; MAMMALIAN TARGET OF RAPAMYCIN; NAPHTHYRIDINE DERIVATIVE; PHOSPHATIDYLINOSITOL 3 KINASE; PROTEIN KINASE B; UNCLASSIFIED DRUG;

EID: 58449120191     PISSN: 13676733     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review
Times cited : (14)

References (37)
  • 1
    • 58449118134 scopus 로고    scopus 로고
    • Harrison PJ: A method of cluster analysis and some applications. J Appl Stat (1968) 17(3):226-236. • This publication was among the first to cite the usefulness of clustering to chemical analysis. This paper is consistently cited in the literature.
    • Harrison PJ: A method of cluster analysis and some applications. J Appl Stat (1968) 17(3):226-236. • This publication was among the first to cite the usefulness of clustering to chemical analysis. This paper is consistently cited in the literature.
  • 2
    • 0037348826 scopus 로고    scopus 로고
    • Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures
    • Raymond JW, Blankley CJ, Willett P: Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures. J Mol Graph Model (2003) 21(5):421-433.
    • (2003) J Mol Graph Model , vol.21 , Issue.5 , pp. 421-433
    • Raymond, J.W.1    Blankley, C.J.2    Willett, P.3
  • 3
    • 58449085087 scopus 로고    scopus 로고
    • Daylight theory - fingerprints: Daylight, Aliso Viejo, CA, USA (2008). www.daylight.com/dayhtml/doc/theory/theory.finger.html • An overview of the Daylight method of fingerprinting, a popular method of representing chemical compounds in the context of creating computational models.
    • Daylight theory - fingerprints: Daylight, Aliso Viejo, CA, USA (2008). www.daylight.com/dayhtml/doc/theory/theory.finger.html • An overview of the Daylight method of fingerprinting, a popular method of representing chemical compounds in the context of creating computational models.
  • 4
    • 0032671931 scopus 로고    scopus 로고
    • Unsupervised database clustering based on Daylight's Fingerprint and Tanimoto Similarity: A fast and automated way to cluster small and large data sets
    • Butina D: Unsupervised database clustering based on Daylight's Fingerprint and Tanimoto Similarity: A fast and automated way to cluster small and large data sets. J Chem Inform Comput Sci (1999) 39(4):747-750.
    • (1999) J Chem Inform Comput Sci , vol.39 , Issue.4 , pp. 747-750
    • Butina, D.1
  • 5
    • 77955515750 scopus 로고    scopus 로고
    • Euclidean distance
    • Black PE Ed, US National Institute of Standards and Technology, Gaithersburg, MD, USA
    • Black PE: Euclidean distance. In: Dictionary of Algorithms and Data Structures. Black PE (Ed), US National Institute of Standards and Technology, Gaithersburg, MD, USA (2004). www.nist.gov/dads/HTML/euclidndstnc. html
    • (2004) Dictionary of Algorithms and Data Structures
    • Black, P.E.1
  • 6
  • 7
    • 34248536513 scopus 로고    scopus 로고
    • th Annual International Computer Software and Applications Conference 2005
    • th Annual International Computer Software and Applications Conference (2005).
  • 8
    • 34548288901 scopus 로고    scopus 로고
    • On principal component analysis, cosine and euclidean measures in information retrieval
    • Korenius T, Laurikkala J, Juhola M: On principal component analysis, cosine and euclidean measures in information retrieval. Inform Sci (2007) 177(22):4893-4905.
    • (2007) Inform Sci , vol.177 , Issue.22 , pp. 4893-4905
    • Korenius, T.1    Laurikkala, J.2    Juhola, M.3
  • 9
    • 84893405732 scopus 로고    scopus 로고
    • Data clustering: A review
    • A comprehensive review of 'classical' clustering analysis, with a brief exploration of evolutionary, genetic algorithm, and simulated annealing-based methods of clustering, ••
    • Jain AK, Murty MN, Flynn PJ: Data clustering: a review. ACM Comput Surv (1999) 31(3):264-323. •• A comprehensive review of 'classical' clustering analysis, with a brief exploration of evolutionary, genetic algorithm, and simulated annealing-based methods of clustering.
    • (1999) ACM Comput Surv , vol.31 , Issue.3 , pp. 264-323
    • Jain, A.K.1    Murty, M.N.2    Flynn, P.J.3
  • 10
    • 20444364008 scopus 로고    scopus 로고
    • Comparison of distance measures in cluster analysis with dichotomous data
    • Finch H: Comparison of distance measures in cluster analysis with dichotomous data. J Data Sci (2005) 3(1):85-100.
    • (2005) J Data Sci , vol.3 , Issue.1 , pp. 85-100
    • Finch, H.1
  • 11
    • 0001899045 scopus 로고    scopus 로고
    • Improved heterogeneous distance functions
    • This paper explores situations where datasets are composed of continuous and nominal data, datasets which are of particular interest in the realm of chemical clustering, •
    • Wilson R, Martinez T: Improved heterogeneous distance functions. J Artif Intell Res (1997) 6:1-34. • This paper explores situations where datasets are composed of continuous and nominal data - datasets which are of particular interest in the realm of chemical clustering.
    • (1997) J Artif Intell Res , vol.6 , pp. 1-34
    • Wilson, R.1    Martinez, T.2
  • 13
    • 27244434833 scopus 로고    scopus 로고
    • Using kNN model for automatic feature selection
    • Guo G, Neagu D, Cronin MTD: Using kNN model for automatic feature selection. Lect Notes Comput Sci (2005) 3686:410-419.
    • (2005) Lect Notes Comput Sci , vol.3686 , pp. 410-419
    • Guo, G.1    Neagu, D.2    Cronin, M.T.D.3
  • 14
    • 58449088591 scopus 로고    scopus 로고
    • Tanimoto TT: An elementary mathematical theory of classification and prediction. IBM Internal Report (1957) 17th Nov. • This article is a commonly cited article in the realm of similarity analysis. This measure of similarity is considered an extension of the Jaccard similarity coefficient.
    • Tanimoto TT: An elementary mathematical theory of classification and prediction. IBM Internal Report (1957) 17th Nov. • This article is a commonly cited article in the realm of similarity analysis. This measure of similarity is considered an extension of the Jaccard similarity coefficient.
  • 16
    • 33746132663 scopus 로고    scopus 로고
    • Willett P, Winterman V, Bawden D: Implementation of nonhierarchic cluster analysis methods in chemical information structure search. J Chem Inform Comput Sci (1986) 26(3):109-118. • This paper explores the effectiveness of various methods of clustering, and concludes that in certain cases, Jarvis-Patrick is a particularly effective method of clustering.
    • Willett P, Winterman V, Bawden D: Implementation of nonhierarchic cluster analysis methods in chemical information structure search. J Chem Inform Comput Sci (1986) 26(3):109-118. • This paper explores the effectiveness of various methods of clustering, and concludes that in certain cases, Jarvis-Patrick is a particularly effective method of clustering.
  • 17
    • 58449091943 scopus 로고    scopus 로고
    • Hierarchical cluster analysis
    • John Wiley & Sons Inc, Hoboken, NJ, USA
    • Hubert LJ: Hierarchical cluster analysis. In: Encyclopedia of Statistical Sciences. John Wiley & Sons Inc, Hoboken, NJ, USA (2006).
    • (2006) Encyclopedia of Statistical Sciences
    • Hubert, L.J.1
  • 18
    • 58449102532 scopus 로고    scopus 로고
    • Ward's clustering algorithm
    • John Wiley & Sons Inc, Hoboken, NJ, USA
    • Mojena R: Ward's clustering algorithm. In: Encyclopedia of Statistical Sciences. John Wiley & Sons Inc, Hoboken, NJ, USA (2006).
    • (2006) Encyclopedia of Statistical Sciences
    • Mojena, R.1
  • 19
    • 0001138328 scopus 로고
    • Algorithm AS 136: A K-Means clustering algorithm
    • This paper, while not the initial paper in describing the K-means method of clustering, is instead an efficient and often-used method of K-means clustering, •
    • Hartigan JA, Wong MA: Algorithm AS 136: A K-Means clustering algorithm. J Appl Stat (1979) 28(1):100-108. • This paper, while not the initial paper in describing the K-means method of clustering, is instead an efficient and often-used method of K-means clustering.
    • (1979) J Appl Stat , vol.28 , Issue.1 , pp. 100-108
    • Hartigan, J.A.1    Wong, M.A.2
  • 20
    • 0001218972 scopus 로고
    • Clustering and the continuous k-means algorithm
    • Faber V: Clustering and the continuous k-means algorithm. Los Alamos Science (1994) 22: 138-144.
    • (1994) Los Alamos Science , vol.22 , pp. 138-144
    • Faber, V.1
  • 21
    • 0015680655 scopus 로고
    • Clustering using a similarity measure based on shared near neighbors
    • Jarvis RA, Patrick EA: Clustering using a similarity measure based on shared near neighbors. IEEE Trans Comput (1973) 22(11):1025- 1034.
    • (1973) IEEE Trans Comput , vol.22 , Issue.11 , pp. 1025-1034
    • Jarvis, R.A.1    Patrick, E.A.2
  • 22
    • 0036663707 scopus 로고    scopus 로고
    • Maximum common subgraph isomorphism algorithms for the matching of chemical structures
    • Raymond JW, Willett P: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J Comput Aided Mol Des (2002) 16(7):521-533.
    • (2002) J Comput Aided Mol Des , vol.16 , Issue.7 , pp. 521-533
    • Raymond, J.W.1    Willett, P.2
  • 23
    • 20444410051 scopus 로고    scopus 로고
    • Database clustering with a combination of fingerprint and Maximum Common Substructure methods
    • Stahl M, Mauser H: Database clustering with a combination of fingerprint and Maximum Common Substructure methods. J Chem Inform Model (2005) 45(3):542-548.
    • (2005) J Chem Inform Model , vol.45 , Issue.3 , pp. 542-548
    • Stahl, M.1    Mauser, H.2
  • 24
    • 0142124182 scopus 로고    scopus 로고
    • Finding discriminating structural features by reassembling common building blocks
    • This paper describes a method of clustering currently employed by the Leadscope Predictive Data Miner, a popular application under use by regulatory and industry groups, ••
    • Cross KP, Myatt G, Yang C, Fligner MA, Verducci JS, Blower PE Jr: Finding discriminating structural features by reassembling common building blocks. J Med Chem (2003) 46(22):4770-4775. •• This paper describes a method of clustering currently employed by the Leadscope Predictive Data Miner, a popular application under use by regulatory and industry groups.
    • (2003) J Med Chem , vol.46 , Issue.22 , pp. 4770-4775
    • Cross, K.P.1    Myatt, G.2    Yang, C.3    Fligner, M.A.4    Verducci, J.S.5    Blower Jr, P.E.6
  • 30
    • 32144432668 scopus 로고    scopus 로고
    • Identification of a buried pocket for potent and selective inhibition of Chk1: Prediction and verification
    • Foloppe N, Fisher LM, Francis G, Howes R, Kierstan P, Potter A: Identification of a buried pocket for potent and selective inhibition of Chk1: Prediction and verification. Bioorg Med Chem (2006) 14(6):1792-1804.
    • (2006) Bioorg Med Chem , vol.14 , Issue.6 , pp. 1792-1804
    • Foloppe, N.1    Fisher, L.M.2    Francis, G.3    Howes, R.4    Kierstan, P.5    Potter, A.6
  • 31
    • 0142231577 scopus 로고    scopus 로고
    • Structural basis for UCN-01 (7-hydroxystaurosporine) specificity and PDK1 (3-phosphoinositide-dependent protein kinase-1) inhibition
    • Komander D, Kular GS, Bain J, Elliott M, Alessi DR, Van Aalten DM: Structural basis for UCN-01 (7-hydroxystaurosporine) specificity and PDK1 (3-phosphoinositide-dependent protein kinase-1) inhibition. Biochemistry (2003) 375(Pt 2):255-262.
    • (2003) Biochemistry , vol.375 , Issue.PART 2 , pp. 255-262
    • Komander, D.1    Kular, G.S.2    Bain, J.3    Elliott, M.4    Alessi, D.R.5    Van Aalten, D.M.6
  • 33
    • 85142152099 scopus 로고    scopus 로고
    • Chen X, Lin Y, Liu M, Gilson MK: The Binding Database: Data management and interface design. Bioinformatics (2002) 18(1):130-139. •• The Binding Database is an openly accessible repository of binding data for a large and diverse set of compounds for a variety of targets.
    • Chen X, Lin Y, Liu M, Gilson MK: The Binding Database: Data management and interface design. Bioinformatics (2002) 18(1):130-139. •• The Binding Database is an openly accessible repository of binding data for a large and diverse set of compounds for a variety of targets.
  • 34
    • 33846108633 scopus 로고    scopus 로고
    • BindingDB: A web-accessible database of experimentally determined protein-ligand binding affinities
    • Liu T, Lin Y, Wen X, Jorrisen RN, Gilson MK: BindingDB: A web-accessible database of experimentally determined protein-ligand binding affinities. Nucleic Acids Res (2007) 35:D198-D201.
    • (2007) Nucleic Acids Res , vol.35
    • Liu, T.1    Lin, Y.2    Wen, X.3    Jorrisen, R.N.4    Gilson, M.K.5
  • 35
    • 37849010073 scopus 로고    scopus 로고
    • Editorial overview - Ethnic variation in drug response: Implications for the development and regulation of drugs
    • Johnson DE, Park K, Smith DA: Editorial overview - Ethnic variation in drug response: Implications for the development and regulation of drugs. Curr Opin Drug Discov Dev (2008) 11(1):29-31.
    • (2008) Curr Opin Drug Discov Dev , vol.11 , Issue.1 , pp. 29-31
    • Johnson, D.E.1    Park, K.2    Smith, D.A.3
  • 37
    • 0032154982 scopus 로고    scopus 로고
    • A monothetic clustering method
    • Chavent M: A monothetic clustering method. Pattern Recogn Lett (1998) 19(11):989-996.
    • (1998) Pattern Recogn Lett , vol.19 , Issue.11 , pp. 989-996
    • Chavent, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.