The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Frequent substructure-based approaches for classifying chemical compounds
Abstract
Computational techniques that build models to correctly assign chemical compounds to various classes of interest have many applications in pharmaceutical research and are used extensively at various phases during the drug development process. These techniques are used to solve a number of classification problems such as predicting whether or not a chemical compound has the desired biological activity, is toxic or nontoxic, and filtering out drug-like compounds from large compound libraries. This paper presents a substructure-based classification algorithm that decouples the substructure discovery process from the classification model construction and uses frequent subgraph discovery algorithms to find all topological and geometric substructures present in the data set. The advantage of this approach is that during classification model construction, all relevant substructures are available allowing the classifier to intelligently select the most discriminating ones. The computational scalability is ensured by the use of highly efficient frequent subgraph discovery algorithms coupled with aggressive feature selection. Experimental evaluation on eight different classification problems shows that our approach is computationally scalable and, on average, outperforms existing schemes by 7 percent to 35 percent.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
(1992) · Cited by 23,431
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Advances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
The Properties of Known Drugs. 1. Molecular Frameworks
Bemis, G. W., & Murcko, M. A. (1996) · Journal of Medicinal Chemistry · doi:10.1021/jm9602928 · Cited by 2,482
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
Willett, P., Barnard, J. M., & Downs, G. M. (1998) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9800211 · Cited by 1,765
Scalable algorithms for association mining
Zaki, M. J. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846291 · Cited by 1,751
Inductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
CMAR: accurate and efficient classification based on multiple class-association rules
Li, W., Han, J., & Pei, J. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989541 · Cited by 1,204
Kuramochi, M., & Karypis, G. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989534 · Cited by 1,068
Self-citationAtom pairs as molecular features in structure-activity studies: definition and applications
Carhart, R. E., Smith, D. H., & Venkataraghavan, R. (1985) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00046a002 · Cited by 1,066
HANSCH, C., MALONEY, P. P., FUJITA, T., & MUIR, R. M. (1962) · Nature · doi:10.1038/194178b0 · Cited by 1,056
Hit and lead generation: beyond high-throughput screening
Bleicher, K. H., Böhm, H.-J., Müller, K., & Alanine, A. I. (2003) · Nature Reviews Drug Discovery · doi:10.1038/nrd1086 · Cited by 1,056
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Inokuchi, A., Washio, T., & Motoda, H. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_2 · Cited by 1,039
Integration of virtual and high-throughput screening
Bajorath, J. (2002) · Nature Reviews Drug Discovery · doi:10.1038/nrd941 · Cited by 930
3D QSAR in drug design : theory, methods and applications
Kubinyi, H. (2000) · Medical Entomology and Zoology · Cited by 858
Hall, L. H., & Kier, L. B. (1995) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00028a014 · Cited by 763
Advances in Kernel Methods: Support Vector Learning
(1998) · The MIT Press eBooks · doi:10.7551/mitpress/1130.001.0001 · Cited by 761
Lewell, X. Q., Judd, D. B., Watson, S. P., & Hann, M. M. (1998) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci970429i · Cited by 691
(1990) · Cited by 671
Efficient mining of frequent subgraphs in the presence of isomorphism
Huan, J., Wang, W., & Prins, J. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250974 · Cited by 614
Fast vertical mining using diffsets
Zaki, M. J., & Gouda, K. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956788 · Cited by 593
Byvatov, E., Fechner, U., Sadowski, J., & Schneider, G. (2003) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci0341161 · Cited by 565
Neural Networks for Chemists: An Introduction
Zupan, J., & Gasteiger, J. (1993) · Medical Entomology and Zoology · Cited by 560
Karypis, G. (2002) · doi:10.21236/ada439508 · Cited by 546
Self-citationHansch, C., Muir, R. M., Fujita, T., Maloney, P. P., Geiger, F., & Streich, M. (1963) · Journal of the American Chemical Society · doi:10.1021/ja00901a033 · Cited by 514
Methods and Principles in Medicinal Chemistry
(2008) · Methods and principles in medicinal chemistry · doi:10.1002/series6138 · Cited by 514
Automatic generation of 3D-atomic coordinates for organic molecules
Gasteiger, J., Rudolph, C., & Sadowski, J. (1990) · Tetrahedron Computer Methodology · doi:10.1016/0898-5529(90)90156-3 · Cited by 511
Mining molecular fragments: finding relevant substructures of molecules
Borgelt, C., & Berthold, M. R. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183885 · Cited by 442
Cook, D. J., & Holder, L. B. (2000) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.850825 · Cited by 406
The Information Content of 2D and 3D Structural Descriptors Relevant to Ligand-Receptor Binding
Brown, R. D., & Martin, Y. C. (1997) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci960373c · Cited by 378
Nilakantan, R., Bauman, N., Dixon, J. S., & Venkataraghavan, R. (1987) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00054a008 · Cited by 366
An efficient algorithm for discovering frequent subgraphs
Kuramochi, M., & Karypis, G. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.33 · Cited by 352
Self-citationMorik, K. J., Brockhausen, P., & Joachims, T. (1999) · RePEc: Research Papers in Economics · Cited by 350
Andrea, T. A., & Kalayeh, H. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00113a022 · Cited by 287
Properties of Known Drugs. 2. Side Chains
Bemis, G. W., & Murcko, M. A. (1999) · Journal of Medicinal Chemistry · doi:10.1021/jm9903996 · Cited by 271
Turbo-charging vertical mining of large databases
Shenoy, P., Haritsa, J. R., Sudarshan, S., Bhalotia, G., Bawa, M., & Shah, D. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335376 · Cited by 260
The Characterization of Chemical Structures Using Molecular Properties. A Survey
Livingstone, D. J. (2000) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci990162i · Cited by 252
King, R. D., Muggleton, S. H., Srinivasan, A., & Sternberg, M. J. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.1.438 · Cited by 231
Molecular feature mining in HIV data
Kramer, S., De Raedt, L., & Helma, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502533 · Cited by 226
Neural Networks in QSAR and Drug Design
(1996) · Elsevier eBooks · doi:10.1016/b978-0-12-213815-7.x5000-6 · Cited by 221
King, R. D., Muggleton, S., Lewis, R. A., & Sternberg, M. J. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.23.11322 · Cited by 219
Xiao, Q., Liu, K., Hong, Y., & Tang, H. (2024) · ACS In Focus · doi:10.1021/acsinfocus.7e8012 · Cited by 190
Analysis of a Large Structure/Biological Activity Data Set Using Recursive Partitioning
Rusinko, A., Farmen, M. W., Lambert, C. G., Brown, P. L., & Young, S. S. (1999) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9903049 · Cited by 187
Chemical Similarity Using Geometric Atom Pair Descriptors
Sheridan, R. P., Miller, M. D., Underwood, D. J., & Kearsley, S. K. (1996) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci950275b · Cited by 183
Finding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
Virtual Screening for Bioactive Molecules
(2000) · Methods and Principles in Medicinal Chemistry · doi:10.1002/9783527613083 · Cited by 167
Diversity Profiling and Design Using 3D Pharmacophores: Pharmacophore-Derived Queries (PDQ)
Pickett, S. D., Mason, J. S., & McLay, I. M. (1996) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci960039g · Cited by 157
Frequent sub-structure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., & Karypis, G. (2004) · Proceedings · doi:10.1109/icdm.2003.1250900 · Cited by 153
Self-citationTurbo-charging vertical mining of large databases
Shenoy, P., Haritsa, J. R., Sudarshan, S., Bhalotia, G., Bawa, M., & Shah, D. (2000) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/342009.335376 · Cited by 129
Rapid approximation to molecular surface area via the use of Boolean logic and look‐up tables
Grand, S. M. L., & Merz, K. M. (1993) · Journal of Computational Chemistry · doi:10.1002/jcc.540140309 · Cited by 128
Binary Quantitative Structure−Activity Relationship (QSAR) Analysis of Estrogen Receptor Ligands
Gao, H., Williams, C., Labute, P., & Bajorath, J. (1998) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci980140g · Cited by 96
Srinivasan, A., & King, R. D. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009815821645 · Cited by 89
Virtual screening using grid computing: the screensaver project
Richards, W. G. (2002) · Nature Reviews Drug Discovery · doi:10.1038/nrd841 · Cited by 81
Chen, X., Rusinko, A., & Young, S. S. (1998) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci980089g · Cited by 72
Warmr: a data mining tool for chemical data
King, R. D., Srinivasan, A., & Dehaspe, L. (2001) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1008171016861 · Cited by 67
Automated Approaches for Classifying Structures
Deshpande, M., Kuramochi, M., & Karypis, G. (2002) · Defense Technical Information Center (DTIC) · doi:10.21236/ada439498 · Cited by 60
Self-citationBINARY QSAR: A NEW METHOD FOR THE DETERMINATION OF QUANTITATIVE STRUCTURE ACTIVITY RELATIONSHIPS
Labute, P. (1998) · Pacific Symposium on Biocomputing (PSB) · doi:10.1142/9789814447300_0044 · Cited by 57
The industrialization of drug discovery
Handen, J. S. (2002) · Drug Discovery Today · doi:10.1016/s1359-6446(01)02099-2 · Cited by 54
Discovering frequent geometric subgraphs
Kuramochi, M., & Karypis, G. (2003) · Proceedings · doi:10.1109/icdm.2002.1183911 · Cited by 47
Self-citationTamura, S. Y., Bacha, P. A., Gruver, H. S., & Nutt, R. F. (2002) · Journal of Medicinal Chemistry · doi:10.1021/jm010535i · Cited by 32
Modelling Structure‐Activity Relationships
Bravi, G., Gancia, E., Green, D. V. S., et al. (2000) · Methods and principles in medicinal chemistry · doi:10.1002/9783527613083.ch5 · Cited by 19
Comparisons of classification methods for screening potential compounds
An, A., & Wang, Y. (2002) · Proceedings · doi:10.1109/icdm.2001.989495 · Cited by 13
Substructure Discovery in SUBDUE
Holder, L. B. (1988) · Defense Technical Information Center (DTIC) · doi:10.21236/ada197050 · Cited by 11
Cited by
Introducing DDEC6 atomic population analysis: part 3. Comprehensive method to compute bond orders
Manz, T. A. (2017) · RSC Adv. · doi:10.1039/c7ra07400j · Cited by 511
DGCNN: A convolutional neural network over large-scale labeled graphs
Phan, A. V., Nguyen, M. L., Nguyen, Y. L. H., & Bui, L. T. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.09.001 · Cited by 355
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
Metadata
- Authors
- Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2005-08
- Volume
- 17
- Issue
- 8
- Pages
- 1036-1050
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2161723275
- Cited by
- 371
- References
- 69
- FWCI
- 16.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.