Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Bi-stochastically normalized graph Laplacian: convergence to manifold Laplacian and robustness to outlier noise

Information and Inference A Journal of the IMA(2024)10.1093/imaiai/iaae026Source: DataRank Database

Bi-stochastically normalized graph Laplacian: convergence to manifold Laplacian and robustness to outlier noise is a research paper published in Information and Inference A Journal of the IMA (2024). On theSindex it has a DataRank of 0. It has been cited 1 time.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access1 citations

Download PDF

Cite:

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (9 grants)Impact (FWCI 0.25)OA: greenTopics (39)IDs (PubMed, PMC, OpenAlex)

FAIR Checklist

Context only (not used in score)

Findable (1/2)

Has DOI

Accessible (1/2)

Open Access

Interoperable (0/2)

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (2)

Boris Landa,Xiuyuan Cheng ORCID

Live enrichment

PubMed:39309272 PMC:PMC11415053 OpenAlex:https://openalex.org/W4402667258

US National Science Foundation

Grant: DMS-2007040

US National Institutes of Health

Grant: R01GM131642

NSF

Grant: DMS-2237842

Simons Foundation

Grant: 814643

National Science Foundation

Grant: 2007040

NSF-BSF: Group Invariant Graph Laplacians: Theory and Computations

National Science Foundation

Grant: 1820827

CDS&E: Structure-Aware Representation Learning Using Deep Networks

National Science Foundation

Grant: 1818945

Collaborative Research: Geometric Analysis and Computation for Generative Models

National Institutes of Health

Grant: 5R01GM131642-04

EFFICIENT METHODS FOR CALIBRATION, CLUSTERING, VISUALIZATION AND IMPUTATION OF LARGE scRNA-seq DATA

National Science Foundation

Grant: 2134037

Bridging Statistical Hypothesis Tests and Deep Learning for Reliability and Computational Efficiency

FWCI

0.25

Citation Percentile

0.6%

Citation Trend

2025

greenLicense: OUP Standard Publication Reuse

repositoryhttps://pmc.ncbi.nlm.nih.gov/articles/PMC11415053/pdf/iaae026.pdf

publisherhttps://academic.oup.com/imaiai/article-pdf/13/4/iaae026/59214862/iaae026.pdf

repositoryhttps://pmc.ncbi.nlm.nih.gov/articles/PMC11415053/

journalhttps://doi.org/10.1093/imaiai/iaae026

Fields of Study

Topological and Geometric Data AnalysisNeural Networks and ApplicationsComplex Network Analysis Techniques02 engineering and technology01 natural sciences0202 electrical engineering, electronic engineering, information engineering0101 mathematics

Keywords

Robustness (evolution)OutlierManifold (fluid mechanics)Laplace operatorGraphLaplacian matrixConvergence (economics)Noise (video)MathematicsComputer scienceArtificial intelligenceMathematical analysisCombinatoricsEngineeringEconomicsMechanical engineeringManifold LearningGraph LaplacianDiffusion OperatorSinkhorn–knoppBi-stochastic NormalizationFOS: Computer and information sciencesComputer Science - Machine LearningGraphs and linear algebra (matrices, eigenvalues, etc.)Sinkhorn-KnoppMathematics - Statistics TheoryOriginal ManuscriptMachine Learning (stat.ML)Statistics Theory (math.ST)Machine Learning (cs.LG)Statistics - Machine LearningFOS: Mathematics