Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Data-centric artificial intelligence: A survey
Artificial Intelligence (AI) is making a profound impact in almost every domain. A vital enabler
of its great success is the availability of abundant and high-quality data for building machine …
of its great success is the availability of abundant and high-quality data for building machine …
Data-centric ai: Perspectives and challenges
The role of data in building AI systems has recently been significantly magnified by the
emerging concept of data-centric AI (DCAI), which advocates a fundamental shift from model …
emerging concept of data-centric AI (DCAI), which advocates a fundamental shift from model …
A survey on oversmoothing in graph neural networks
Node features of graph neural networks (GNNs) tend to become more similar with the
increase of the network depth. This effect is known as over-smoothing, which we …
increase of the network depth. This effect is known as over-smoothing, which we …
Gppt: Graph pre-training and prompt tuning to generalize graph neural networks
Despite the promising representation learning of graph neural networks (GNNs), the
supervised training of GNNs notoriously requires large amounts of labeled data from each …
supervised training of GNNs notoriously requires large amounts of labeled data from each …
Convolutional neural networks on graphs with chebyshev approximation, revisited
Designing spectral convolutional networks is a challenging problem in graph learning.
ChebNet, one of the early attempts, approximates the spectral graph convolutions using …
ChebNet, one of the early attempts, approximates the spectral graph convolutions using …
How universal polynomial bases enhance spectral graph neural networks: Heterophily, over-smoothing, and over-squashing
Spectral Graph Neural Networks (GNNs), alternatively known as graph filters, have gained
increasing prevalence for heterophily graphs. Optimal graph filters rely on Laplacian …
increasing prevalence for heterophily graphs. Optimal graph filters rely on Laplacian …
Pc-conv: Unifying homophily and heterophily with two-fold filtering
Recently, many carefully designed graph representation learning methods have achieved
impressive performance on either strong heterophilic or homophilic graphs, but not both …
impressive performance on either strong heterophilic or homophilic graphs, but not both …
A comprehensive study on large-scale graph training: Benchmarking and rethinking
Large-scale graph training is a notoriously challenging problem for graph neural networks
(GNNs). Due to the nature of evolving graph structures into the training process, vanilla …
(GNNs). Due to the nature of evolving graph structures into the training process, vanilla …
D4explainer: In-distribution explanations of graph neural network via discrete denoising diffusion
The widespread deployment of Graph Neural Networks (GNNs) sparks significant interest in
their explainability, which plays a vital role in model auditing and ensuring trustworthy graph …
their explainability, which plays a vital role in model auditing and ensuring trustworthy graph …
Anti-symmetric DGN: a stable architecture for deep graph networks
Deep Graph Networks (DGNs) currently dominate the research landscape of learning from
graphs, due to their efficiency and ability to implement an adaptive message-passing …
graphs, due to their efficiency and ability to implement an adaptive message-passing …