Graphs have a superior ability to represent relational data, such as chemical compounds, proteins, and social networks. Hence, graph-level learning, which takes a set of graphs as …
Dealing with relational data always required significant computational resources, domain expertise and task-dependent feature engineering to incorporate structural information into a …
With the rapid emergence of graph representation learning, the construction of new large- scale datasets is necessary to distinguish model capabilities and accurately assess the …
Network (or graph) sparsification accelerates many downstream analyses. For graph sparsification, sampling methods derived from local heuristic considerations are common in …
We propose the molecular omics network (MOOMIN) a multimodal graph neural network used by AstraZeneca oncologists to predict the synergy of drug combinations for cancer …
X Liu, L Fu, X Wang, C Zhou - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
The von Neumann graph entropy is a measure of graph complexity based on the Laplacian spectrum. It has recently found applications in various learning tasks driven by the …
Managing the threat posed by malware requires accurate detection and classification techniques. Traditional detection strategies, such as signature scanning, rely on manual …
We introduce the use of video coding settings for source identification and propose a new approach that incorporates encoding and encapsulation aspects of a video. To this end, a …
Network (or graph) sparsification benefits downstream graph mining tasks. Finding a sparsified subgraph G ˆ similar to the original graph G is, however, challenging due to the …