Keith D. Levin

According to our database1, Keith D. Levin authored at least 22 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast generation of exchangeable sequences of clusters data.
Stat. Comput., 2024

2022
Recovering shared structure from multiple networks with unknown edge distributions.
J. Mach. Learn. Res., 2022

2021
Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings.
J. Mach. Learn. Res., 2021

Metric k-median clustering in insertion-only streams.
Discret. Appl. Math., 2021

2020
Comment: Ridge Regression and Regularization of Large Matrices.
Technometrics, 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
On Consistent Vertex Nomination Schemes.
J. Mach. Learn. Res., 2019

Recovering low-rank structure from multiple networks with unknown edge distributions.
CoRR, 2019

2018
Out-of-sample extension of graph adjacency spectral embedding.
Proceedings of the 35th International Conference on Machine Learning, 2018

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

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

Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings.
Proceedings of the Interspeech 2017, 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

Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

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

Clustering Problems on Sliding Windows.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
A Unified Approach for Clustering Problems on Sliding Windows.
CoRR, 2015

Segmental acoustic indexing for zero resource keyword search.
Proceedings of the 2015 IEEE International Conference on Acoustics, 2015

Clustering on Sliding Windows in Polylogarithmic Space.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2013

Fixed-dimensional acoustic embeddings of variable-length segments in low-resource settings.
Proceedings of the 2013 IEEE Workshop on Automatic Speech Recognition and Understanding, 2013


  Loading...