Pith. sign in

REVIEW 3 major objections 5 minor 83 references

MAPLE: Mapper Based Localized Prediction with Data Driven Cover Selection for High dimensional Data

T0 review · 3 major / 5 minor · reviewed 2026-07-10 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read MAPLE turns Mapper graphs into local probability estimators with data-driven cover scaling, and proves they are consistent for classification on heterogeneous high-dimensional data.

desk verdict Solid supervised Mapper estimator with a real bias-variance cover rule and standard consistency; filter dependence is the main practical limit, not a broken theorem. read the letter →

arxiv 2607.06797 v1 pith:MRB5V6GK submitted 2026-07-07 stat.ME

Md Moinul Ahsan , Priyam Das , Nitai D Mukhopadhyay This is my paper
classification stat.ME MSC 62G0862H3055N31
keywords TopologicaldataanalysisMapperalgorithmlocalizedpredictionnonparametricclassificationhigh-dimensionalParkinson’sdiseasegliomaRNAsequencingbias-variancecoverselection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

High-dimensional biomedical data often live on curved, branched manifolds where a single global model misreads the relationship between predictors and outcomes. This paper proposes MAPLE: it builds a Mapper graph from a one-dimensional filter, then estimates class probabilities by averaging only inside the graph-connected neighborhoods that contain a new point. Cover size and overlap are chosen by an explicit bias–variance criterion that yields the classical n^{1/5} scaling for the number of intervals. Under standard regularity conditions the resulting estimator is pointwise consistent for the true conditional probabilities and the plug-in classifier is Bayes-risk consistent. Simulations and two clinical applications (Parkinson stage, glioma grade) show the largest gains precisely when the data are heterogeneous and noisy, while the same graph supplies readable topological summaries of patient subgroups.

What carries the argument

MAPLE estimator: inverse-distance-weighted average of class indicators inside the union of Mapper clusters that contain a new observation, with interval number and overlap selected by minimizing ρ/S + (1-ρ)/l^4 subject to the cover constraint.

What would settle it

On synthetic data whose response depends on a branching manifold that a deliberately poor filter (for example pure PCA of noise coordinates) completely flattens, MAPLE should lose its advantage over ordinary k-NN or logistic regression and its estimated probabilities should fail to approach the true branch-specific probabilities as n grows.

Watch

Extended reading notes

Core claim

The authors show that conditional class probabilities can be estimated by local averaging over data-adaptive neighborhoods induced by a Mapper graph whose cover parameters are chosen to balance bias and variance; under Lipschitz filter, twice-differentiable probabilities, and vanishing neighborhood diameter the estimator is pointwise consistent and the plug-in rule is Bayes-risk consistent.

Load-bearing premise

The one-dimensional filter must keep the geometry that actually matters for the response; if it collapses or distorts the relevant structure, the Mapper neighborhoods become the wrong sets and consistency no longer yields useful predictions.

Editorial extensions

If this is right

  • When predictor–response relations vary across latent branches, Mapper neighborhoods recover local structure that global multinomial or ordinal models miss.
  • Cover parameters can be set by a single scalar bias–variance trade-off instead of ad-hoc interval counts, giving asymptotic guidance for Mapper resolution.
  • The same graph that produces the predictions supplies topology-aware patient subgroups with distinct stage or grade compositions and clinical summaries.
  • Permutation importance computed from Mapper neighborhoods quantifies which covariates both predict and shape the topology.
  • Primary graph neighborhoods already balance locality and stability; deeper secondary neighborhoods need not improve accuracy.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same construction could be lifted to survival outcomes by replacing class indicators with local Nelson–Aalen or Cox scores inside Mapper nodes.
  • If the filter itself is learned jointly with the cover (instead of fixed OASDA), the method may recover informative projections that pure unsupervised lenses miss.
  • Computational cost of repeated Mapper builds for variable importance suggests a natural next step: sparsity or screening inside the Mapper construction rather than as a pre-filter.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes MAPLE, a nonparametric estimator of conditional class probabilities that uses Mapper-graph neighborhoods for localized averaging in high-dimensional predictor space. A one-dimensional filter (OASDA) induces overlapping intervals whose cover parameters (l, S, q) are chosen by a bias–variance criterion L(S,l)=ρS^{-1}+(1−ρ)l^{-4}, with optimal scaling given in Lemma 1; predictions use inverse-squared-distance weighted averages of labels in primary Mapper neighborhoods, with ordinal and multinomial decision rules. Theorem 1 claims pointwise consistency of ˆη_r(t) and Bayes-risk consistency of the plug-in classifier under (A1)–(A5). Simulations under designed branching heterogeneity show gains over multinomial/ordinal logistic regression and competitive or better performance versus random forest; applications to PPMI Hoehn–Yahr staging and TCGA glioma grade report competitive accuracy and topology-aware visualizations.

Significance. If the claims hold, MAPLE is a useful bridge between Mapper-style TDA and supervised nonparametric classification: it supplies an explicit local-average estimator, a data-driven cover rule with asymptotic scaling, and standard consistency guarantees, plus a permutation importance measure and code. The simulation design (branch-specific vs global latent scores) and two biomedical applications make the geometry-adaptive claim falsifiable and practically relevant for heterogeneous biomedical data where global parametric models are misspecified. Strengths include the explicit bias–variance cover criterion, reported SEs, and public code; the main limitation is that empirical gains are not cleanly separated from the quality of the OASDA filter.

major comments (3)
  1. §2.2 and Theorem 1 / (A2): The load-bearing premise for the “geometry-adaptive” claim is that the one-dimensional OASDA filter preserves response-relevant structure so that Mapper pullbacks induce neighborhoods that are local for η_r in the original space. Formal consistency only requires Lipschitz f and |U_n|→∞, diam→0; if f collapses branches or mixes regimes, neighborhoods can be misspecified for prediction while the projected process remains consistent. Main simulations and both applications use the same OASDA filter; Supp. Table S4 is only limited sensitivity. Please expand filter-sensitivity experiments (PCA, random projections, unsupervised filters) in the main text and state more carefully that gains are conditional on a response-relevant filter.
  2. §2.3 Lemma 1 and Eq. (1): The optimal scaling l*∼n^{1/5}, S*∼2n/l*, q*/S*=1/2 is derived under classical bias–variance rates (var∼S^{-1}, bias²∼l^{-4}) for a one-dimensional smoother. It is not shown that Mapper clustering and graph connectivity preserve these rates once neighborhoods are irregular graph-induced sets rather than fixed-width intervals. Either sketch why the rates still hold under (A4)–(A5), or reframe Lemma 1 as a heuristic cover selector motivated by classical theory rather than a Mapper-specific optimality result.
  3. §3.1–3.2 and Table 1: Scenario 1 is constructed so that branch-specific latent scores and thresholds make a single global surface misspecified; MAPLE’s largest gains appear precisely there. That is informative but risks overstating general superiority over RF/OLR. Please add at least one heterogeneous setting that is not explicitly branch-engineered (e.g., smooth manifold with local coefficient variation, or mixture of Gaussians without designed branches) so that the advantage is not tied only to the simulation’s generative geometry.
minor comments (5)
  1. §2.4: Inverse-squared-distance weights are one of several schemes (Supp. Table S2); a one-sentence justification for preferring ∥·∥^{-2} over inverse distance or uniform weights would help.
  2. Figure 3 and Figure 4: Node pie charts and colors are informative but hard to parse in grayscale; consider a legend that maps stages to hatch patterns or a clearer colorblind-safe palette.
  3. §4.1–4.2: Variable screening (permutation Δ for PPMI; RF MDA for TCGA) uses different pipelines and thresholds (5% vs MDA>3). Clarify why the procedures differ and whether MAPLE’s own importance was infeasible for the gene set only for cost reasons (as Table S6 suggests).
  4. Notation: t_new vs tnew, and ˆη_r(t) vs ˆη_r(t_new) are used interchangeably; unify indexing of the estimator.
  5. References: Carrière–Oudot (2018) is cited for Mapper stability; a brief pointer to how (A4)–(A5) relate to their structural results would strengthen the theory section.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: Theorem 1 is standard local-averaging consistency under explicit neighborhood conditions; cover selection and filter are tuning/inputs, not tautological reductions of the claimed estimator.

full rationale

The load-bearing claim (Theorem 1) states that the Mapper-neighborhood weighted average ˆη_r(t) is pointwise consistent for η_r(t)=P(Y=r|T=t) and that the plug-in rule is Bayes-risk consistent, under (A1)–(A5). The estimator itself is the ordinary nonparametric local average ˆη_r(t_new)=∑ ˜w_i 1(y_i=r) over the data-dependent set U(x_new) induced by the Mapper graph (Section 2.4). Consistency follows from the classical conditions that neighborhood size |U_n(x)|→∞ and diameter→0 in probability (A4–A5), together with Lipschitz filter and twice-differentiable η (A2–A3); the paper defers the standard arguments to Supplementary S2 and does not reduce the limit to any fitted identity. Cover parameters (S,l,q) are chosen by minimizing an explicit bias–variance criterion L(S,l)=ρ S^{-1}+(1-ρ)l^{-4} whose optimal scaling is classical (Lemma 1, citing Wasserman/Freedman–Diaconis), with ρ selected by ordinary CV on held-out prediction error; this is tuning, not a prediction forced by construction. The filter is the external OASDA projection of Han et al. (2024) (no author overlap), treated as a fixed Lipschitz map under (A2); supervised construction of the filter does not make ˆη circular for the projected conditional. Variable importance is ordinary permutation. Simulations and applications use proper train-only construction inside CV. No equation equates a claimed first-principles result to its own input, no self-citation is load-bearing for uniqueness or the consistency proof, and no known empirical pattern is merely renamed. The derivation is therefore self-contained against external nonparametric benchmarks.

Assumptions & free parameters 5 free parameters · 5 assumptions · 1 invented entities

The central claim rests on standard nonparametric regularity plus Mapper-specific neighborhood conditions, a supervised filter, and a few tunable cover and clustering choices. No new physical entities are postulated; free parameters are the usual smoothing/CV knobs.

free parameters (5)
  • ρ (bias-variance weight in cover criterion L)
    Selected by cross-validation on a grid {0.1,...,0.9}; controls the trade-off that determines optimal l*, S*, q*.
  • Cover triple (l, S, q) after discretization
    Integerized from the continuous optimum of Lemma 1 subject to S+(l-1)q=n; directly sets neighborhood resolution.
  • Number of clusters K_j per interval (silhouette)
    Chosen by silhouette criterion inside each pullback set; affects node definition and graph connectivity.
  • Inverse-squared-distance weights and primary-neighborhood definition
    Weighting scheme and restriction to primary (not secondary) neighborhoods are design choices that enter the estimator.
  • Variable-importance threshold / pre-screening cutoff
    5% median Δ for PPMI; RF mean-decrease-accuracy threshold 3 and top-10% variance genes for TCGA; affect which covariates enter the reported models.
assumptions (5)
  • standard math X has compact support (A1).
    Standard for controlling neighborhood diameters in nonparametric consistency proofs.
  • domain assumption Filter f is Lipschitz continuous (A2).
    Needed so filter-space covers induce controlled sets in the original space; OASDA is assumed to satisfy this.
  • standard math Conditional class probabilities η_r(t) are twice continuously differentiable (A3).
    Classical smoothness for bias rates that motivate the l^{-4} term.
  • domain assumption Mapper neighborhood size |U_n(x)|→∞ and cluster diameters →0 in probability (A4–A5).
    Mapper-specific conditions that turn graph neighborhoods into valid local averaging sets.
  • ad hoc to paper OASDA (or chosen filter) preserves response-relevant geometry of the high-dimensional predictors.
    The method indexes estimation by the one-dimensional filter; usefulness of neighborhoods depends on this unproved structural preservation.
invented entities (1)
  • MAPLE estimator (Mapper-graph local average of class indicators with data-driven cover)
    purpose: Define a nonparametric conditional-probability estimator whose neighborhoods follow Mapper connectivity rather than fixed metric balls.
    The named method and its cover-selection rule are the paper’s main constructed objects; they are algorithmic rather than ontological entities.

how reviews work

0 comments
Cite this review

Pith. "Pith review of MAPLE: Mapper Based Localized Prediction with Data Driven Cover Selection for High dimensional Data." pith.science (2026). https://pith.science/paper/MRB5V6GK

@misc{pith2026260706797,
  author       = {Pith},
  title        = {Pith review of: MAPLE: Mapper Based Localized Prediction with Data Driven Cover Selection for High dimensional Data},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MRB5V6GK}},
  note         = {Machine review of arXiv:2607.06797}
}
read the original abstract

High dimensional biomedical data often exhibit nonlinear, heterogeneous, and manifold driven structures that challenge global parametric and tree-based models. We propose MAPLE (mapper-based Adaptive Prediction via Local Estimation), a localized prediction framework grounded in topological data analysis. The method is formulated as a nonparametric estimator of conditional class probabilities that adapts to the intrinsic geometry of the predictor space. Neighborhoods are defined through connectivity in a data-adaptive Mapper graph, enabling localized averaging within graph induced regions that capture complex structures such as branching and multi-scale heterogeneity. We introduce a statistically principled, data driven procedure for cover selection based on a bias-variance trade off, yielding optimal asymptotic scaling for interval widths and overlaps. The framework accommodates binary, nominal, and ordinal outcomes and incorporates a permutation-based variable importance measure to quantify covariate contributions in prediction. We establish theoretical guarantees, including pointwise consistency and Bayes risk consistency under standard regularity conditions. Simulations show that MAPLE consistently outperforms or matches multinomial regression, ordinal regression, and random forest, with the largest gains observed under heterogeneous and high-noise settings. Applications to Parkinson's disease progression (PPMI) and glioma classification (TCGA RNA sequencing) demonstrate strong predictive accuracy and interpretable, topology-aware summaries of underlying data structure.

Figures

Figures reproduced from arXiv: 2607.06797 by the authors.

Figure 1
Figure 1. Illustration of the Mapper construction. High dimensional observations are projected [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Overlapping interval construction in ordered filter space with interval size [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Mapper and PCA representations under Scenario 1 and Scenario 2 for [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Mapper graph constructed using the bias-variance tuning parameter [PITH_FULL_IMAGE:figures/full_fig_p022_4.png]
Figure 5
Figure 5. Figure 5: Mapper graph of the UCSC Xena glioma dataset constructed with tuning parameter [PITH_FULL_IMAGE:figures/full_fig_p024_5.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

83 extracted references · 83 canonical work pages

  1. [1]

    , author=

    Topological methods for the analysis of high dimensional data sets and 3d object recognition. , author=. PBG@ Eurographics , volume=

    work page

  2. [2]

    Frontiers in artificial intelligence , volume=

    An introduction to topological data analysis: fundamental and practical aspects for data scientists , author=. Frontiers in artificial intelligence , volume=. 2021 , publisher=

    work page 2021

  3. [3]

    Analysing Multiscale Clusterings with Persistent Homology

    Persistent homology of the multiscale clustering filtration , author=. arXiv preprint arXiv:2305.04281 , year=

    work page Pith review arXiv

  4. [4]

    Journal of Machine Learning Research , volume=

    Statistical analysis and parameter selection for mapper , author=. Journal of Machine Learning Research , volume=

    work page

  5. [5]

    JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS , volume=

    A NODE PREDICTION ALGORITHM WITH THE MAPPER METHOD BASED ON DBSCAN AND GIOTTO-TDA , author=. JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS , volume=

    work page

  6. [6]

    2017 , publisher=

    Practical guide to cluster analysis in R: Unsupervised machine learning , author=. 2017 , publisher=

    work page 2017

  7. [7]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=

    Estimating the number of clusters in a data set via the gap statistic , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2001 , publisher=

    work page 2001

  8. [8]

    2024 IEEE International Conference on Metrology for eXtended Reality, Artificial Intelligence and Neural Engineering (MetroXRAINE) , pages=

    A Systematic Approach to Tuning Cover Parameters in Mapper for Improved TDA Representation , author=. 2024 IEEE International Conference on Metrology for eXtended Reality, Artificial Intelligence and Neural Engineering (MetroXRAINE) , pages=. 2024 , organization=

    work page 2024

Show all 83 references
  1. [9]

    International Workshop on Topology-and Graph-Informed Imaging Informatics , pages=

    Exploitation of Mapper Algorithm in Neuroimaging Applications: A Novel Framework for Outcomes Prediction , author=. International Workshop on Topology-and Graph-Informed Imaging Informatics , pages=. 2024 , organization=

    2024

  2. [10]

    Scientific reports , volume=

    Extracting insights from the shape of complex data using topology , author=. Scientific reports , volume=. 2013 , publisher=

    2013

  3. [11]

    g-mapper: Learning a cover in the mapper construction, 2024 , author=

    2024

  4. [12]

    Analytical Chemistry , volume=

    Spatiochemical characterization of the pancreas using mass spectrometry imaging and topological data analysis , author=. Analytical Chemistry , volume=. 2023 , publisher=

    2023

  5. [13]

    Proceedings of The Web Conference 2020 , pages=

    Shapevis: High-dimensional data visualization at scale , author=. Proceedings of The Web Conference 2020 , pages=

    2020

  6. [14]

    Pattern recognition , volume=

    An extensive comparative study of cluster validity indices , author=. Pattern recognition , volume=. 2013 , publisher=

    2013

  7. [15]

    16th IEEE international conference on tools with artificial intelligence , pages=

    Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms , author=. 16th IEEE international conference on tools with artificial intelligence , pages=. 2004 , organization=

    2004

  8. [16]

    14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019) Seville, Spain, May 13--15, 2019, Proceedings 14 , pages=

    Indexes to find the optimal number of clusters in a hierarchical clustering , author=. 14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019) Seville, Spain, May 13--15, 2019, Proceedings 14 , pages=. 2020 , organization=

    2019

  9. [17]

    IEEE transactions on neural networks and learning systems , volume=

    Method for determining the optimal number of clusters based on agglomerative hierarchical clustering , author=. IEEE transactions on neural networks and learning systems , volume=. 2016 , publisher=

    2016

  10. [18]

    npj Parkinson's Disease , volume=

    Machine learning-based prediction of cognitive outcomes in de novo Parkinson’s disease , author=. npj Parkinson's Disease , volume=. 2022 , publisher=

    2022

  11. [19]

    Journal of neurology , volume=

    Beyond PD-MCI: objectively defined subtle cognitive decline predicts future cognitive and functional changes , author=. Journal of neurology , volume=. 2021 , publisher=

    2021

  12. [20]

    CNS Neuroscience & Therapeutics , volume=

    Motor progression trajectories and risk of mild cognitive impairment in Parkinson's disease: A latent class trajectory model from PPMI cohort , author=. CNS Neuroscience & Therapeutics , volume=. 2024 , publisher=

    2024

  13. [21]

    progressive cognitive impairment , author=

    Cognitive dysfunction in de novo Parkinson disease: Remitting vs. progressive cognitive impairment , author=. Parkinsonism & Related Disorders , volume=. 2024 , publisher=

    2024

  14. [22]

    Neuroscience Letters , volume=

    An individualized prediction of time to cognitive impairment in Parkinson’s disease: a combined multi-predictor study , author=. Neuroscience Letters , volume=. 2021 , publisher=

    2021

  15. [23]

    Neurological Sciences , pages=

    A predictive model for longitudinal cognitive subtypes in Parkinson's disease , author=. Neurological Sciences , pages=. 2025 , publisher=

    2025

  16. [24]

    Frontiers in Aging Neuroscience , volume=

    Predictors of cognitive impairment in newly diagnosed Parkinson’s disease with normal cognition at baseline: A 5-year cohort study , author=. Frontiers in Aging Neuroscience , volume=. 2023 , publisher=

    2023

  17. [25]

    2022 Virtual Joint Mathematics Meetings (JMM 2022) , organization=

    Adaptive Covers for Mapper Graphs Using Information Criteria , author=. 2022 Virtual Joint Mathematics Meetings (JMM 2022) , organization=

    2022

  18. [26]

    BMC bioinformatics , volume=

    A distribution-guided Mapper algorithm , author=. BMC bioinformatics , volume=. 2025 , publisher=

    2025

  19. [27]

    Network Neuroscience , volume=

    Deconstructing the Mapper algorithm to extract richer topological and temporal features from functional neuroimaging data , author=. Network Neuroscience , volume=. 2024 , publisher=

    2024

  20. [28]

    Axioms , volume=

    Handling multicollinearity and outliers in logistic regression using the robust Kibria--Lukman estimator , author=. Axioms , volume=. 2024 , publisher=

    2024

  21. [29]

    The Egyptian journal of neurology, psychiatry and neurosurgery , volume=

    Baseline predictors of progression of Parkinson’s disease in a sample of Egyptian patients: clinical and biochemical , author=. The Egyptian journal of neurology, psychiatry and neurosurgery , volume=. 2022 , publisher=

    2022

  22. [30]

    Neurological Sciences , volume=

    Disease progression in Parkinson subtypes: the PPMI dataset , author=. Neurological Sciences , volume=. 2018 , publisher=

    2018

  23. [31]

    Journal of the neurological sciences , volume=

    Identification of a prospective early motor progression cluster of Parkinson's disease: Data from the PPMI study , author=. Journal of the neurological sciences , volume=. 2018 , publisher=

    2018

  24. [32]

    Frontiers in neuroscience , volume=

    Hoehn and Yahr stage and striatal Dat-SPECT uptake are predictors of Parkinson’s disease motor progression , author=. Frontiers in neuroscience , volume=. 2021 , publisher=

    2021

  25. [33]

    Computers in Biology and Medicine , volume=

    Monitoring Parkinson's disease progression based on recorded speech with missing ordinal responses and replicated covariates , author=. Computers in Biology and Medicine , volume=. 2021 , publisher=

    2021

  26. [34]

    Movement Disorders , volume=

    Progression of Parkinson's disease as evaluated by Hoehn and Yahr stage transition times , author=. Movement Disorders , volume=. 2010 , publisher=

    2010

  27. [35]

    Frontiers in genetics , volume=

    Development of an immune-related LncRNA prognostic signature for glioma , author=. Frontiers in genetics , volume=. 2021 , publisher=

    2021

  28. [36]

    Cancer Medicine , volume=

    Identification of thioredoxin domain containing family members' expression pattern and prognostic value in diffuse gliomas via in silico analysis , author=. Cancer Medicine , volume=. 2023 , publisher=

    2023

  29. [37]

    Translational Cancer Research , volume=

    Establishment and validation of a prognostic prediction model for glioma based on key genes and clinical factors , author=. Translational Cancer Research , volume=

  30. [38]

    Nature biotechnology , volume=

    Visualizing and interpreting cancer genomics data via the Xena platform , author=. Nature biotechnology , volume=. 2020 , publisher=

    2020

  31. [39]

    SIAM Journal on Mathematics of Data Science , volume=

    g-mapper: Learning a cover in the mapper construction , author=. SIAM Journal on Mathematics of Data Science , volume=. 2025 , publisher=

    2025

  32. [40]

    2021 IEEE International Conference on Big Data (Big Data) , pages=

    Adaptive covers for mapper graphs using information criteria , author=. 2021 IEEE International Conference on Big Data (Big Data) , pages=. 2021 , organization=

    2021

  33. [41]

    Journal of Computational Biology , year=

    A Mapper Algorithm with implicit intervals and its optimization , author=. Journal of Computational Biology , year=

  34. [42]

    2006 , publisher=

    All of nonparametric statistics , author=. 2006 , publisher=

    2006

  35. [43]

    The annals of statistics , pages=

    Optimal global rates of convergence for nonparametric regression , author=. The annals of statistics , pages=. 1982 , publisher=

    1982

  36. [44]

    Neural computation , volume=

    Neural networks and the bias/variance dilemma , author=. Neural computation , volume=. 1992 , publisher=

    1992

  37. [45]

    2009 , publisher=

    The elements of statistical learning: data mining, inference, and prediction , author=. 2009 , publisher=

    2009

  38. [46]

    2018 , publisher=

    Density estimation for statistics and data analysis , author=. 2018 , publisher=

    2018

  39. [47]

    Biometrika , volume=

    On optimal and data-based histograms , author=. Biometrika , volume=. 1979 , publisher=

    1979

  40. [48]

    Zeitschrift f

    On the histogram as a density estimator: L 2 theory , author=. Zeitschrift f. 1981 , publisher=

    1981

  41. [49]

    1995 , publisher=

    Neural networks for pattern recognition , author=. 1995 , publisher=

    1995

  42. [50]

    Proceedings of the 27th International Joint Conference on Artificial Intelligence, Stockholm, Sweden , pages=

    Instance weighting for domain adaptation via trading off sample selection bias and variance , author=. Proceedings of the 27th International Joint Conference on Artificial Intelligence, Stockholm, Sweden , pages=

  43. [51]

    IEEE Access , volume=

    Meta-optimization of bias-variance trade-off in stochastic model learning , author=. IEEE Access , volume=. 2021 , publisher=

    2021

  44. [52]

    Journal of the American statistical association , volume=

    Locally weighted regression: an approach to regression analysis by local fitting , author=. Journal of the American statistical association , volume=. 1988 , publisher=

    1988

  45. [53]

    2013 , publisher=

    A probabilistic theory of pattern recognition , author=. 2013 , publisher=

    2013

  46. [54]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Distribution-free prediction bands for non-parametric regression , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2014 , publisher=

    2014

  47. [55]

    The annals of statistics , pages=

    Consistent nonparametric regression , author=. The annals of statistics , pages=. 1977 , publisher=

    1977

  48. [56]

    2007 , publisher=

    The Bayesian choice: from decision-theoretic foundations to computational implementation , author=. 2007 , publisher=

    2007

  49. [57]

    Nature neuroscience , volume=

    Dimensionality reduction for large-scale neural recordings , author=. Nature neuroscience , volume=. 2014 , publisher=

    2014

  50. [58]

    Nature biotechnology , volume=

    The dynamics and regulators of cell fate decisions are revealed by pseudotemporal ordering of single cells , author=. Nature biotechnology , volume=. 2014 , publisher=

    2014

  51. [59]

    Foundations of Computational Mathematics , volume=

    Structure and stability of the one-dimensional mapper , author=. Foundations of Computational Mathematics , volume=. 2018 , publisher=

    2018

  52. [60]

    Learning to classify ordinal data: The data replication method , author=

  53. [61]

    Technometrics , volume=

    Sparse discriminant analysis , author=. Technometrics , volume=. 2011 , publisher=

    2011

  54. [62]

    Biometrics , volume=

    Sparse ordinal discriminant analysis , author=. Biometrics , volume=. 2024 , publisher=

    2024

  55. [63]

    Electoral studies , volume=

    Loess:: a nonparametric, graphical tool for depicting relationships between variables , author=. Electoral studies , volume=. 2000 , publisher=

    2000

  56. [64]

    Proceedings of the National Academy of Sciences , volume=

    Topology based data analysis identifies a subgroup of breast cancers with a unique mutational profile and excellent survival , author=. Proceedings of the National Academy of Sciences , volume=. 2011 , publisher=

    2011

  57. [65]

    BMC bioinformatics , volume=

    A topological data analysis based classification method for multiple measurements , author=. BMC bioinformatics , volume=. 2020 , publisher=

    2020

  58. [66]

    PloS one , volume=

    Designing machine learning workflows with an application to topological data analysis , author=. PloS one , volume=. 2019 , publisher=

    2019

  59. [67]

    Journal of Manufacturing Systems , volume=

    Identification of key features using topological data analysis for accurate prediction of manufacturing system outputs , author=. Journal of Manufacturing Systems , volume=. 2017 , publisher=

    2017

  60. [68]

    Statistics in medicine , volume=

    Simulating biologically plausible complex survival data , author=. Statistics in medicine , volume=. 2013 , publisher=

    2013

  61. [69]

    BMC bioinformatics , volume=

    Conditional variable importance for random forests , author=. BMC bioinformatics , volume=. 2008 , publisher=

    2008

  62. [70]

    , author=

    Weighted kappa: Nominal scale agreement provision for scaled disagreement or partial credit. , author=. Psychological bulletin , volume=. 1968 , publisher=

    1968

  63. [71]

    Bulletin of the American Mathematical Society , volume=

    Topology and data , author=. Bulletin of the American Mathematical Society , volume=

  64. [72]

    2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA) , pages=

    Mapper based classifier , author=. 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA) , pages=. 2019 , organization=

    2019

  65. [73]

    IEEE transactions on information theory , volume=

    Nearest neighbor pattern classification , author=. IEEE transactions on information theory , volume=. 1967 , publisher=

    1967

  66. [74]

    Theory of Probability & Its Applications , volume=

    On estimating regression , author=. Theory of Probability & Its Applications , volume=. 1964 , publisher=

    1964

  67. [75]

    Annual review of statistics and its application , volume=

    Topological data analysis , author=. Annual review of statistics and its application , volume=. 2018 , publisher=

    2018

  68. [76]

    Neural computation , volume=

    Laplacian eigenmaps for dimensionality reduction and data representation , author=. Neural computation , volume=. 2003 , publisher=

    2003

  69. [77]

    Applied and computational harmonic analysis , volume=

    Diffusion maps , author=. Applied and computational harmonic analysis , volume=. 2006 , publisher=

    2006

  70. [78]

    Machine learning , volume=

    Random forests , author=. Machine learning , volume=. 2001 , publisher=

    2001

  71. [79]

    Journal of computational and applied mathematics , volume=

    Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , author=. Journal of computational and applied mathematics , volume=. 1987 , publisher=

    1987

  72. [80]

    Statistica Sinica , volume=

    High-dimensional varying index coefficient quantile regression model , author=. Statistica Sinica , volume=. 2022 , publisher=

    2022

  73. [81]

    Journal of the American Statistical Association , volume=

    Adaboost semiparametric model averaging prediction for multiple categories , author=. Journal of the American Statistical Association , volume=. 2022 , publisher=

    2022

  74. [82]

    Statistical Methods in Medical Research , volume=

    A distribution-free smoothed combination method to improve discrimination accuracy in multi-category classification , author=. Statistical Methods in Medical Research , volume=. 2023 , publisher=

    2023

  75. [83]

    Journal of the American statistical association , volume=

    Hierarchical grouping to optimize an objective function , author=. Journal of the American statistical association , volume=. 1963 , publisher=

    1963

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.