The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Comparison of descriptor spaces for chemical compound retrieval and classification
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
Ames, B. N., Durston, W. E., Yamasaki, E., & Lee, F. D. (1973) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.70.8.2281 · Cited by 2,276
Morgan, H. L. (1965) · Journal of Chemical Documentation · doi:10.1021/c160017a018 · Cited by 1,692
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
Brown, R. D., & Martin, Y. C. (1996) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci9501047 · Cited by 625
Use of receiver operating characteristic (ROC) analysis to evaluate sequence matching
Gribskov, M., & Robinson, N. L. (1996) · Computers & Chemistry · doi:10.1016/s0097-8485(96)80004-0 · Cited by 468
Characteristic Physical Properties and Structural Fragments of Marketed Oral Drugs
Vieth, M., Siegel, M. G., Higgs, R. E., Watson, I. A., Robertson, D. H., Savin, K. A., Durst, G. L., & Hipskind, P. A. (2004) · Journal of Medicinal Chemistry · doi:10.1021/jm030267j · Cited by 359
Self-citationAn 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-citationCyclic pattern kernels for predictive graph mining
Horváth, T., Gärtner, T., & Wrobel, S. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014072 · Cited by 308
Rogers, D., Brown, R. D., & Hahn, M. (2005) · SLAS Discovery · doi:10.1177/1087057105281365 · Cited by 296
Hert, J., Willett, P., Wilton, D. J., Acklin, P., Azzaoui, K., Jacoby, E., & Schuffenhauer, A. (2004) · Organic & Biomolecular Chemistry · doi:10.1039/b409865j · Cited by 260
Cited by
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
Discriminative Embeddings of Latent Variable Models for Structured Data
Dai, H., Dai, B., & Song, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05629 · Cited by 454
Kriege, N. M., Johansson, F. D., & Morris, C. (2020) · Applied Network Science · doi:10.1007/s41109-019-0195-3 · Cited by 381
Graph Convolutional Networks with EigenPooling
Ma, Y., Wang, S., Aggarwal, C. C., & Tang, J. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330982 · Cited by 320
Metadata
- Authors
- Wale, N., Watson, I. A., & Karypis, G.
- Venue
- Knowledge and Information Systems
- Published
- 2007-08-23
- Volume
- 14
- Issue
- 3
- Pages
- 347-375
- ISSN
- 0219-1377 (ISSN-L)
- 0219-3116
- OpenAlex
- W2034618876
- Cited by
- 453
- References
- 19
- FWCI
- 9.90
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Comparison of descriptor spaces for chemical compound retrieval and classification. https://app.cochat.ai/papers/10.1007/s10115-007-0103-5
- The paper
- Wale, N., Watson, I. A., & Karypis, G. (2008). Comparison of descriptor spaces for chemical compound retrieval and classification. Knowledge and Information Systems. https://doi.org/10.1007/s10115-007-0103-5
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.