Explainable fMRI‐based brain decoding via spatial temporal‐pyramid graph convolutional network
Sign Up to like & getrecommendations! Published in 2022 at "Human Brain Mapping"
DOI: 10.1002/hbm.26255
Abstract: Brain decoding, aiming to identify the brain states using neural activity, is important for cognitive neuroscience and neural engineering. However, existing machine learning methods for fMRI‐based brain decoding either suffer from low classification performance or… read more here.
Keywords: fmri based; brain; based brain; graph ... See more keywords
Multiple kernel clustering with late fusion consensus local graph preserving
Sign Up to like & getrecommendations! Published in 2021 at "International Journal of Intelligent Systems"
DOI: 10.1002/int.22596
Abstract: Multiple kernel clustering (MKC) methods aim at integrating an optimal partition from a set of precalculated kernel matrices. Though achieving success in various applications, we observe that existing MKC methods: (i) lack of representation flexibility;… read more here.
Keywords: local graph; kernel clustering; multiple kernel; graph ... See more keywords
Fuzzy edge connectivity in bipolar fuzzy networks and the applications in topology design
Sign Up to like & getrecommendations! Published in 2022 at "International Journal of Intelligent Systems"
DOI: 10.1002/int.22797
Abstract: The graph model is verified to be an effective network model, where the edges represent the direct channels between two sites. In practical applications, the sites and channels of the network have uncertain characteristics, and… read more here.
Keywords: topology; edge connectivity; fuzzy; bipolar fuzzy ... See more keywords
Malware detection with dynamic evolving graph convolutional networks
Sign Up to like & getrecommendations! Published in 2022 at "International Journal of Intelligent Systems"
DOI: 10.1002/int.22880
Abstract: Malware detection is a vital task for cybersecurity. For malware dynamic behavior, threats come from a small number of Application Programming Interfaces (APIs) embedded in the API sequences, which are easily ignored or obfuscated in… read more here.
Keywords: api level; malware detection; dynamic evolving; level ... See more keywords
Graph Decipher: A transparent dual‐attention graph neural network to understand the message‐passing mechanism for the node classification
Sign Up to like & getrecommendations! Published in 2022 at "International Journal of Intelligent Systems"
DOI: 10.1002/int.22966
Abstract: Graph neural networks (GNNs) can be effectively applied to solve many real‐world problems across widely diverse fields. Their success is inseparable from the message‐passing mechanisms evolving over the years. However, current mechanisms treat all node… read more here.
Keywords: node classification; message passing; graph; graph neural ... See more keywords
Complex machine learning model needs complex testing: Examining predictability of molecular binding affinity by a graph neural network
Sign Up to like & getrecommendations! Published in 2022 at "Journal of Computational Chemistry"
DOI: 10.1002/jcc.26831
Abstract: Drug discovery pipelines typically involve high‐throughput screening of large amounts of compounds in a search of potential drugs candidates. As a chemical space of small organic molecules is huge, a “navigation” over it urges for… read more here.
Keywords: neural network; binding affinity; affinity; graph ... See more keywords
An automated method for graph‐based chemical space exploration and transition state finding
Sign Up to like & getrecommendations! Published in 2022 at "Journal of Computational Chemistry"
DOI: 10.1002/jcc.27011
Abstract: Algorithms that automatically explore the chemical space have been limited to chemical systems with a low number of atoms due to expensive involved quantum calculations and the large amount of possible reaction pathways. The method… read more here.
Keywords: reaction; based chemical; graph; exploration ... See more keywords
Deza graphs with parameters (n,k,k−1,a) and β=1
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21644
Abstract: A Deza graph with parameters $(n,k,b,a)$ is a $k$-regular graph with $n$ vertices in which any two vertices have $a$ or $b$ ($a\leq b$) common neighbours. A Deza graph is strictly Deza if it has… read more here.
Keywords: deza graph; beta; graph; strictly deza ... See more keywords
A decomposition approach to solve the selective graph coloring problem in some perfect graph families
Sign Up to like & getrecommendations! Published in 2019 at "Networks"
DOI: 10.1002/net.21850
Abstract: Graph coloring is the problem of assigning a minimum number of colors to all vertices of a graph such that no two adjacent vertices receive the same color. The selective graph coloring problem is a… read more here.
Keywords: graph; perfect graph; coloring problem; problem ... See more keywords
Most reliable two‐terminal graphs with node failures
Sign Up to like & getrecommendations! Published in 2020 at "Networks"
DOI: 10.1002/net.21968
Abstract: A two‐terminal graph is an undirected graph with two specified target vertices. If each nontarget vertex of a two‐terminal graph fails independently with the same fixed probability (and edges and target vertices are perfectly reliable),… read more here.
Keywords: graph; terminal graph; reliable two; terminal graphs ... See more keywords
Optimal hierarchical clustering on a graph
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22043
Abstract: Given an undirected graph with positive weights on the edges we study a parametric biobjective graph clustering problem. We remove a subset of edges to break the graph into smaller pieces, that is, connected components,… read more here.
Keywords: optimal hierarchical; clustering graph; hierarchical clustering; graph ... See more keywords