Pages that link to "Item:Q786491"

The following pages link to Graph-theoretic measures of multivariate association and prediction (Q786491):

Displaying 30 items.

• Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family (Q82973) (← links)
• A new coefficient of correlation (Q130047) (← links)
• A conversation with Jerry Friedman (Q254457) (← links)
• On some exact distribution-free tests of independence between two random vectors of arbitrary dimensions (Q282902) (← links)
• Intrinsic dimension identification via graph-theoretic methods (Q391544) (← links)
• The random minimal spanning tree in high dimensions (Q674507) (← links)
• Asymptotic normality of double-indexed linear permutation statistics (Q908620) (← links)
• Efficient nonparametric testing by functional estimation (Q921777) (← links)
• An unbiased method for constructing multilabel classification trees (Q956995) (← links)
• An algorithm for simulating permutation tests of graph-intersection measures of association (Q1010534) (← links)
• Model-based methods to identify multiple cluster structures in a data set (Q1020837) (← links)
• Non-metric statistical analyses: Some metric alternatives (Q1073498) (← links)
• The central limit theorem for Euclidean minimal spanning trees. I (Q1379719) (← links)
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (Q1423266) (← links)
• Graph-theoretic multisample tests of equality in distribution for high dimensional data (Q1659474) (← links)
• Intrinsic dimension estimation: relevant techniques and a benchmark framework (Q1666523) (← links)
• On the asymptotic null distribution of the symmetrized Chatterjee's correlation coefficient (Q2112280) (← links)
• Symmetrical independence tests for two random vectors with arbitrary dimensional graphs (Q2131147) (← links)
• On some consistent tests of mutual independence among several random vectors of arbitrary dimensions (Q2209730) (← links)
• On the number of weakly connected subdigraphs in random \(k\)NN digraphs (Q2223629) (← links)
• Measuring association with Wasserstein distances (Q2676942) (← links)
• Resistant estimation of multivariate location using minimum spanning trees (Q2746355) (← links)
• Explicit laws of large numbers for random nearest-neighbour-type graphs (Q3590741) (← links)
• On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data (Q4581305) (← links)
• Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours (Q5065310) (← links)
• A classification of isomorphism-invariant random digraphs (Q5149414) (← links)
• Nonparametric tests of independence based on interpoint distances (Q5221306) (← links)
• Testing the equality of distributions of random vectors with categorical components. (Q5941549) (← links)
• The Binary Expansion Randomized Ensemble Test (Q6069482) (← links)
• Limiting distributions of graph-based test statistics on sparse and dense graphs (Q6178584) (← links)