Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Haqjsk: Hierarchical-aligned quantum jensen-shannon kernels for graph classification
In this work, we propose two novel quantum walk kernels, namely the Hierarchical Aligned
Quantum Jensen-Shannon Kernels (HAQJSK), between un-attributed graph structures …
Quantum Jensen-Shannon Kernels (HAQJSK), between un-attributed graph structures …
Redundancy-free message passing for graph neural networks
Abstract Graph Neural Networks (GNNs) resemble the Weisfeiler-Lehman (1-WL) test, which
iteratively update the representation of each node by aggregating information from WL-tree …
iteratively update the representation of each node by aggregating information from WL-tree …
Image emotion multi-label classification based on multi-graph learning
Images contain rich information and can induce various emotions in the audience. Image
emotion classification aims to identify the emotion categories that images can evoke. It is …
emotion classification aims to identify the emotion categories that images can evoke. It is …
Optimal transport based pyramid graph kernel for autism spectrum disorder diagnosis
Brain network, which characterizes the functional and structural interactions of brain regions
with graph theory, has been widely utilized to diagnose brain diseases, such as autism …
with graph theory, has been widely utilized to diagnose brain diseases, such as autism …
Graph kernels based on optimal node assignment
The success of kernel algorithms depends on the kernel it uses and hence the development
of kernels for structured data like graphs is an active research field. We designed two graph …
of kernels for structured data like graphs is an active research field. We designed two graph …
Deep hierarchical graph alignment kernels
S Tang, H Tian, X Cao, W Ye - arxiv preprint arxiv:2405.05545, 2024 - arxiv.org
Typical R-convolution graph kernels invoke the kernel functions that decompose graphs into
non-isomorphic substructures and compare them. However, overlooking implicit similarities …
non-isomorphic substructures and compare them. However, overlooking implicit similarities …
Ordinal Pattern Tree: A New Representation Method for Brain Network Analysis
Brain networks, describing the functional or structural interactions of brain with graph theory,
have been widely used for brain imaging analysis. Currently, several network representation …
have been widely used for brain imaging analysis. Currently, several network representation …
Learning deep graph representations via convolutional neural networks
W Ye, O Askarisichani, A Jones… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Graph-structured data arise in many scenarios. A fundamental problem is to quantify the
similarities of graphs for tasks such as classification. R-convolution graph kernels are …
similarities of graphs for tasks such as classification. R-convolution graph kernels are …
Diagnosis of mild cognitive impairment with ordinal pattern kernel
Mild cognitive impairment (MCI) belongs to the prodromal stage of Alzheimer's disease (AD).
Accurate diagnosis of MCI is very important for possibly deferring AD progression. Graph …
Accurate diagnosis of MCI is very important for possibly deferring AD progression. Graph …
Multiscale wasserstein shortest-path graph kernels for graph classification
W Ye, H Tian, Q Chen - IEEE Transactions on Artificial …, 2023 - ieeexplore.ieee.org
Graph kernels are conventional methods for computing graph similarities. However, the
existing R-convolution graph kernels cannot resolve both of the two challenges: 1) …
existing R-convolution graph kernels cannot resolve both of the two challenges: 1) …