The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Mining molecular fragments: finding relevant substructures of molecules
Open accessAbstract
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of for instance, activity in a drug discovery context. Instead of carrying out a brute-force search, our method generates fragments by embedding them in all appropriate molecules in parallel and prunes the search tree based on a local order of the atoms and bonds, which results in substantially faster search by eliminating the need for frequent, computationally expensive reembeddings and by suppressing redundant search. We prove the usefulness of our algorithm by demonstrating the discovery of activity-related groups of chemical compounds in the well-known National Cancer Institute's HIV-screening dataset.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Weislow, O. S., Kiser, R., Fine, D. L., Bader, J., Shoemaker, R. H., & Boyd, M. R. (1989) · JNCI: Journal of the National Cancer Institute · doi:10.1093/jnci/81.8.577 · Cited by 685
Induction of Association Rules: Apriori Implementation
Borgelt, C., & Kruse, R. (2002) · Compstat · doi:10.1007/978-3-642-57489-4_59 · Cited by 288
Self-citationMolecular 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
Raymond, J. W., Gardiner, E. J., & Willett, P. (2002) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci010381f · Cited by 154
Automated Approaches for Classifying Structures
Deshpande, M., Kuramochi, M., & Karypis, G. (2002) · Defense Technical Information Center (DTIC) · doi:10.21236/ada439498 · Cited by 60
Cited by
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
In silico toxicology: computational methods for the prediction of chemical toxicity
Raies, A. B., & Bajic, V. B. (2016) · WIREs Computational Molecular Science · doi:10.1002/wcms.1240 · Cited by 744
Graph indexing: a frequent structure-based approach
Yan, X., Yu, P. S., & Han, J. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007607 · Cited by 637
CloseGraph: mining closed frequent graph patterns
Yan, X., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956784 · Cited by 635
Sabe, V. T., Ntombela, T., Jhamba, L. A., Maguire, G. E. M., Govender, T., Naicker, T., & Kruger, H. G. (2021) · European Journal of Medicinal Chemistry · doi:10.1016/j.ejmech.2021.113705 · Cited by 625
Metadata
- Authors
- Borgelt, C., & Berthold, M. R.
- Venue
- 2002 IEEE International Conference on Data Mining, 2002. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-26
- Pages
- 51-58
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2119148238
- Cited by
- 442
- References
- 7
- FWCI
- 19.58
- Type
- conference paper
- Language
- en
- Open access
- green
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.