The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Towards a theoretical foundation for Laplacian-based manifold methods
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Self-citationChung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500334102 · Cited by 1,675
Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
Donoho, D. L., & Grimes, C. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1031596100 · Cited by 1,661
Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering
Bengio, Y., Paiement, J.-F., Vincent, P., Delalleau, O., Roux, N. L., & Ouimet, M. (2003) · Cited by 894
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
On clusterings: Good, bad and spectral
Kannan, R., Vempala, S., & Vetta, A. (2004) · Journal of the ACM · doi:10.1145/990308.990313 · Cited by 834
Diffusion Kernels on Graphs and Other Discrete Input Spaces
Kondor, R., & Lafferty, J. (2002) · Cited by 725
Partially labeled classification with Markov Random Walks
Szummer, M., & Jaakkola, T. (2001) · Cited by 558
Consistency of spectral clustering
von Luxburg, U., Belkin, M., & Bousquet, O. (2008) · The Annals of Statistics · doi:10.1214/009053607000000640 · Cited by 540
Self-citationFinding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
Self-citationCluster Kernels for Semi-Supervised Learning
Chapelle, O., Weston, J., & Schölkopf, B. (2002) · Cited by 461
The Laplacian on a Riemannian Manifold: An Introduction to Analysis on Manifolds
Rosenberg, S. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511623783 · Cited by 449
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S.-H. (1996) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548468 · Cited by 393
On clusterings-good, bad and spectral
Kannan, R., Vempala, S., & Veta, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892125 · Cited by 372
Learning Segmentation by Random Walks
Meilă, M., & Shi, J. (2000) · neural information processing systems · Cited by 365
Belkin, M., Niyogi, P., & Sindhwani, V. (2005) · Cited by 323
Self-citationFrom graph to manifold Laplacian: The convergence rate
Singer, A. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.03.004 · Cited by 316
From Graphs to Manifolds – Weak and Strong Pointwise Consistency of Graph Laplacians
Hein, M., Audibert, J.-Y., & von Luxburg, U. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_32 · Cited by 270
Zomorodian, A., & Carlsson, G. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997870 · Cited by 264
Heat kernels on weighted manifolds and applications
Grigor′yan, A. (2006) · Contemporary Mathematics · doi:10.1090/conm/398/07486 · Cited by 194
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
Belkin, M. A., & Niyogi, P. (2005) · Lecture notes in computer science · doi:10.1007/11503415_33 · Cited by 174
Self-citationUsing Manifold Stucture for Partially Labeled Classification
Belkin, M., & Niyogi, P. (2002) · neural information processing systems · Cited by 151
Self-citationEmpirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
Evarist Gine, M., & Koltchinskii, V. I. (2006) · Institute of Mathematical Statistics eBooks · doi:10.1214/074921706000000888 · Cited by 130
Mémoli, F., & Sapiro, G. (2004) · Symposium on Geometry Processing · doi:10.1145/1057432.1057436 · Cited by 130
Problems of learning on manifolds
Niyogi, P., & Belkin, M. A. (2003) · Cited by 124
Self-citationBousquet, O., Chapelle, O., & Hein, M. (2003) · Cited by 112
do Carmo, M. P. (1992) · Mathematics: Theory & Applications, Birkhäuser · doi:10.1007/978-3-662-02883-0
Cited by
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2005.07.004 · Cited by 990
Learning Laplacian Matrix in Smooth Graph Signal Representations
Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2602809 · Cited by 640
Metadata
- Authors
- Belkin, M., & Niyogi, P.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2008-12
- Volume
- 74
- Issue
- 8
- Pages
- 1289-1308
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1989368986
- Cited by
- 464
- References
- 34
- FWCI
- 29.55
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.