no code implementations • 4 May 2023 • Aranyak Acharyya, Joshua Agterberg, Michael W. Trosset, Youngser Park, Carey E. Priebe
We assume that the latent position vectors lie on an unknown one-dimensional curve and are coupled with a response covariate via a regression model.
1 code implementation • 3 May 2023 • Cencheng Shen, Jonathan Larson, Ha Trinh, Xihan Qin, Youngser Park, Carey E. Priebe
Analyzing large-scale time-series network data, such as social media and email communications, poses a significant challenge in understanding social dynamics, detecting anomalies, and predicting trends.
1 code implementation • 18 Jan 2023 • Cencheng Shen, Youngser Park, Carey E. Priebe
In this paper, we introduce a novel and computationally efficient method for vertex embedding, community detection, and community size determination.
no code implementations • 29 Aug 2022 • Cong Mu, Youngser Park, Carey E. Priebe
We propose a dynamic network sampling scheme to optimize block recovery for stochastic blockmodel (SBM) in the case where it is prohibitively expensive to observe the entire graph.
1 code implementation • Findings (EMNLP) 2021 • Kelly Marchisio, Youngser Park, Ali Saad-Eldin, Anton Alyakin, Kevin Duh, Carey Priebe, Philipp Koehn
Alternatively, word embeddings may be understood as nodes in a weighted graph.
no code implementations • 23 Jun 2021 • Hayden S. Helm, Marah Abdin, Benjamin D. Pedigo, Shweti Mahajan, Vince Lyzinski, Youngser Park, Amitabh Basu, Piali~Choudhury, Christopher M. White, Weiwei Yang, Carey E. Priebe
In modern ranking problems, different and disparate representations of the items to be ranked are often available.
no code implementations • 1 Apr 2021 • Tiona Zuzul, Emily Cox Pahnke, Jonathan Larson, Patrick Bourke, Nicholas Caurvina, Neha Parikh Shah, Fereshteh Amini, Jeffrey Weston, Youngser Park, Joshua Vogelstein, Christopher White, Carey E. Priebe
Workplace communications around the world were drastically altered by Covid-19, related work-from-home orders, and the rise of remote work.
1 code implementation • 30 Nov 2020 • Vivek Gopalakrishnan, Jaewon Chung, Eric Bridgeford, Benjamin D. Pedigo, Jesús Arroyo, Lucy Upchurch, G. Allan Johnson, Nian Wang, Youngser Park, Carey E. Priebe, Joshua T. Vogelstein
A connectome is a map of the structural and/or functional connections in the brain.
1 code implementation • 23 Aug 2020 • Guodong Chen, Jesús Arroyo, Avanti Athreya, Joshua Cape, Joshua T. Vogelstein, Youngser Park, Chris White, Jonathan Larson, Weiwei Yang, Carey E. Priebe
We examine two related, complementary inference tasks: the detection of anomalous graphs within a time series, and the detection of temporally anomalous vertices.
Methodology
2 code implementations • 20 May 2020 • Hayden S. Helm, Amitabh Basu, Avanti Athreya, Youngser Park, Joshua T. Vogelstein, Carey E. Priebe, Michael Winding, Marta Zlatic, Albert Cardona, Patrick Bourke, Jonathan Larson, Marah Abdin, Piali Choudhury, Weiwei Yang, Christopher W. White
Learning to rank -- producing a ranked list of items specific to a query and with respect to a set of supervisory items -- is a problem of general interest.
no code implementations • 6 May 2019 • Joshua Agterberg, Youngser Park, Jonathan Larson, Christopher White, Carey E. Priebe, Vince Lyzinski
Given a pair of graphs $G_1$ and $G_2$ and a vertex set of interest in $G_1$, the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in $G_2$ (if they exist) and produce a rank list of the vertices in $G_2$, with the corresponding vertices of interest in $G_2$ concentrating, ideally, at the top of the rank list.
1 code implementation • 5 Apr 2019 • Congyuan Yang, Carey E. Priebe, Youngser Park, David J. Marchette
The second contribution is a simultaneous model selection framework.
no code implementations • 23 Aug 2018 • Carey E. Priebe, Youngser Park, Joshua T. Vogelstein, John M. Conroy, Vince Lyzinski, Minh Tang, Avanti Athreya, Joshua Cape, Eric Bridgeford
Clustering is concerned with coherently grouping observations without any explicit concept of true groupings.
no code implementations • 6 Mar 2018 • Daniel L. Sussman, Youngser Park, Carey E. Priebe, Vince Lyzinski
To illustrate the possibilities and challenges of such problems, we use an algorithm that can exploit a partially known correspondence and show via varied simulations and applications to {\it Drosophila} and human connectomes that this approach can achieve good performance.
no code implementations • 16 Sep 2017 • Avanti Athreya, Donniell E. Fishkind, Keith Levin, Vince Lyzinski, Youngser Park, Yichen Qin, Daniel L. Sussman, Minh Tang, Joshua T. Vogelstein, Carey E. Priebe
In this survey paper, we describe a comprehensive paradigm for statistical inference on random dot product graphs, a paradigm centered on spectral embeddings of adjacency and Laplacian matrices.
1 code implementation • 9 May 2017 • Carey E. Priebe, Youngser Park, Minh Tang, Avanti Athreya, Vince Lyzinski, Joshua T. Vogelstein, Yichen Qin, Ben Cocanougher, Katharina Eichler, Marta Zlatic, Albert Cardona
We present semiparametric spectral modeling of the complete larval Drosophila mushroom body connectome.
no code implementations • 1 May 2017 • Heather G. Patsolic, Youngser Park, Vince Lyzinski, Carey E. Priebe
Consider two networks on overlapping, non-identical vertex sets.
no code implementations • 7 Mar 2015 • Vince Lyzinski, Minh Tang, Avanti Athreya, Youngser Park, Carey E. Priebe
We propose a robust, scalable, integrated methodology for community detection and community comparison in graphs.
no code implementations • 11 Feb 2015 • Vince Lyzinski, Youngser Park, Carey E. Priebe, Michael W. Trosset
The Joint Optimization of Fidelity and Commensurability (JOFC) manifold matching methodology embeds an omnibus dissimilarity matrix consisting of multiple dissimilarities on the same set of objects.
no code implementations • 24 Jun 2014 • Nam H. Lee, I-Jeng Wang, Youngser Park, Care E. Priebe, Michael Rosen
We consider a problem of grouping multiple graphs into several clusters using singular value thesholding and non-negative factorization.
no code implementations • 24 Jun 2014 • Nam H. Lee, Carey Priebe, Youngser Park, I-Jeng Wang, Michael Rosen
A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretization (vertex contraction).
no code implementations • 16 Jan 2014 • Heather Patsolic, Sancar Adali, Joshua T. Vogelstein, Youngser Park, Carey E. Friebe, Gongkai Li, Vince Lyzinski
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm.
1 code implementation • 4 Oct 2013 • Vince Lyzinski, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Li Chen, Joshua T. Vogelstein, Youngser Park, Carey E. Priebe
We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs.
no code implementations • 21 May 2013 • Minh Tang, Youngser Park, Carey E. Priebe
We show that, under the latent position graph model and for sufficiently large $n$, the mapping of the out-of-sample vertices is close to its true latent position.
no code implementations • 9 Jan 2013 • Donniell E. Fishkind, Cencheng Shen, Youngser Park, Carey E. Priebe
Suppose that two large, multi-dimensional data sets are each noisy measurements of the same underlying random process, and principle components analysis is performed separately on the data sets to reduce their dimensionality.