The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Semi-Supervised Dimensionality Reduction
Abstract
Dimensionality reduction is among the keys in mining high-dimensional data. This paper studies semi-supervised dimensionality reduction. In this setting, besides abundant unlabeled examples, domain knowledge in the form of pairwise constraints are available, which specifies whether a pair of instances belong to the same class (must-link constraints) or different classes (cannot-link constraints). We propose the SSDR algorithm, which can preserve the intrinsic structure of the unlabeled data as well as both the must-link and cannot-link constraints defined on the labeled examples in the projected low-dimensional space. The SSDR algorithm is efficient and has a closed form solution. Experiments on a broad range of data sets show that SSDR is superior to many established dimensionality reduction methods.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
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
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912
Semi-Supervised Learning Literature Survey
Zhu, X. (2005) · Minds at UW (University of Wisconsin) · Cited by 4,505
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
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
Distance Metric Learning with Application to Clustering with Side-Information
Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2002) · Cited by 2,700
Constrained K-means Clustering with Background Knowledge
Wagstaff, K. L., Cardie, C., Rogers, S., & Schrödl, S. (2001) · Cited by 2,469
A probabilistic framework for semi-supervised clustering
Basu, S., Bilenko, M., & Mooney, R. J. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014062 · Cited by 814
Learning a Mahalanobis Metric from Equivalence Constraints
Bar-Hillel, A., Hertz, T., Shental, N., & Weinshall, D. (2005) · Cited by 517
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
Computing Gaussian Mixture Models with EM Using Equivalence Constraints
Shental, N., Bar-Hillel, A., Hertz, T., & Weinshall, D. (2003) · Cited by 260
Efficient co-regularised least squares regression
Brefeld, U., Gärtner, T., Scheffer, T., et al. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143862 · Cited by 154
Learning with Constrained and Unlabelled Data
Lange, T., Law, M. H. C., Jain, A. K., & Buhmann, J. M. (2005) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2005.210 · Cited by 94
Cited by
Sparsity preserving projections with applications to face recognition
Qiao, L., Chen, S., & Tan, X. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2009.05.005 · Cited by 807
Self-citationA Survey of Optimization Methods From a Machine Learning Perspective
Sun, S., Cao, Z., Zhu, H., & Zhao, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2950779 · Cited by 789
Domain Invariant and Class Discriminative Feature Learning for Visual Domain Adaptation
Li, S., Song, S., Huang, G., Ding, Z., & Wu, C. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2839528 · Cited by 277
Semi-supervised local Fisher discriminant analysis for dimensionality reduction
Sugiyama, M., Idé, T., Nakajima, S., & Sese, J. (2010) · Machine Learning · doi:10.1007/s10994-009-5125-7 · Cited by 259
Metadata
- Authors
- Zhang, D., Zhou, Z.-H., & Chen, S.
- Venue
- Proceedings of the 2007 SIAM International Conference on Data Mining
- Published
- 2007-04-26
- Pages
- 629-634
- OpenAlex
- W1564277727
- Cited by
- 313
- References
- 17
- FWCI
- 18.34
- 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.