The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Spectral Methods for Dimensionality Reduction
Abstract
How can we search for low dimensional structure in high dimensional data? If the data is mainly confined to a low dimensional subspace, then simple linear methods can be used to discover the subspace and estimate its dimensionality. More generally, though, if the data lies on (or near) a low dimensional submanifold, then its structure may be highly nonlinear, and linear methods are bound to fail. Spectral methods have recently emerged as a powerful tool for nonlinear dimensionality reduction and manifold learning. These methods are able to reveal low dimensional structure in high dimensional data from the top or bottom eigenvectors of specially constructed matrices. To analyze data that lies on a low dimensional submanifold, the matrices are constructed from sparse weighted graphs whose vertices represent input patterns and whose edges indicate neighborhood relations. The main computations for manifold learning are based on tractable, polynomial-time optimizations, such as shortest path problems, least squares fits, semidefinite programming, and matrix diagonalization. This chapter provides an overview of unsupervised learning algorithms that can be viewed as spectral methods for linear and nonlinear dimensionality reduction.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Self-citationJolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
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
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
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
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
Zhang, Z., & Zha, H. (2004) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502419154 · Cited by 1,479
Cover trees for nearest neighbor
Beygelzimer, A., Kakade, S., & Langford, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143857 · Cited by 813
Unsupervised Learning of Image Manifolds by Semidefinite Programming
Weinberger, K. Q., & Saul, L. K. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-4939-z · Cited by 692
Self-citationRegularization and Semi-supervised Learning on Large Graphs
Belkin, M., Matveeva, I., & Niyogi, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27819-1_43 · Cited by 536
A kernel view of the dimensionality reduction of manifolds
Ham, J., Lee, D. D., Mika, S., & Schölkopf, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015417 · Cited by 532
Self-citationOn a connection between kernel PCA and metric multidimensional scaling
Williams, C. K. I. (2002) · Machine Learning · doi:10.1023/a:1012485807823 · Cited by 206
Nonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization.
Weinberger, K. Q., Packer, B., & Saul, L. K. (2005) · International Conference on Artificial Intelligence and Statistics · Cited by 183
Self-citationAnalysis and extension of spectral methods for nonlinear dimensionality reduction
Sha, F., & Saul, L. K. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102450 · Cited by 106
Self-citationGeometric Methods for Feature Extraction and Dimensional Reduction
Burges, C. J. C. (2006) · Springer eBooks · doi:10.1007/0-387-25465-x_4 · Cited by 88
Cited by
Introduction to Semi-Supervised Learning
Zhu, X., & Goldberg, A. B. (2009) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01548-9 · Cited by 1,766
Label Propagation through Linear Neighborhoods
Wang, F., & Zhang, C. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190672 · Cited by 690
Randomized Algorithms for Matrices and Data
MAHONEY, M. (2012) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/b11822-37 · Cited by 409
Patch Alignment for Dimensionality Reduction
Zhang, T., Tao, D., Li, X., & Yang, J. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.212 · Cited by 381
Semi-Supervised Dimensionality Reduction
Zhang, D., Zhou, Z.-H., & Chen, S. (2007) · Proceedings of the 2007 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.73 · Cited by 313
Metadata
- Authors
- Saul, L. K., Weinberger, K. Q., Sha, F., Ham, J., & Lee, D. D.
- Venue
- Semi-Supervised Learning
- Publisher
- The MIT Press
- Published
- 2006-09-22
- Pages
- 293-308
- OpenAlex
- W1568794265
- Cited by
- 272
- References
- 18
- FWCI
- 48.51
- Type
- book chapter
- Language
- en
- Open access
- closed
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.