Graph-theoretic measures of multivariate association and prediction
From MaRDI portal
(Redirected from Publication:786491)
Cited in
(36)- Multivariate Rank-Based Distribution-Free Nonparametric Testing Using Measure Transportation
- Distribution-free tests of multivariate independence based on center-outward quadrant, Spearman, Kendall, and van der Waerden statistics
- An unbiased method for constructing multilabel classification trees
- Testing the equality of distributions of random vectors with categorical components.
- A survey of some recent developments in measures of association
- Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours
- A Kernel Measure of Dissimilarity between M Distributions
- A classification of isomorphism-invariant random digraphs
- Non-metric statistical analyses: Some metric alternatives
- A new coefficient of correlation
- Some Multivariate Tests of Independence Based on Ranks of Nearest Neighbors
- On some exact distribution-free tests of independence between two random vectors of arbitrary dimensions
- Test of independence for Hilbertian random variables
- Efficient nonparametric testing by functional estimation
- Nonparametric tests of independence based on interpoint distances
- Asymptotic normality of double-indexed linear permutation statistics
- Limiting distributions of graph-based test statistics on sparse and dense graphs
- On the asymptotic null distribution of the symmetrized Chatterjee's correlation coefficient
- Explicit laws of large numbers for random nearest-neighbour-type graphs
- The random minimal spanning tree in high dimensions
- On some consistent tests of mutual independence among several random vectors of arbitrary dimensions
- On the number of weakly connected subdigraphs in random \(k\)NN digraphs
- Model-based methods to identify multiple cluster structures in a data set
- A conversation with Jerry Friedman
- Intrinsic dimension identification via graph-theoretic methods
- Resistant estimation of multivariate location using minimum spanning trees
- Graph-theoretic multisample tests of equality in distribution for high dimensional data
- Symmetrical independence tests for two random vectors with arbitrary dimensional graphs
- An algorithm for simulating permutation tests of graph-intersection measures of association
- Spatial clustering tests based on the domination number of a new random digraph family
- The central limit theorem for Euclidean minimal spanning trees. I
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- Measuring association with Wasserstein distances
- On the number of reflexive and shared nearest neighbor pairs in one-dimensional uniform data
- Intrinsic dimension estimation: relevant techniques and a benchmark framework
- The Binary Expansion Randomized Ensemble Test
This page was built for publication: Graph-theoretic measures of multivariate association and prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786491)