Graph-theoretic measures of multivariate association and prediction

From MaRDI portal
Publication:786491

DOI10.1214/aos/1176346148zbMath0528.62052OpenAlexW2077584453MaRDI QIDQ786491

Lawrence C. Rafsky, Jerome H. Friedman

Publication date: 1983

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176346148




Related Items

On some exact distribution-free tests of independence between two random vectors of arbitrary dimensionsSymmetrical independence tests for two random vectors with arbitrary dimensional graphsTests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighboursGraph-theoretic multisample tests of equality in distribution for high dimensional dataIntrinsic dimension estimation: relevant techniques and a benchmark frameworkThe central limit theorem for Euclidean minimal spanning trees. IIntrinsic dimension identification via graph-theoretic methodsMeasuring association with Wasserstein distancesThe Binary Expansion Randomized Ensemble TestMultivariate Rank-Based Distribution-Free Nonparametric Testing Using Measure TransportationLimiting distributions of graph-based test statistics on sparse and dense graphsAsymptotic normality of double-indexed linear permutation statisticsOn some consistent tests of mutual independence among several random vectors of arbitrary dimensionsA clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.Efficient nonparametric testing by functional estimationOn the number of weakly connected subdigraphs in random \(k\)NN digraphsThe random minimal spanning tree in high dimensionsResistant estimation of multivariate location using minimum spanning treesAn unbiased method for constructing multilabel classification treesSpatial Clustering Tests Based on the Domination Number of a New Random Digraph FamilyTesting the equality of distributions of random vectors with categorical components.Explicit laws of large numbers for random nearest-neighbour-type graphsOn the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform DataA new coefficient of correlationAn algorithm for simulating permutation tests of graph-intersection measures of associationA classification of isomorphism-invariant random digraphsNonparametric tests of independence based on interpoint distancesModel-based methods to identify multiple cluster structures in a data setOn the asymptotic null distribution of the symmetrized Chatterjee's correlation coefficientA conversation with Jerry FriedmanNon-metric statistical analyses: Some metric alternatives