Label propagation through linear neighborhoods
The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Abstract
A novel semi-supervised learning approach is proposed based on a linear neighborhood model, which assumes that each data point can be linearly reconstructed from its neighborhood. Our algorithm, named Linear Neighborhood Propagation (LNP), can propagate the labels from the labeled points to the whole dataset using these linear neighborhoods with sufficient smoothness. We also derive an easy way to extend LNP to out-of-sample data. Promising experimental results are presented for synthetic data, digit and text classification tasks.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
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
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · neural information processing systems · Cited by 4,777
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 4,518
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
(2006) · Cited by 3,624
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736 · cited 1×
“It is straightforward to associate cluster assumption with the nonlinear dimensionality reduction methods developed in recent years (Roweis & Saul, 2000; Tenen-baum, 2000; Belkin & Niyogi, 2002), since the central idea of these methods is to construct a low dimensional global coordinate system for…”
MethodTransductive Inference for Text Classification using Support Vector Machines
Joachims, T. (1999) · Cited by 2,723
Learning from labeled and unlabeled data with label propagation
Zhu, X., & Ghahramani, Z. (2002) · Cited by 1,534
Learning from Labeled and Unlabeled Data using Graph Mincuts
Blum, A. L., & Chawla, S. (2018) · doi:10.1184/r1/6606860 · Cited by 928
Dimension Reduction by Local Principal Component Analysis
Kambhatla, N., & Leen, T. K. (1997) · Neural Computation · doi:10.1162/neco.1997.9.7.1493 · Cited by 717
Transductive learning via spectral graph partitioning
Joachims, T. (2003) · Cited by 633
Shahshahani, B. M., & Landgrebe, D. A. (1994) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/36.312897 · Cited by 575
Partially labeled classification with Markov Random Walks
Szummer, M., & Jaakkola, T. (2001) · Cited by 558
Regularization 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
Cluster Kernels for Semi-Supervised Learning
Chapelle, O., Weston, J., & Schölkopf, B. (2002) · Cited by 461
Belkin, M., Niyogi, P., & Sindhwani, V. (2005) · International Conference on Artificial Intelligence and Statistics · Cited by 328
A Mixture of Experts Classifier with Learning Based on Both Labelled and Unlabelled Data
Miller, D. J., & Uyar, H. S. (1996) · neural information processing systems · Cited by 292
Spectral Methods for Dimensionality Reduction
Saul, L. K., Weinberger, K. Q., Sha, F., Ham, J., & Lee, D. D. (2006) · Semi-Supervised Learning · doi:10.7551/mitpress/6173.003.0022 · Cited by 272
Semi-supervised Learning on Directed Graphs
Zhou, D., Hofmann, T., & Schölkopf, B. (2004) · Max Planck Institute for Plasma Physics · Cited by 198
Efficient Non-Parametric Function Induction in Semi-Supervised LearningPreprint
Bengio, Y., Delalleau, O., & Roux, N. L. (2004) · RePEc: Research Papers in Economics · Cited by 170
Learning from Labeled and Unlabeled Data Using Random Walks
Zhou, D., & Schölkopf, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28649-3_29 · Cited by 158
Semi-supervised Learning via Gaussian Processes
Lawrence, N. D., & Jordan, M. I. (2004) · neural information processing systems · Cited by 156
Proximity Graphs for Clustering and Manifold Learning
Zemel, R. S., & Carreira-Perpiñán, M. Á. (2004) · neural information processing systems · Cited by 147
Semi-supervised learning : from Gaussian fields to Gaussian processes
Zhu, X., Lafferty, J., & Ghahramani, Z. (1965) · KiltHub Repository · doi:10.1184/r1/6609434.v1 · Cited by 111
Nonlocal Estimation of Manifold Structure
Bengio, Y., Monperrus, M., & Larochelle, H. (2006) · Neural Computation · doi:10.1162/neco.2006.18.10.2509 · Cited by 50
Towards semi-supervised classification with Markov random fields
Zhu, X., Ghahramani, Z., & Lafferty, J. (2002) · Cambridge University Engineering Department Publications Database · Cited by 41
Cited by
A brief introduction to weakly supervised learning
Zhou, Z.-H. (2018) · National Science Review · doi:10.1093/nsr/nwx106 · Cited by 1,899
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
Discrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531
“Our approach is based on the label propagation [66], [67], which is a simple, yet efficient technique that advances known labels from labeled graph nodes along edges to unlabeled nodes.”
MethodDiscrete Signal Processing on Graphs: Frequency Analysis
Sandryhaila, A., & Moura, J. M. F. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2321121 · Cited by 879
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
Self-citation
Metadata
- Authors
- Wang, F., & Zhang, C.
- Venue
- Proceedings of the 23rd international conference on Machine learning - ICML '06
- Publisher
- ACM Press
- Published
- 2006
- Pages
- 985-992
- OpenAlex
- W2138388365
- Cited by
- 258
- References
- 36
- FWCI
- 14.41
- Type
- conference paper
- 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.