Weihong Yao

ORCID: 0009-0002-3145-3494
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Topic Modeling
  • Biomedical Text Mining and Ontologies
  • Machine Learning in Bioinformatics
  • Gene expression and cancer classification
  • Advanced Graph Neural Networks
  • Bioinformatics and Genomic Networks
  • Machine Learning in Healthcare
  • Advanced Text Analysis Techniques
  • Natural Language Processing Techniques
  • Image Retrieval and Classification Techniques
  • Semantic Web and Ontologies
  • Graph Theory and Algorithms
  • Text and Document Classification Technologies
  • Sentiment Analysis and Opinion Mining
  • Environmental Monitoring and Data Management
  • Educational Technology and Assessment
  • Transportation and Mobility Innovations
  • Vehicular Ad Hoc Networks (VANETs)
  • Advanced Computational Techniques and Applications
  • Data Quality and Management
  • Rough Sets and Fuzzy Logic
  • Wireless Sensor Networks and IoT
  • Caching and Content Delivery
  • Advanced Sensor and Control Systems
  • Face and Expression Recognition

Dalian University of Technology
2007-2024

Knowledge Graph (KG) reasoning has been an interesting topic in recent decades. Most current researches focus on predicting the missing facts for incomplete KG. Nevertheless, Temporal KG (TKG) reasoning, which is to forecast future facts, still faces with a dilemma due complex interactions between entities over time. This article proposes novel intricate Spatiotemporal Dependency learning Network (STDN) based Convolutional (GCN) capture underlying correlations of entity at different...

10.1145/3648366 article EN ACM Transactions on Knowledge Discovery from Data 2024-02-16

Document-level Relation Extraction (RE) is particularly challenging due to complex semantic interactions among multiple entities in a document. Among exiting approaches, Graph Convolutional Networks (GCN) one of the most effective approaches for document-level RE. However, traditional GCN simply takes word nodes and adjacency matrix represent graphs, which difficult establish direct connections between distant entity pairs. In this paper, we propose Global Context-enhanced (GCGCN), novel...

10.18653/v1/2020.coling-main.461 article EN cc-by Proceedings of the 17th international conference on Computational linguistics - 2020-01-01

The Short Message Service (SMS) has widely extended in the modern methods of communication technology. classification spam message is an interesting and prominent issue. Classifying availability SMS a challenging task, plenty research been carried out this direction employing Machine Learning techniques such as Naive Bayes (NB), Random Forest (RF), Support Vector (SVM) for Spam Classification. Although these have shown adequate performance, but are not efficient enough terms classification....

10.1145/3231884.3231895 article EN 2018-05-19

Analyzing omics data from a network-based perspective can facilitate biomarker discovery. To improve disease diagnosis and identify prospective information indicating the onset of complex disease, computational method for identifying potential biomarkers based on differential sub-networks (PB-DSN) is developed. In PB-DSN, Pearson correlation coefficient (PCC) used to measure relationship between feature ratios infer networks. A sub-network extracted crucial discriminating different groups...

10.1038/s41598-017-14682-5 article EN cc-by Scientific Reports 2017-10-24

Abstract Motivation Hypothesis generation (HG) refers to the discovery of meaningful implicit connections between disjoint scientific terms, which is great significance for drug discovery, prediction side effects and precision treatment. More recently, a few initial studies attempt model dynamic meaning terms or term pairs HG. However, most existing methods still fail accurately capture utilize evolution relations. Results This article proposes novel temporal difference embedding (TDE)...

10.1093/bioinformatics/btac660 article EN Bioinformatics 2022-10-01

This paper focus on video recommendation in response to the explosive growth of movies which has made people dilemma information overload for a long time. It is particularly important push accurately. Regarding this situation, studies how recommend most similar users based their interest tags and browsing behavior. Compared with collaborative filtering algorithm, whose processing effect not good confronting scoring data sparse problem. makes full use movie review data, experimental set...

10.1145/3349341.3349428 article EN 2019-07-12

In this paper, we propose a novel model called Adversarial Multi-Task Network (AMTN) for jointly modeling Recognizing Question Entailment (RQE) and medical Answering (QA) tasks. AMTN utilizes pre-trained BioBERT an Interactive Transformer to learn the shared semantic representations across different task through parameter sharing mechanism. Meanwhile, adversarial training strategy is introduced separate private features of each from representations. Experiments on BioNLP 2019 RQE QA Shared...

10.18653/v1/w19-5046 article EN cc-by 2019-01-01

Analyzing the disease data from view of combinatorial features may better characterize phenotype. In this study, a novel method is proposed to construct feature combinations and classification model (CFC-CM) by mining key relationships. CFC-CM iteratively tests for differences in relationship between different groups. To do this, it uses modified $k$k-top-scoring pair (M-$k$k-TSP) algorithm then selects most discriminative pairs current set infer build model. Compared with support vector...

10.1109/tcbb.2017.2779512 article EN IEEE/ACM Transactions on Computational Biology and Bioinformatics 2017-12-04

In systems biology, filtering the discriminative features from complex high-dimensional data is a crucial issue. This paper proposes feature selection algorithm based on overlapping and group (FS-FOGO) to calculate importance. FS-FOGO weighs two aspects: degree ratio of area effective range each class proportion heterogeneous samples in every sample's nearest neighbors. To show validation FS-FOGO, it compared with gene (ERGS), which calculates weights range, six public biological sets one...

10.1109/bibm.2016.7822590 article EN 2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) 2016-12-01

Decision-making is a basic component of agents' (e.g., intelligent sensors) behaviors, in which one's cognition plays crucial role the process and outcome. Extensive games, class interactive decision-making scenarios, have been studied diverse fields. Recently, model extensive games was proposed agent structure underlying game quality situations are encoded by artificial neural networks. This refines classic corresponding equilibrium concept-

10.3390/s24041078 article EN cc-by Sensors 2024-02-07

10.1016/j.jbi.2024.104607 article EN publisher-specific-oa Journal of Biomedical Informatics 2024-02-14

Generating biomedical hypotheses is a difficult task as it requires uncovering the implicit associations between massive scientific terms from large body of published literature. A recent line Hypothesis Generation (HG) approaches - temporal graph-based have shown great success in modeling evolution term-pair relationships. However, these model each term or with Recurrent Neural Network (RNN) independently, which neglects rich covariation among all term-pairs while ignoring direct...

10.1109/jbhi.2024.3435011 article EN IEEE Journal of Biomedical and Health Informatics 2024-07-29

Hypothesis Generation (HG) aims to expedite biomedical researches by generating novel hypotheses from existing scientific literature. Most studies focused on modeling static snapshots of the corpus, neglecting temporal evolution terms. Despite recent efforts learn term Knowledge Bases (KBs) for HG, information multi-source KBs is still overlooked, which contains important, up-to-date knowledge. In this paper, an innovative Temporal Contrastive Learning (TCL) framework introduced uncover...

10.1109/tcbb.2024.3451051 article EN IEEE/ACM Transactions on Computational Biology and Bioinformatics 2024-08-28
Coming Soon ...