Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Magnet: A neural network for directed graphs
The prevalence of graph-based data has spurred the rapid development of graph neural
networks (GNNs) and related machine learning algorithms. Yet, despite the many datasets …
networks (GNNs) and related machine learning algorithms. Yet, despite the many datasets …
Pytorch geometric signed directed: a software package on graph neural networks for signed and directed graphs
Networks are ubiquitous in many real-world applications (eg, social networks encoding
trust/distrust relationships, correlation networks arising from time series data). While many …
trust/distrust relationships, correlation networks arising from time series data). While many …
Gnnrank: Learning global rankings from pairwise comparisons via directed graph neural networks
Recovering global rankings from pairwise comparisons has wide applications from time
synchronization to sports team ranking. Pairwise comparisons corresponding to matches in …
synchronization to sports team ranking. Pairwise comparisons corresponding to matches in …
Structural balance and random walks on complex networks with complex weights
Y Tian, R Lambiotte - SIAM Journal on Mathematics of Data Science, 2024 - SIAM
Complex numbers define the relationship between entities in many situations. A canonical
example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics …
example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics …
Lead–lag detection and network clustering for multivariate time series with an application to the US equity market
S Bennett, M Cucuringu, G Reinert - Machine Learning, 2022 - Springer
In multivariate time series systems, it has been observed that certain groups of variables
partially lead the evolution of the system, while other variables follow this evolution with a …
partially lead the evolution of the system, while other variables follow this evolution with a …
A tighter analysis of spectral clustering, and beyond
P Macgregor, H Sun - International Conference on Machine …, 2022 - proceedings.mlr.press
This work studies the classical spectral clustering algorithm which embeds the vertices of
some graph G=(V_G, E_G) into R^ k using k eigenvectors of some matrix of G, and applies k …
some graph G=(V_G, E_G) into R^ k using k eigenvectors of some matrix of G, and applies k …
[HTML][HTML] A spectral graph convolution for signed directed graphs via magnetic Laplacian
Signed directed graphs contain both sign and direction information on their edges, providing
richer information about real-world phenomena compared to unsigned or undirected graphs …
richer information about real-world phenomena compared to unsigned or undirected graphs …
Universal graph contrastive learning with a novel laplacian perturbation
Abstract Graph Contrastive Learning (GCL) is an effective method for discovering
meaningful patterns in graph data. By evaluating diverse augmentations of the graph, GCL …
meaningful patterns in graph data. By evaluating diverse augmentations of the graph, GCL …
Co-trading networks for modeling dynamic interdependency structures and estimating high-dimensional covariances in US equity markets
The time proximity of trades across stocks reveals interesting topological structures of the
equity market in the United States. In this article, we investigate how such concurrent cross …
equity market in the United States. In this article, we investigate how such concurrent cross …
Higher-order spectral clustering of directed graphs
Clustering is an important topic in algorithms, and has a number of applications in machine
learning, computer vision, statistics, and several other research disciplines. Traditional …
learning, computer vision, statistics, and several other research disciplines. Traditional …