On the public citation graph
Incremental Construction of Neighborhood Graphs for Nonlinear Dimensionality Reduction
0 signed · 19 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-0000(78)90022-3openalex-snapshot
Algorithms for updating minimal spanning trees
inferredcites →https://doi.org/10.1109/tpami.2006.56openalex-snapshot
Incremental nonlinear dimensionality reduction by manifold learning
inferredcites →https://doi.org/10.1109/tpami.2006.89openalex-snapshot
Building k-connected neighborhood graphs for isometric data embedding
inferredcites →https://doi.org/10.1126/science.290.5500.2319openalex-snapshot
A Global Geometric Framework for Nonlinear Dimensionality Reduction
inferredcites →https://doi.org/10.1126/science.290.5500.2323openalex-snapshot
Nonlinear Dimensionality Reduction by Locally Linear Embedding
inferredcites →https://doi.org/10.1137/0204032openalex-snapshot
On Finding and Updating Spanning Trees and Shortest Paths
inferredcites →https://doi.org/10.1145/1081870.1081963openalex-snapshot
Building connected neighborhood graphs for isometric data embedding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-44881-7_8openalex-snapshot
High-Performance Storage Support for Scientific Big Data Applications on the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_7openalex-snapshot
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1016/j.ins.2016.01.069openalex-snapshot
Efficient isometric multi-manifold learning based on the self-organizing method
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004214openalex-snapshot
FusionFS: Toward supporting data-intensive scientific applications on extreme-scale high-performance computing systems
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004238openalex-snapshot
Virtual chunks: On supporting random accesses to scientific data in compressible storage systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2014.11openalex-snapshot
HyCache+: Towards Scalable High-Performance Caching Middleware for Parallel File Systems
inferred← citeshttps://doi.org/10.1109/icdm.2012.98openalex-snapshot
Isometric Multi-manifold Learning for Feature Extraction
inferred← citeshttps://doi.org/10.1109/tpds.2015.2456896openalex-snapshot
Towards Exploring Data-Intensive Scientific Applications at Extreme Scales through Systems and Simulations
inferred← citeshttps://doi.org/10.1109/tsc.2015.2456889openalex-snapshot
Dynamic Virtual Chunks: On Supporting Efficient Accesses to Compressed Scientific Data
inferred← citeshttps://doi.org/10.1504/ijbdi.2016.077358openalex-snapshot
Towards cost-effective and high-performance caching middleware for distributed systems
inferred← citeshttps://doi.org/10.48550/arxiv.0912.0572openalex-snapshot
Isometric Multi-Manifolds Learning
inferred← citeshttps://doi.org/10.70675/f9d6c012z8f82z4360z9ba9z361c84196091openalex-snapshot
Regularization path algorithm for statistical learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.