Search Results for author: Andrew B. Nobel

Found 4 papers, 3 papers with code

Graph Optimal Transport with Transition Couplings of Random Walks

1 code implementation13 Jun 2021 Kevin O'Connor, Bongsoo Yi, Kevin McGoff, Andrew B. Nobel

In particular, we propose the graph optimal transition coupling problem, referred to as GraphOTC, in which the Markov chains associated to two given graphs are optimally synchronized to minimize an expected cost.

Finding Stable Groups of Cross-Correlated Features in Two Data Sets With Common Samples

1 code implementation10 Sep 2020 Miheer Dewaskar, John Palowitch, Mark He, Michael I. Love, Andrew B. Nobel

Given two data types, a bimodule is a pair $(A, B)$ of feature sets from the two types such that the aggregate cross-correlation between the features in $A$ and those in $B$ is large.

A testing based extraction algorithm for identifying significant communities in networks

no code implementations3 Dec 2014 James D. Wilson, Simi Wang, Peter J. Mucha, Shankar Bhamidi, Andrew B. Nobel

In addition, we carry out a simulation study to assess the effectiveness of ESSC in networks with various types of community structure, including networks with overlapping communities and those with background vertices.

Community Detection

Joint and individual variation explained (JIVE) for integrated analysis of multiple data types

1 code implementation20 Feb 2011 Eric F. Lock, Katherine A. Hoadley, J. S. Marron, Andrew B. Nobel

In this paper we introduce Joint and Individual Variation Explained (JIVE), a general decomposition of variation for the integrated analysis of such data sets.

Cannot find the paper you are looking for? You can Submit a new open access paper.