The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Molecular feature mining in HIV data
Open accessAbstract
We present the application of Feature Mining techniques to the Developmental Therapeutics Program's AIDS antiviral screen database. The database consists of 43576 compounds, which were measured for their capability to protect human cells from HIV-1 infection. According to these measurements, the compounds were classified as either active, moderately active or inactive. The distribution of classes is extremely skewed: Only 1.3 % of the molecules is known to be active, and 2.7 % is known to be moderately active. Given this database, we were interested in molecular substructures (i.e., features) that are frequent in the active molecules, and infrequent in the inactives. In data mining terms, we focused on features with a minimum support in active compounds and a maximum support in inactive compounds. We analyzed the database using the levelwise version space algorithm that forms the basis of the inductive query and database system MOLFEA (Molecular Feature Miner). Within this framework, it is possible to declaratively specify the features of interest, such as the frequency of features on (possibly different) datasets as well as on the generality and syntax of them. Assuming that the detected substructures are causally related to biochemical mechanisms, it should be possible to facilitate the development of new pharmaceuticals with improved activities.
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
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
Weininger, D. (1988) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00057a005 · Cited by 7,436
Cited by
Frequent substructure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.127 · Cited by 371
BigSMILES: A Structurally-Based Line Notation for Describing Macromolecules
Lin, T.-S., Coley, C. W., Mochigase, H., Beech, H. K., Wang, W., Wang, Z., Woods, E., Craig, S. L., Johnson, J. A., Kalow, J. A., et al. (2019) · ACS Central Science · doi:10.1021/acscentsci.9b00476 · Cited by 322
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
Efficiently mining frequent trees in a forest: algorithms and applications
Zaki, M. J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.125 · Cited by 306
Statistical evaluation of the Predictive Toxicology Challenge 2000–2001
Toivonen, H., Srinivasan, A., King, R. D., Kramer, S., & Helma, C. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg130 · Cited by 196
Self-citation
Metadata
- Authors
- Kramer, S., De Raedt, L., & Helma, C.
- Venue
- Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2001-08-26
- Pages
- 136-143
- OpenAlex
- W1985104873
- Cited by
- 226
- References
- 2
- FWCI
- 10.32
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Molecular feature mining in HIV data. https://app.cochat.ai/papers/10.1145/502512.502533
- The paper
- Kramer, S., De Raedt, L., & Helma, C. (2001). Molecular feature mining in HIV data. Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/502512.502533
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.