Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dane Taylor

dblp:62/9222 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0003-1851-3309ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining
multi-layer graph
0.812024
A tensor factorization model of multilayer network interdependence · J. Mach. Learn. Res. 2024
Data mining
network analysis
0.812024
A tensor factorization model of multilayer network interdependence · J. Mach. Learn. Res. 2024
Data mining
pattern mining
0.812024
A tensor factorization model of multilayer network interdependence · J. Mach. Learn. Res. 2024
Data mining › multidimensional data analysis › multiway data analysis › tensor analysis
tensor factorization
0.812024
A tensor factorization model of multilayer network interdependence · J. Mach. Learn. Res. 2024
Data mining
clustering
0.212024
A tensor factorization model of multilayer network interdependence · J. Mach. Learn. Res. 2024
Data mining › structured data mining › graph mining › community detection
stochastic block model
0.212024
A tensor factorization model of multilayer network interdependence · J. Mach. Learn. Res. 2024

Methods — techniques the papers use, named apart from their topics

nonnegative tucker decomposition · 0.8likelihood ratio test · 0.8expectation-maximization · 0.8
YearPublicationVenuePosition
2024 A tensor factorization model of multilayer network interdependence
abstract
Multilayer networks describe the rich ways in which nodes are related by accounting for different relationships in separate layers. These multiple relationships are naturally represented by an adjacency tensor. In this work we study the use of the nonnegative Tucker decomposition (NNTuck) of such tensors under a KL loss as an expressive factor model that naturally generalizes existing stochastic block models of multilayer networks. Quantifying interdependencies between layers can identify redundancies in the structure of a network, indicate relationships between disparate layers, and potentially inform survey instruments for collecting social network data. We propose definitions of layer independence, dependence, and redundancy based on likelihood ratio tests between nested nonnegative Tucker decompositions. Using both synthetic and real-world data, we evaluate the use and interpretation of the NNTuck as a model of multilayer networks. Algorithmically, we show that using expectation maximization (EM) to maximize the log-likelihood under the NNTuck is step-by-step equivalent to tensorial multiplicative updates for the NNTuck under a KL loss, extending a previously known equivalence from nonnegative matrices to nonnegative tensors.
Izabel Aguiar, Dane Taylor, Johan Ugander
J. Mach. Learn. Res.2
2021 Noise-Response Analysis of Deep Neural Networks Quantifies Robustness and Fingerprints Structural Malware
abstract
The ubiquity of deep neural networks (DNNs), cloud-based training, and transfer learning is giving rise to a new cybersecurity frontier in which unsecure DNNs have 'structural malware' (i.e., compromised weights and activation pathways).In particular, DNNs can be designed to have backdoors that allow an adversary to easily and reliably fool an image classifier by adding a pattern of pixels called a trigger.It is generally difficult to detect backdoors, and existing detection methods are computationally expensive and require extensive resources (e.g., access to the training data).Here, we propose a rapid feature-generation technique that quantifies the robustness of a DNN, 'fingerprints' its nonlinearity, and allows us to detect backdoors (if present).Our approach involves studying how a DNN responds to noise-infused images with varying noise intensity, which we summarize with titration curves.We find that DNNs with backdoors are more sensitive to input noise and respond in a characteristic way that reveals the backdoor and where it leads (its 'target').Our empirical results demonstrate that we can accurately detect backdoors with high confidence orders-of-magnitude faster than existing approaches (seconds versus hours).
N. Benjamin Erichson, Dane Taylor, Qixuan Wu, Michael W. Mahoney
SDM2
2019 Transient crosslinking kinetics optimize gene cluster interactions
abstract
Our understanding of how chromosomes structurally organize and dynamically interact has been revolutionized through the lens of long-chain polymer physics. Major protein contributors to chromosome structure and dynamics are condensin and cohesin that stochastically generate loops within and between chains, and entrap proximal strands of sister chromatids. In this paper, we explore the ability of transient, protein-mediated, gene-gene crosslinks to induce clusters of genes, thereby dynamic architecture, within the highly repeated ribosomal DNA that comprises the nucleolus of budding yeast. We implement three approaches: live cell microscopy; computational modeling of the full genome during G1 in budding yeast, exploring four decades of timescales for transient crosslinks between 5kbp domains (genes) in the nucleolus on Chromosome XII; and, temporal network models with automated community (cluster) detection algorithms applied to the full range of 4D modeling datasets. The data analysis tools detect and track gene clusters, their size, number, persistence time, and their plasticity (deformation). Of biological significance, our analysis reveals an optimal mean crosslink lifetime that promotes pairwise and cluster gene interactions through "flexible" clustering. In this state, large gene clusters self-assemble yet frequently interact (merge and separate), marked by gene exchanges between clusters, which in turn maximizes global gene interactions in the nucleolus. This regime stands between two limiting cases each with far less global gene interactions: with shorter crosslink lifetimes, "rigid" clustering emerges with clusters that interact infrequently; with longer crosslink lifetimes, there is a dissolution of clusters. These observations are compared with imaging experiments on a normal yeast strain and two condensin-modified mutant cell strains. We apply the same image analysis pipeline to the experimental and simulated datasets, providing support for the modeling predictions.
Benjamin Walker 0003, Dane Taylor, Josh Lawrimore, Caitlin Hult, David Adalsteinsson, Kerry Bloom, M. Gregory Forest
PLoS Comput. Biol.2