output
20092026
most citedParallelizing MCMC with Random Partition Trees

50 citations

Showing 2018Show all

8 papers · 1 filter

stat.ML2018

Subspace Clustering through Sub-Clusters

Weiwei Li, Jan Hannig, Sayan Mukherjee

The problem of dimension reduction is of increasing importance in modern data analysis. In this paper, we consider modeling the collection of points in a high dimensional space as…

cs.LG2018★ 17 cited

Bayesian Semi-supervised Learning with Graph Gaussian Processes

Yin Cheng Ng, Nicolo Colombo, Ricardo Silva

We propose a data-efficient Gaussian process-based Bayesian approach to the semi-supervised learning problem on graphs. The proposed model shows extremely competitive performance w…

stat.ME2018

A Practical Approach to Proper Inference with Linked Data

Andee Kaplan, Brenda Betancourt, Rebecca C. Steorts

Entity resolution (ER), comprising record linkage and de-duplication, is the process of merging noisy databases in the absence of unique identifiers to remove duplicate entities. O…

stat.AP2018

How effective is your blinding?

Anil Gore, Sharayu Paranjpe

This report answers queries about extending the blinding index approach to a situation with measurements at multiple time points. The key question is how to test if there is progre…

stat.ME2018

Conditional and marginal relative risk parameters for a class of recursive regression graph models

Monia Lupparelli

In linear regression modelling the distortion of effects after marginalizing over variables of the conditioning set has been widely studied in several contexts. For Gaussian variab…

math.AT2018★ 5 cited

How Many Directions Determine a Shape and other Sufficiency Results for Two Topological Transforms

Justin Curry, Sayan Mukherjee, Katharine Turner

In this paper we consider two topological transforms that are popular in applied topology: the Persistent Homology Transform (PHT) and the Euler Characteristic Transform (ECT). Bot…