Cited by 75Biomedical Text Mining and OntologiesBioinformatics and Genomic Networksscientometrics and bibliometrics research

A quantitative model for linking two disparate sets of articles in MEDLINE

Open access
Torvik, Vetle I., Smalheiser, Neil R.·2007·Bioinformatics

Abstract

Background: Identifying information that implicitly links two disparate sets of articles is a fundamental and intuitive data mining strategy that can help investigators address real scientific questions. The Arrowsmith two-node search finds title words and phrases (so-called B-terms) that are shared across two sets of articles within MEDLINE and displays them in a manner that facilitates human assessment. A serious stumbling-block has been the lack of a quantitative model for predicting which of the hundreds if not thousands of B-terms computed for a given search are most likely to be relevant to the investigator. Methodology/Principal Findings: Using a public two-node search interface, field testers devised a set of two-node searches under real life conditions and a certain number of B-terms were marked relevant. These were employed as ‘gold standards;’ each B-term was characterized according to eight complementary features that were strongly correlated with relevance. A logistic regression model was developed that permits one to estimate the probability of relevance for each B-term, to rank B-terms according to their likely relevance, and to estimate the overall number of relevant B-terms inherent in a given two-node search. Conclusions/Significance: The model greatly simplifies and streamlines the process of carrying out a two-node search, and may be applicable to a number of other literature-based discovery applications, including the so-called one-node search and related gene-centric strategies that incorporate implicit links to predict how genes may be related to each other and to human diseases. This should encourage much wider exploration of text mining for implicit information among the general scientific community. Availability: Two-node searches can be carried out freely at http://arrowsmith.psych.uic.edu Contact: neils@uic.edu, vtorvik@uic.edu Supplementary information: Supplementary data are available at Bioinformatics online.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btm161

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Existing LBD methods and tools primarily quantify the strength of association without assessing relevance to or support of a specific scientific hypothesis.

    “However, while existing LBD methods can efficiently identify statistically significant associations between biomedical terms, they generally lack a structured framework for evaluating whether these discovered associations meaningfully support or contradict a specific scientific hypothesis.”

    From SKiM-GPT: combining biomedical literature-based discovery with large language model hypothesis evaluation (2025) · cites this paper as [34]

    The Introduction says earlier approaches lacked a quantitative model for predicting which linking terms would be relevant to a given search. The Discussion says the paper introduces such a model, while the scientist ultimately decides whether a link is meaningful. These passages support the distinction between finding links and assessing relevance, but they do not establish that LBD methods generally lack a framework for evaluating whether an association supports or contradicts a specific hypothesis. (LLM, conf=0.86)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 9

  1. Aronson,A.R. (2001) Effective mapping of biomedical text to the UMLS Metathesaurus: the MetaMap program. Proc. AMIA Symp., 17-21.
  2. Bennett,N.A. et al. (1999) Extracting noun phrases for all of MEDLINE. Proc. AMIA Symp., 671-675.
  3. Hersh,W. et al. (2005). TREC 2005 Genomics track overview. In Voorhees,E.M. and Buckland,L.P. (eds.). NIST Special Publication 500-266: The Fourteenth Text Retrieval Conference (TREC 2005). National Institute of Standards and Technology, Gaithersburg, pp. 25-50.
  4. Hosmer,D.W. and Lemeshow,S. (2000) Applied Logistic Regression. 2nd edn. Wiley, New York.
  5. Li,X. and Liu,B. (2005) Learning from positive and unlabeled examples with different data distributions. In Gama,J., et al. (eds.) Proceedings of the 16th European Conference Machine Learning (ECML 2005). Lecture Notes in Artificial Intelligence. Vol. 3720. Springer-Verlag Press, Berlin. pp. 218-229.
  6. Nakagawa,H. and Mori,T. (1998) Nested collocation and compound noun for term recognition. Proceedings of Workshop on Computational Terminology, Montreal, Canada. pp. 64-70.
  7. Ohta,T. et al. (2006) An intelligent search engine and GUI-based efficient MEDLINE search tool based on deep syntactic parsing. Proceedings of the COLING/ACL 2006 Interactive Presentation Sessions, Sydney, Australia. pp. 17-20.
  8. Smalheiser,N.R. (2005) The Arrowsmith project: 2005 status report. In Hoffmann,A. et al. (ed.) Discovery Science 2005. Lecture Notes in Artificial Intelligence. Vol. 3735, Springer-Verlag Press, Berlin, pp. 26-43.
  9. Voorhees,E.M. and Harman,D.K. (2005) TREC: Experiment and Evaluation in Information Retrieval. MIT Press, Cambridge, MA.

Cited by

Sorted by citations

Authors
Torvik, V. I., & Smalheiser, N. R.
Affiliations
University of Illinois Chicago (US)
Corresponding author
Smalheiser, Neil R.
Venue
Bioinformatics
Published
2007-04-26
Volume
23
Issue
13
Pages
1658-1665
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2164173383
Cited by
75
References
1
Citations by year
2025: 1 · 2024: 1 · 2023: 8 · 2022: 2 · 2021: 3 · 2020: 5 · 2019: 10 · 2018: 2 · 2017: 4 · 2016: 3 · 2015: 4 · 2014: 6 · 2012: 2
FWCI
2.38
Type
journal article
Language
en
Open access
Licence
cc-by-nc
Locations
  • Bioinformatics (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
Funders
  • National Institutes of Health
  • U.S. National Library of Medicine (LM08364, R21LM008364, R01LM007292, LM007292)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Biomedical Text Mining and Ontologies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Social Sciences › Decision Sciences › Statistics, Probability and Uncertainty › scientometrics and bibliometrics research
Keywords
MEDLINE, B-term, relevance prediction, logistic regression, literature-based discovery, text mining, Arrowsmith, bibliographic database searching
MeSH terms
Algorithms, Artificial Intelligence, Natural Language Processing, Terminology as Topic, Pattern Recognition, Automated, Periodicals as Topic, MEDLINE, Information Storage and Retrieval, Vocabulary, Controlled

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