T-PAIR: Temporal Node pair Embedding for Automatic Biomedical Hypothesis Generation (Extended abstract)

Uchenna Akujuobi, Michael Spranger, Sucheendra K. Palaniappan, Xiangliang Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper, we study an automatic hypothesis generation (HG) problem, which refers to the discovery of meaningful implicit connections between scientific terms, including but not limited to diseases, chemicals, drugs, and genes extracted from databases of biomedical publications. Most prior studies of this problem focused on using static information of terms and largely ignored the temporal dynamics of scientific term relations. Even when the dynamics were considered in a few recent studies, they learned the representations for the scientific terms rather than focusing on the term-pair relations. Since the HG problem is to predict term-pair connections, it is not enough to know with whom the terms are connected; it is more important to know how the connections have been formed (in a dynamic process). We formulate this HG problem as a future connectivity prediction in a dynamic attributed graph and propose an inductive edge (node pair) embedding method named T-PAIR, utilizing both the graphical structure and node attribute to encode the temporal node pair relationship. We demonstrate the efficiency of the proposed model on real-world biomedical datasets in predicting future term-pair relations between millions of seen terms (in the transductive setting), as well as on the relations involving unseen terms (in the inductive setting).
Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherIEEE Computer Society
Number of pages2
ISBN (Print)9798350322279
StatePublished - Jan 1 2023
Externally publishedYes


Dive into the research topics of 'T-PAIR: Temporal Node pair Embedding for Automatic Biomedical Hypothesis Generation (Extended abstract)'. Together they form a unique fingerprint.

Cite this