Thomas C. Rindflesch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Thomas C. Rindflesch has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Marcelo Fiszman
3 shared publicationsGraciela Rosemblat
2 shared publicationsHalil Kilicoglu
2 shared publications- Halil Kilicoglu
Lister Hill National Center for Biomedical Communications, National Library of Medicine, Bethesda, USA
2 shared publications - Anita Burgun
Clinical Bioinformatics Laboratory, Imagine Institute, Université Paris Cité, INSERM UMR1163, 24 Boulevard du Montparnasse, Paris, F-75006, France, 33 668169844
1 shared publication - Bartlomiej Wilkowski
DTUInformatics, Technical University of Denmark, Kongens Lyngby, Denmark
1 shared publication
Latest Publications
- Open Access
- 27 July 2017
- Published by Oxford University Press (OUP) in ILAR Journal
- Vol. 58 (1) , 80-89
Informatics Support for Basic Research in Biomedicine
Informatics methodologies exploit computer-assisted techniques to help biomedical researchers manage large amounts of information. In this paper, we focus on the biomedical research literature (MEDLINE). We first provide an overview of some text mining techniques that offer assistance in research by identifying biomedical entities (e.g., genes, substances, and diseases) and relations between them in text. We then discuss Semantic MEDLINE, an application that integrates PubMed document retrieval, concept and relation identification, and visualization, thus enabling a user to explore concepts and relations from within a set of retrieved citations. Semantic MEDLINE provides a roadmap through content and helps users discern patterns in large numbers of retrieved citations. We illustrate its use with an informatics method we call “discovery browsing,” which provides a principled way of navigating through selected aspects of some biomedical research area. The method supports an iterative process that accommodates learning and hypothesis formation in which a user is provided with high level connections before delving into details. As a use case, we examine current developments in basic research on mechanisms of Alzheimer’s disease. Out of the nearly 90 000 citations returned by the PubMed query “Alzheimer’s disease,” discovery browsing led us to 73 citations on sortilin and that disorder. We provide a synopsis of the basic research reported in 15 of these. There is wide-spread consensus among researchers working with a range of animal models and human cells that increased sortilin expression and decreased receptor expression are associated with amyloid beta and/or amyloid precursor protein.
- 27 July 2017
- Published by Oxford University Press (OUP) in ILAR Journal
- Vol. 58 (1) , 80-89
Open AccessInformatics Support for Basic Research in Biomedicine
Informatics methodologies exploit computer-assisted techniques to help biomedical researchers manage large amounts of information. In this paper, we focus on the biomedical research literature (MEDLINE). We first provide an overview of some text mining techniques that offer assistance in research by identifying biomedical entities (e.g., genes, substances, and diseases) and relations between them in text. We then discuss Semantic MEDLINE, an application that integrates PubMed document retrieval, concept and relation identification, and visualization, thus enabling a user to explore concepts and relations from within a set of retrieved citations. Semantic MEDLINE provides a roadmap through content and helps users discern patterns in large numbers of retrieved citations. We illustrate its use with an informatics method we call “discovery browsing,” which provides a principled way of navigating through selected aspects of some biomedical research area. The method supports an iterative process that accommodates learning and hypothesis formation in which a user is provided with high level connections before delving into details. As a use case, we examine current developments in basic research on mechanisms of Alzheimer’s disease. Out of the nearly 90 000 citations returned by the PubMed query “Alzheimer’s disease,” discovery browsing led us to 73 citations on sortilin and that disorder. We provide a synopsis of the basic research reported in 15 of these. There is wide-spread consensus among researchers working with a range of animal models and human cells that increased sortilin expression and decreased receptor expression are associated with amyloid beta and/or amyloid precursor protein.
- 7 January 2014
- Published by Wiley in Journal of the Association for Information Science and Technology
- Vol. 65 (3) , 501-512
Framing serendipitous information‐seeking behavior for facilitating literature‐based discovery: A proposed model
Several researchers have studied serendipitous knowledge discovery in information‐seeking behavior. Electronic data in the form of semantic predications have a potential role in literature‐based discovery, which can be guided by serendipitous knowledge discovery research findings. We sought to model information‐seeking behavior within the context of serendipitous knowledge discovery by leveraging existing research. These efforts were done with an eye for a potential literature‐based discovery application that utilizes semantic predications. We performed a literature search, reviewed the results, and applied the findings in developing a model for serendipitous knowledge discovery as an information‐seeking behavior. The literature review indicated four important themes in serendipitous knowledge discovery: iteration, change or clarification, a seeker's prior knowledge, and the role of information organization and presentation. The Interaction Flow in Serendipitous Knowledge Discovery (IF‐SKD) model includes these themes, and accommodates iterative, evolving search interests. Output can be presented in a manner to enhance short‐term memory conceptualization and connections with prior knowledge. Although the IF‐SKD model is currently a theoretical structure, its utility is demonstrated through replicating a literature‐based discovery event, using a documented search method within the model's steps. The IF‐SKD model can potentially serve as the foundation for future literature‐based discovery applications.
- 7 January 2014
- Published by Wiley in Journal of the Association for Information Science and Technology
- Vol. 65 (3) , 501-512
Framing serendipitous information‐seeking behavior for facilitating literature‐based discovery: A proposed model
Several researchers have studied serendipitous knowledge discovery in information‐seeking behavior. Electronic data in the form of semantic predications have a potential role in literature‐based discovery, which can be guided by serendipitous knowledge discovery research findings. We sought to model information‐seeking behavior within the context of serendipitous knowledge discovery by leveraging existing research. These efforts were done with an eye for a potential literature‐based discovery application that utilizes semantic predications. We performed a literature search, reviewed the results, and applied the findings in developing a model for serendipitous knowledge discovery as an information‐seeking behavior. The literature review indicated four important themes in serendipitous knowledge discovery: iteration, change or clarification, a seeker's prior knowledge, and the role of information organization and presentation. The Interaction Flow in Serendipitous Knowledge Discovery (IF‐SKD) model includes these themes, and accommodates iterative, evolving search interests. Output can be presented in a manner to enhance short‐term memory conceptualization and connections with prior knowledge. Although the IF‐SKD model is currently a theoretical structure, its utility is demonstrated through replicating a literature‐based discovery event, using a documented search method within the model's steps. The IF‐SKD model can potentially serve as the foundation for future literature‐based discovery applications.
- Open Access
- 7 June 2013
- Published by Springer Nature in BMC Bioinformatics
- Vol. 14 (1) , 1-15
Clustering cliques for graph-based summarization of the biomedical research literature
Graph-based notions are increasingly used in biomedical data mining and knowledge discovery tasks. In this paper, we present a clique-clustering method to automatically summarize graphs of semantic predications produced from PubMed citations (titles and abstracts). SemRep is used to extract semantic predications from the citations returned by a PubMed search. Cliques were identified from frequently occurring predications with highly connected arguments filtered by degree centrality. Themes contained in the summary were identified with a hierarchical clustering algorithm based on common arguments shared among cliques. The validity of the clusters in the summaries produced was compared to the Silhouette-generated baseline for cohesion, separation and overall validity. The theme labels were also compared to a reference standard produced with major MeSH headings. For 11 topics in the testing data set, the overall validity of clusters from the system summary was 10% better than the baseline (43% versus 33%). While compared to the reference standard from MeSH headings, the results for recall, precision and F-score were 0.64, 0.65, and 0.65 respectively.
- 7 June 2013
- Published by Springer Nature in BMC Bioinformatics
- Vol. 14 (1) , 1-15
Open AccessClustering cliques for graph-based summarization of the biomedical research literature
Graph-based notions are increasingly used in biomedical data mining and knowledge discovery tasks. In this paper, we present a clique-clustering method to automatically summarize graphs of semantic predications produced from PubMed citations (titles and abstracts). SemRep is used to extract semantic predications from the citations returned by a PubMed search. Cliques were identified from frequently occurring predications with highly connected arguments filtered by degree centrality. Themes contained in the summary were identified with a hierarchical clustering algorithm based on common arguments shared among cliques. The validity of the clusters in the summaries produced was compared to the Silhouette-generated baseline for cohesion, separation and overall validity. The theme labels were also compared to a reference standard produced with major MeSH headings. For 11 topics in the testing data set, the overall validity of clusters from the system summary was 10% better than the baseline (43% versus 33%). While compared to the reference standard from MeSH headings, the results for recall, precision and F-score were 0.64, 0.65, and 0.65 respectively.
- Open Access
- 6 September 2011
- Published by SAGE Publications in Information Services and Use
- Vol. 31 (1-2) , 15-21
Semantic MEDLINE: An advanced information management application for biomedicine
To support more effective biomedical information management, Semantic MEDLINE integrates document retrieval, advanced natural language processing, automatic summarization and visualization into a single Web portal. The application is intended to help
- 6 September 2011
- Published by SAGE Publications in Information Services and Use
- Vol. 31 (1-2) , 15-21
Open AccessSemantic MEDLINE: An advanced information management application for biomedicine
To support more effective biomedical information management, Semantic MEDLINE integrates document retrieval, advanced natural language processing, automatic summarization and visualization into a single Web portal. The application is intended to help
- Open Access
- 8 June 2006
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (1) , 291
Argument-predicate distance as a filter for enhancing precision in extracting predications on the genetic etiology of disease
Background: Genomic functional information is valuable for biomedical research. However, such information frequently needs to be extracted from the scientific literature and structured in order to be exploited by automatic systems. Natural language processing is increasingly used for this purpose although it inherently involves errors. A postprocessing strategy that selects relations most likely to be correct is proposed and evaluated on the output ofSemGen, a system that extracts semantic predications on the etiology of genetic diseases. Based on the number of intervening phrases between an argument and its predicate, we defined a heuristic strategy to filter the extracted semantic relations according to their likelihood of being correct. We also applied this strategy to relations identified with co-occurrence processing. Finally, we exploited postprocessedSemGenpredications to investigate the genetic basis of Parkinson's disease.Results: The filtering procedure for increased precision is based on the intuition that arguments which occur close to their predicate are easier to identify than those at a distance. For example, if gene-gene relations are filtered for arguments at a distance of 1 phrase from the predicate, precision increases from 41.95% (baseline) to 70.75%. Since this proximity filtering is based on syntactic structure, applying it to the results of co-occurrence processing is useful, but not as effective as when applied to the output of natural language processing.In an effort to exploitSemGenpredications on the etiology of disease after increasing precision with postprocessing, a gene list was derived from extracted information enhanced with postprocessing filtering and was automatically annotated withGFINDer, a Web application that dynamically retrieves functional and phenotypic information from structured biomolecular resources. Two of the genes in this list are likely relevant to Parkinson's disease but are not associated with this disease in several important databases on genetic disorders.Conclusion: Information based on the proximity postprocessing method we suggest is of sufficient quality to be profitably used for subsequent applications aimed at uncovering new biomedical knowledge. Although proximity filtering is only marginally effective for enhancing the precision of relations extracted with co-occurrence processing, it is likely to benefit methods based, even partially, on syntactic structure, regardless of the relation.
- 8 June 2006
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (1) , 291
Open AccessArgument-predicate distance as a filter for enhancing precision in extracting predications on the genetic etiology of disease
Background: Genomic functional information is valuable for biomedical research. However, such information frequently needs to be extracted from the scientific literature and structured in order to be exploited by automatic systems. Natural language processing is increasingly used for this purpose although it inherently involves errors. A postprocessing strategy that selects relations most likely to be correct is proposed and evaluated on the output ofSemGen, a system that extracts semantic predications on the etiology of genetic diseases. Based on the number of intervening phrases between an argument and its predicate, we defined a heuristic strategy to filter the extracted semantic relations according to their likelihood of being correct. We also applied this strategy to relations identified with co-occurrence processing. Finally, we exploited postprocessedSemGenpredications to investigate the genetic basis of Parkinson's disease.Results: The filtering procedure for increased precision is based on the intuition that arguments which occur close to their predicate are easier to identify than those at a distance. For example, if gene-gene relations are filtered for arguments at a distance of 1 phrase from the predicate, precision increases from 41.95% (baseline) to 70.75%. Since this proximity filtering is based on syntactic structure, applying it to the results of co-occurrence processing is useful, but not as effective as when applied to the output of natural language processing.In an effort to exploitSemGenpredications on the etiology of disease after increasing precision with postprocessing, a gene list was derived from extracted information enhanced with postprocessing filtering and was automatically annotated withGFINDer, a Web application that dynamically retrieves functional and phenotypic information from structured biomolecular resources. Two of the genes in this list are likely relevant to Parkinson's disease but are not associated with this disease in several important databases on genetic disorders.Conclusion: Information based on the proximity postprocessing method we suggest is of sufficient quality to be profitably used for subsequent applications aimed at uncovering new biomedical knowledge. Although proximity filtering is only marginally effective for enhancing the precision of relations extracted with co-occurrence processing, it is likely to benefit methods based, even partially, on syntactic structure, regardless of the relation.
- 3 November 2005
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 57 (1) , 96-113
Word sense disambiguation by selecting the best semantic type based on Journal Descriptor Indexing: Preliminary experiment
An experiment was performed at the National Library of Medicine® (NLM®) in word sense disambiguation (WSD) using the Journal Descriptor Indexing (JDI) methodology. The motivation is the need to solve the ambiguity problem confronting NLM's MetaMap system, which maps free text to terms corresponding to concepts in NLM's Unified Medical Language System® (UMLS®) Metathesaurus®. If the text maps to more than one Metathesaurus concept at the same high confidence score, MetaMap has no way of knowing which concept is the correct mapping. We describe the JDI methodology, which is ultimately based on statistical associations between words in a training set of MEDLINE® citations and a small set of journal descriptors (assigned by humans to journals per se) assumed to be inherited by the citations. JDI is the basis for selecting the best meaning that is correlated to UMLS semantic types (STs) assigned to ambiguous concepts in the Metathesaurus. For example, the ambiguity transport has two meanings: “Biological Transport” assigned the ST Cell Function and “Patient transport” assigned the ST Health Care Activity. A JDI‐based methodology can analyze text containing transport and determine which ST receives a higher score for that text, which then returns the associated meaning, presumed to apply to the ambiguity itself. We then present an experiment in which a baseline disambiguation method was compared to four versions of JDI in disambiguating 45 ambiguous strings from NLM's WSD Test Collection. Overall average precision for the highest‐scoring JDI version was 0.7873 compared to 0.2492 for the baseline method, and average precision for individual ambiguities was greater than 0.90 for 23 of them (51%), greater than 0.85 for 24 (53%), and greater than 0.65 for 35 (79%). On the basis of these results, we hope to improve performance of JDI and test its use in applications.
- 3 November 2005
- Published by Wiley in Journal of the American Society for Information Science and Technology
- Vol. 57 (1) , 96-113
Word sense disambiguation by selecting the best semantic type based on Journal Descriptor Indexing: Preliminary experiment
An experiment was performed at the National Library of Medicine® (NLM®) in word sense disambiguation (WSD) using the Journal Descriptor Indexing (JDI) methodology. The motivation is the need to solve the ambiguity problem confronting NLM's MetaMap system, which maps free text to terms corresponding to concepts in NLM's Unified Medical Language System® (UMLS®) Metathesaurus®. If the text maps to more than one Metathesaurus concept at the same high confidence score, MetaMap has no way of knowing which concept is the correct mapping. We describe the JDI methodology, which is ultimately based on statistical associations between words in a training set of MEDLINE® citations and a small set of journal descriptors (assigned by humans to journals per se) assumed to be inherited by the citations. JDI is the basis for selecting the best meaning that is correlated to UMLS semantic types (STs) assigned to ambiguous concepts in the Metathesaurus. For example, the ambiguity transport has two meanings: “Biological Transport” assigned the ST Cell Function and “Patient transport” assigned the ST Health Care Activity. A JDI‐based methodology can analyze text containing transport and determine which ST receives a higher score for that text, which then returns the associated meaning, presumed to apply to the ambiguity itself. We then present an experiment in which a baseline disambiguation method was compared to four versions of JDI in disambiguating 45 ambiguous strings from NLM's WSD Test Collection. Overall average precision for the highest‐scoring JDI version was 0.7873 compared to 0.2492 for the baseline method, and average precision for individual ambiguities was greater than 0.90 for 23 of them (51%), greater than 0.85 for 24 (53%), and greater than 0.65 for 35 (79%). On the basis of these results, we hope to improve performance of JDI and test its use in applications.
- Top Cited Papers
- 1 December 2003
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 36 (6) , 462-477
The interaction of domain knowledge and linguistic structure in natural language processing: interpreting hypernymic propositions in biomedical text
- 1 December 2003
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 36 (6) , 462-477
Top Cited PapersThe interaction of domain knowledge and linguistic structure in natural language processing: interpreting hypernymic propositions in biomedical text
- 14 November 2002
- Published by Elsevier in International Journal of Medical Informatics
- Vol. 67 (1-3) , 85-95
Assessing the consistency of a biomedical terminology through lexical knowledge
- 14 November 2002
- Published by Elsevier in International Journal of Medical Informatics
- Vol. 67 (1-3) , 85-95
Assessing the consistency of a biomedical terminology through lexical knowledge
- Open Access
- 1 January 2000
- Published by Association for Computational Linguistics (ACL)
- p. 188-195
Extracting molecular binding relationships from biomedical text
ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified linguistic analyses that support the identification of these predications. After discussing a formal evaluation of ARBITER, we report on its application to 491,000 MEDLINE ~ abstracts, during which almost 25,000 binding relationships suitable for entry into a database of macromolecular function were extracted.
- 1 January 2000
- Published by Association for Computational Linguistics (ACL)
- p. 188-195
Open AccessExtracting molecular binding relationships from biomedical text
ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified linguistic analyses that support the identification of these predications. After discussing a formal evaluation of ARBITER, we report on its application to 491,000 MEDLINE ~ abstracts, during which almost 25,000 binding relationships suitable for entry into a database of macromolecular function were extracted.