4 citations · 4 across the 5 of their papers we have counts for
5 papers
Recursive random binning to detect and display pairwise dependence
Chris Salahub, Wayne Oldford
Random binnings generated via recursive binary splits are introduced as a way to detect, measure the strength of, and to display the pattern of association between any two variates…
How many cliques can a clique cover cover?
Pavel Shuldiner, R. Wayne Oldford
This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques…
A framework for measuring dependence between random vectors
Marius Hofert, Wayne Oldford, Avinash Prasad +1
A framework for quantifying dependence between random vectors is introduced. With the notion of a collapsing function, random vectors are summarized by single random variables, cal…
Euclidean distance matrix completion and point configurations from the minimal spanning tree
Adam Rahman, Wayne Oldford
The paper introduces a special case of the Euclidean distance matrix completion problem (edmcp) of interest in statistical data analysis where only the minimal spanning tree distan…
Visualizing Dependence in High-Dimensional Data: An Application to S&P 500 Constituent Data
Marius Hofert, Wayne Oldford
The notion of a zenpath and a zenplot is introduced to search and detect dependence in high-dimensional data for model building and statistical inference. By using any measure of d…