Demo Data from VLDB 2026 / reviewers in the wild / expert
Neil Gallagher
dblp:209/4870
· DBLP profile ↗
3ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Graph learning · 53% Deep learning architectures and training · 27% Probabilistic and Bayesian machine learning · 20% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
computational neuroscience |
0.8 | 2 | 2021 | Directed Spectrum Measures Improve Latent Network Models Of Neural Populations · NeurIPS 2021 Cross-Spectral Factor Analysis · NIPS 2017 |
Machine learning › Deep learning architectures and training
convolutional neural network |
0.8 | 1 | 2024 | Generalizing CNNs to graphs with learnable neighborhood quantization · NeurIPS 2024 |
Machine learning › Graph learning › graph neural network
graph convolution |
0.8 | 1 | 2024 | Generalizing CNNs to graphs with learnable neighborhood quantization · NeurIPS 2024 |
Machine learning › Graph learning
graph neural network |
0.8 | 1 | 2024 | Generalizing CNNs to graphs with learnable neighborhood quantization · NeurIPS 2024 |
Bioinformatics and computational biology › computational neuroscience
neural population analysis |
0.5 | 1 | 2021 | Directed Spectrum Measures Improve Latent Network Models Of Neural Populations · NeurIPS 2021 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
factor analysis |
0.3 | 1 | 2017 | Cross-Spectral Factor Analysis · NIPS 2017 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent factor model
interpretable latent factor model |
0.3 | 1 | 2017 | Cross-Spectral Factor Analysis · NIPS 2017 |
Bioinformatics and computational biology › neuroscience › neuroinformatics › neural data analysis
neural signal analysis |
0.3 | 1 | 2017 | Cross-Spectral Factor Analysis · NIPS 2017 |
Methods — techniques the papers use, named apart from their topics
residual network · 0.8neighborhood quantization · 0.8semi-supervised learning · 0.6multiple kernel learning · 0.6gaussian process · 0.6linear factor model · 0.5directed spectrum estimation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Generalizing CNNs to graphs with learnable neighborhood quantizationabstractConvolutional neural networks (CNNs) have led to a revolution in analyzing array data. However, many important sources of data, such as biological and social networks, are naturally structured as graphs rather than arrays, making the design of graph neural network (GNN) architectures that retain the strengths of CNNs an active and exciting area of research. Here, we introduce Quantized Graph Convolution Networks (QGCNs), the first framework for GNNs that formally and directly extends CNNs to graphs. QGCNs do this by decomposing the convolution operation into non-overlapping sub-kernels, allowing them to fit graph data while reducing to a 2D CNN layer on array data. We generalize this approach to graphs of arbitrary size and dimension by approaching sub-kernel assignment as a learnable multinomial assignment problem. Integrating this approach into a residual network architecture, we demonstrate performance that matches or exceeds other state-of-the-art GNNs on benchmark graph datasets and for predicting properties of nonlinear dynamics on a new finite element graph dataset. In summary, QGCNs are a novel GNN framework that generalizes CNNs and their strengths to graph data, allowing for more accurate and expressive models. Isaac Osafo Nkansah, Neil Gallagher, Ruchi Sandilya, Conor Liston, Logan Grosenick |
NeurIPS | 2 |
| 2021 | Directed Spectrum Measures Improve Latent Network Models Of Neural PopulationsabstractSystems neuroscience aims to understand how networks of neurons distributed throughout the brain mediate computational tasks. One popular approach to identify those networks is to first calculate measures of neural activity (e.g. power spectra) from multiple brain regions, and then apply a linear factor model to those measures. Critically, despite the established role of directed communication between brain regions in neural computation, measures of directed communication have been rarely utilized in network estimation because they are incompatible with the implicit assumptions of the linear factor model approach. Here, we develop a novel spectral measure of directed communication called the Directed Spectrum (DS). We prove that it is compatible with the implicit assumptions of linear factor models, and we provide a method to estimate the DS. We demonstrate that latent linear factor models of DS measures better capture underlying brain networks in both simulated and real neural recording data compared to available alternatives. Thus, linear factor models of the Directed Spectrum offer neuroscientists a simple and effective way to explicitly model directed communication in networks of neural populations. Neil Gallagher, Kafui Dzirasa, David E. Carlson |
NeurIPS | 1 |
| 2017 | Cross-Spectral Factor AnalysisabstractIn neuropsychiatric disorders such as schizophrenia or depression, there is often a disruption in the way that regions of the brain synchronize with one another. To facilitate understanding of network-level synchronization between brain regions, we introduce a novel model of multisite low-frequency neural recordings, such as local field potentials (LFPs) and electroencephalograms (EEGs). The proposed model, named Cross-Spectral Factor Analysis (CSFA), breaks the observed signal into factors defined by unique spatio-spectral properties. These properties are granted to the factors via a Gaussian process formulation in a multiple kernel learning framework. In this way, the LFP signals can be mapped to a lower dimensional space in a way that retains information of relevance to neuroscientists. Critically, the factors are interpretable. The proposed approach empirically allows similar performance in classifying mouse genotype and behavioral context when compared to commonly used approaches that lack the interpretability of CSFA. We also introduce a semi-supervised approach, termed discriminative CSFA (dCSFA). CSFA and dCSFA provide useful tools for understanding neural dynamics, particularly by aiding in the design of causal follow-up experiments. Neil Gallagher, Kyle R. Ulrich, Austin Talbot, Kafui Dzirasa, Lawrence Carin, David E. Carlson |
NIPS | 1 |