Vince Lyzinski

Orcid: 0000-0001-5594-8956

According to our database1, Vince Lyzinski authored at least 40 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Subgraph nomination: query by example subgraph retrieval in networks.
Stat. Comput., April, 2023

Numerical Tolerance for Spectral Decompositions of Random Matrices and Applications to Network Inference.
J. Comput. Graph. Stat., January, 2023

Clustered Graph Matching for Label Recovery and Graph Classification.
IEEE Trans. Netw. Sci. Eng., 2023

Gotta match 'em all: Solution diversification in graph matching matched filters.
CoRR, 2023

2022
Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming.
J. Comput. Graph. Stat., October, 2022

Signed and unsigned partial information decompositions of continuous network interactions.
J. Complex Networks, August, 2022

The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks.
J. Mach. Learn. Res., 2022

Adversarial contamination of networks in the setting of vertex nomination: a new trimming method.
CoRR, 2022

Multiplex graph matching matched filters.
Appl. Netw. Sci., 2022

2021
Graph Matching Between Bipartite and Unipartite Networks: To Collapse, or Not to Collapse, That Is the Question.
IEEE Trans. Netw. Sci. Eng., 2021

Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks.
J. Comput. Graph. Stat., 2021

Leveraging semantically similar queries for ranking via combining representations.
CoRR, 2021

The phantom alignment strength conjecture: practical use of graph matching alignment strength to indicate a meaningful graph match.
Appl. Netw. Sci., 2021

2020
Vertex nomination via seeded graph matching.
Stat. Anal. Data Min., 2020

Matched Filters for Noisy Induced Subgraph Detection.
IEEE Trans. Pattern Anal. Mach. Intell., 2020

Vertex nomination: The canonical sampling and the extended spectral nomination schemes.
Comput. Stat. Data Anal., 2020

On the role of features in vertex nomination: Content and context together are better (sometimes).
CoRR, 2020

2019
Alignment strength and correlation for graphs.
Pattern Recognit. Lett., 2019

Seeded graph matching.
Pattern Recognit., 2019

On Consistent Vertex Nomination Schemes.
J. Mach. Learn. Res., 2019

Neural variational entity set expansion for automatically populated knowledge graphs.
Inf. Retr. J., 2019

Vertex Nomination, Consistent Estimation, and Adversarial Modification.
CoRR, 2019

Multiplex graph matching matched filters.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

2018
Information Recovery in Shuffled Graphs via Graph Matching.
IEEE Trans. Inf. Theory, 2018

On a 'Two Truths' Phenomenon in Spectral Graph Clustering.
CoRR, 2018

2017
Laplacian Eigenmaps From Sparse, Noisy Similarity Measurements.
IEEE Trans. Signal Process., 2017

Semi-External Memory Sparse Matrix Multiplication for Billion-Node Graphs.
IEEE Trans. Parallel Distributed Syst., 2017

Community Detection and Classification in Hierarchical Stochastic Blockmodels.
IEEE Trans. Netw. Sci. Eng., 2017

Scalable out-of-sample extension of graph embeddings using deep neural networks.
Pattern Recognit. Lett., 2017

Statistical Inference on Random Dot Product Graphs: a Survey.
J. Mach. Learn. Res., 2017

Graph matching the matchable nodes when some nodes are unmatchable.
CoRR, 2017

A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs.
Proceedings of the 2017 IEEE International Conference on Data Mining Workshops, 2017

2016
Graph Matching: Relax at Your Own Risk.
IEEE Trans. Pattern Anal. Mach. Intell., 2016

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching.
J. Mach. Learn. Res., 2016

Semi-External Memory Sparse Matrix Multiplication on Billion-node Graphs in a Multicore Architecture.
CoRR, 2016

2015
Spectral clustering for divide-and-conquer graph matching.
Parallel Comput., 2015

Logarithmic Representability of Integers as k-Sums.
Integers, 2015

An evaluation of graph clustering methods for unsupervised term discovery.
Proceedings of the INTERSPEECH 2015, 2015

2014
Seeded graph matching for correlated Erdös-Rényi graphs.
J. Mach. Learn. Res., 2014

2013
Sharp Threshold Asymptotics for the Emergence of Additive Bases.
Integers, 2013


  Loading...