The following pages link to Carey E. Priebe (Q485939):
Displaying 50 items.
- Statistical inference on attributed random graphs: fusion of graph features and content (Q2445633) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association (Q2573988) (← links)
- Fidelity-commensurability tradeoff in joint embedding of disparate dissimilarities (Q2628070) (← links)
- The adaptive kernel neural network (Q2640357) (← links)
- (Q2834517) (← links)
- Maximum L<i>q</i>-Likelihood Estimation via the Expectation-Maximization Algorithm: A Robust Estimation of Mixture Models (Q2861806) (← links)
- Optimizing the Quantity/Quality Trade-Off in Connectome Inference (Q2864656) (← links)
- The reset disambiguation policy for navigating stochastic obstacle fields (Q3005837) (← links)
- (Q3021886) (← links)
- Simultaneous Selection of Features and Metric for Optimal Nearest Neighbor Classification (Q3155384) (← links)
- On the Limiting Distribution of a Graph Scan Statistic (Q3168524) (← links)
- From Distance Correlation to Multiscale Graph Correlation (Q3304853) (← links)
- (Q4247404) (← links)
- A qualitative analysis of the resistive grid kernel estimator (Q4287158) (← links)
- Adaptive Mixtures (Q4314941) (← links)
- Nonhomogeneity Analysis Using Borrowed Strength (Q4366093) (← links)
- A Spatial Scan Statistic for Stochastic Scan Partitions (Q4376024) (← links)
- Generalizing the mann-whitney-wilcoxon statistic (Q4512745) (← links)
- Spatial Scan Density Estimates (Q4541403) (← links)
- Statistical inference on random dot product graphs: a survey (Q4558565) (← links)
- Locality Statistics for Anomaly Detection in Time Series of Graphs (Q4578984) (← links)
- Robust Hypothesis Testing via Lq-Likelihood (Q4601254) (← links)
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs (Q4648556) (← links)
- (Q4859004) (← links)
- A generalized wilcoxon-mann-whitney statistic (Q4935319) (← links)
- (Q4969173) (← links)
- Quantitative Horizon Scanning for Mitigating Technological Surprise: Detecting the Potential for Collaboration at the Interface (Q4969834) (← links)
- Fusion and inference from multiple data sources in a commensurate space (Q4969835) (← links)
- Vertex nomination via seeded graph matching (Q4970326) (← links)
- (Q5053174) (← links)
- The Exact Form of the “Ockham Factor” in Model Selection (Q5056979) (← links)
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming (Q5057261) (← links)
- Testing for Equivalence of Network Distribution Using Subgraph Counts (Q5065993) (← links)
- Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering (Q5066394) (← links)
- Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks (Q5066493) (← links)
- Entrywise Estimation of Singular Vectors of Low-Rank Matrices With Heteroskedasticity and Dependence (Q5088580) (← links)
- Semi-supervised k-means++ (Q5106957) (← links)
- Sparse Representation Classification Beyond ℓ1 Minimization and the Subspace Assumption (Q5124486) (← links)
- (Q5159412) (← links)
- Network dependence testing via diffusion maps and distance-based correlations (Q5212910) (← links)
- On a two-truths phenomenon in spectral graph clustering (Q5218576) (← links)
- Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs (Q5249582) (← links)
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown (Q5300544) (← links)
- (Q5381123) (← links)
- (Q5386592) (← links)
- A new family of random graphs for testing spatial segregation (Q5421209) (← links)
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs (Q5423736) (← links)
- (Q5500313) (← links)
- Random disambiguation paths for traversing a mapped hazard field (Q5706240) (← links)
