Open AccessPosted Content
Semi-supervised classification on graphs using explicit diffusion dynamics
TL;DR: It is shown that appending graph diffusion to feature-based learning as an \textit{a posteriori} refinement achieves state-of-the-art classification accuracy.
read more
Abstract: Classification tasks based on feature vectors can be significantly improved by including within deep learning a graph that summarises pairwise relationships between the samples. Intuitively, the graph acts as a conduit to channel and bias the inference of class labels. Here, we study classification methods that consider the graph as the originator of an explicit graph diffusion. We show that appending graph diffusion to feature-based learning as an \textit{a posteriori} refinement achieves state-of-the-art classification accuracy. This method, which we call Graph Diffusion Reclassification (GDR), uses overshooting events of a diffusive graph dynamics to reclassify individual nodes. The method uses intrinsic measures of node influence, which are distinct for each node, and allows the evaluation of the relationship and importance of features and graph for classification. We also present diff-GCN, a simple extension of Graph Convolutional Neural Network (GCN) architectures that leverages explicit diffusion dynamics, and allows the natural use of directed graphs. To showcase our methods, we use benchmark datasets of documents with associated citation data.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Network memory in the movement of hospital patients carrying drug-resistant bacteria
Ashleigh C. Myall,Robert L. Peach,Andrea Y. Weiße,Frances Davies,Siddharth Mookerjee,Alison Holmes,Mauricio Barahona +6 more
TL;DR: It is shown that there are substantial memory effects in the movement of hospital patients colonised with drug-resistant bacteria, which break first-order Markovian transitive assumptions and substantially alter the conclusions from the analysis, specifically on node rankings and the evolution of diffusive processes.
Unsupervised graph-based learning predicts mutations that alter protein dynamics
Robert L. Peach,Dominik Saman,Sophia N. Yaliraki,David R. Klug,Liming Ying,Keith R. Willison,Mauricio Barahona +6 more
TL;DR: It is shown how a computationally efficient method for unsupervised graph partitioning can be applied to atomistic graphs derived from protein structures to reveal intrinsic, biochemically relevant substructures at all scales, without re-parameterisation or a priori coarse-graining.
Response of ophthalmologists in Israel to the novel coronavirus (2019-nCoV) outbreak.
Lauren M. Wasser,Elishai Assayag,Maria Tsessler,Yishay Weill,Michal Becker-Cohen,David Zadok +5 more
TL;DR: The delay in development of emergency guidelines, necessary to protect patients and ophthalmologists from this highly transmissible disease, is emphasized during the critical early stages of the COVID-19 outbreak.
Predição da propagação do SARS-CoV-2 no Estado do Amapá, Amazônia, Brasil, por modelagem matemática
Neylan Leal Dias,Edcarlos Vasconcelos da Silva,Marcelo Amanajas Pires,Daniel Chaves,Katsumi Letra Sanada,Amanda Alves Fecury,Claudio Alberto Gellis de Mattos Dias,Euzébio de Oliveira,Carla Viana Dendasck,Simone de Almeida Delphim Leal +9 more
- 18 May 2020
TL;DR: In this article, a analise da propagacao do SARS-CoV-2 no Amapa atraves da utilizacao de tres abordagens.
Generalized Spectral Clustering for Directed and Undirected Graphs
TL;DR: A generalized spectral clustering framework that can address both directed and undirected graphs is presented, based on the spectral relaxation of a new functional that is introduced as the generalized Dirichlet energy of a graph function, with respect to an arbitrary positive regularizing measure on the graph edges.
References
Deep learning
TL;DR: Deep learning is making major advances in solving problems that have resisted the best attempts of the artificial intelligence community for many years, and will have many more successes in the near future because it requires very little engineering by hand and can easily take advantage of increases in the amount of available computation and data.
67K
Pattern Recognition and Machine Learning
TL;DR: This book covers a broad range of topics for regular factorial designs and presents all of the material in very mathematical fashion and will surely become an invaluable resource for researchers and graduate students doing research in the design of factorial experiments.
30.8K
•Book
Pattern Recognition and Machine Learning
Christopher M. Bishop
- 17 Aug 2006
TL;DR: Probability Distributions, linear models for Regression, Linear Models for Classification, Neural Networks, Graphical Models, Mixture Models and EM, Sampling Methods, Continuous Latent Variables, Sequential Data are studied.
•Posted Content
Semi-Supervised Classification with Graph Convolutional Networks
Thomas Kipf,Max Welling +1 more
TL;DR: A scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs which outperforms related methods by a significant margin.
22.7K
•Proceedings Article
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence Page,Sergey Brin,Rajeev Motwani,Terry Winograd +3 more
- 11 Nov 1999
TL;DR: This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
16.4K