Computational prediction of drug–target interactions using chemogenomic approaches: an empirical survey
Computational prediction of drug–target interactions (DTIs) has become an essential task in
the drug discovery process. It narrows down the search space for interactions by suggesting …
the drug discovery process. It narrows down the search space for interactions by suggesting …
Methods for biological data integration: perspectives and challenges
V Gligorijević, N Pržulj - Journal of the Royal Society …, 2015 - royalsocietypublishing.org
Rapid technological advances have led to the production of different types of biological data
and enabled construction of complex networks with various types of interactions between …
and enabled construction of complex networks with various types of interactions between …
Graph matching and learning in pattern recognition in the last 10 years
In this paper, we examine the main advances registered in the last ten years in Pattern
Recognition methodologies based on graph matching and related techniques, analyzing …
Recognition methodologies based on graph matching and related techniques, analyzing …
Topology identification and learning over graphs: Accounting for nonlinearities and dynamics
GB Giannakis, Y Shen… - Proceedings of the …, 2018 - ieeexplore.ieee.org
Identifying graph topologies as well as processes evolving over graphs emerge in various
applications involving gene-regulatory, brain, power, and social networks, to name a few …
applications involving gene-regulatory, brain, power, and social networks, to name a few …
Robust semi-supervised nonnegative matrix factorization for image clustering
Nonnegative matrix factorization (NMF) is a powerful dimension reduction method, and has
received increasing attention in various practical applications. However, most traditional …
received increasing attention in various practical applications. However, most traditional …
Graph clustering via variational graph embedding
L Guo, Q Dai - Pattern Recognition, 2022 - Elsevier
Graph clustering based on embedding aims to divide nodes with higher similarity into
several mutually disjoint groups, but it is not a trivial task to maximumly embed the graph …
several mutually disjoint groups, but it is not a trivial task to maximumly embed the graph …
Robust bi-stochastic graph regularized matrix factorization for data clustering
Data clustering, which is to partition the given data into different groups, has attracted much
attention. Recently various effective algorithms have been developed to tackle the task …
attention. Recently various effective algorithms have been developed to tackle the task …
Correntropy-based hypergraph regularized NMF for clustering and feature selection on multi-cancer integrated data
N Yu, MJ Wu, JX Liu, CH Zheng… - IEEE transactions on …, 2020 - ieeexplore.ieee.org
Non-negative matrix factorization (NMF) has become one of the most powerful methods for
clustering and feature selection. However, the performance of the traditional NMF method …
clustering and feature selection. However, the performance of the traditional NMF method …
Multi-view data clustering via non-negative matrix factorization with manifold regularization
Nowadays, non-negative matrix factorization (NMF) based cluster analysis for multi-view
data shows impressive behavior in machine learning. Usually, multi-view data have …
data shows impressive behavior in machine learning. Usually, multi-view data have …
Spatial–spectral-graph-regularized low-rank tensor decomposition for multispectral and hyperspectral image fusion
Hyperspectral (HS) and multispectral (MS) image fusion aims at producing high-resolution
HS (HRHS) images. However, the existing methods could not simultaneously consider the …
HS (HRHS) images. However, the existing methods could not simultaneously consider the …