Semi-supervised local Fisher discriminant analysis for dimensionality reduction
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
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
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 · cited 1×
“The goal of dimensionality reduction is to obtain a low-dimensional representation of highdimensional data samples while preserving most of the ‘intrinsic information’ contained in the original data (Roweis and Saul 2000; Tenenbaum et al. 2000; Hinton and Salakhutdinov 2006).”
BackgroundIntroduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
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
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · neural information processing systems · Cited by 4,498
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., & Saul, L. K. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577078 · Cited by 4,044
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
(2006) · Cited by 3,624
Distance Metric Learning with Application to Clustering with Side-Information
Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2002) · neural information processing systems · Cited by 3,173
Neighbourhood Components Analysis
Goldberger, J., Hinton, G. E., Roweis, S. T., & Salakhutdinov, R. (2004) · neural information processing systems · Cited by 2,424
Regularized Discriminant Analysis
Friedman, J. H. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478752 · Cited by 2,421
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., Blitzer, J. C., & Saul, L. K. (2005) · neural information processing systems · Cited by 2,133
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16
Storkey, A. (2004) · neural information processing systems · Cited by 2,085
Self-Tuning Spectral Clustering
Zelnik‐Manor, L., & Perona, P. (2004) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,942
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
Improving predictive inference under covariate shift by weighting the log-likelihood function
Shimodaira, H. (2000) · Journal of Statistical Planning and Inference · doi:10.1016/s0378-3758(00)00115-4 · Cited by 1,678
Dataset Shift in Machine Learning
(2008) · doi:10.7551/mitpress/9780262170055.001.0001 · Cited by 1,553 · cited 1×
“Such a situation is referred to as covariate shift (Shimodaira, 2000; Quiñonero-Candela et al., 2009) and ordinary cross-validation is known to be significantly biased in such situations (Zadrozny, 2004), while importance-weighted cross-validation is unbiased under covariate shift (Sugiyama et al.”
BackgroundLearning to Classify Text Using Support Vector Machines
Joachims, T. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0907-3 · Cited by 1,366
Rätsch, G., Onoda, T., & Müller, K.-R. (2001) · Machine Learning · doi:10.1023/a:1007618119488 · Cited by 1,299
Covariate Shift Adaptation by Importance Weighted Cross Validation
Sugiyama, M., Krauledat, M., & Müller, K. (2007) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · doi:10.5555/1314498.1390324 · Cited by 1,227
Self-citationDiffusion Kernels on Graphs and Other Discrete Input Spaces
Kondor, R., & Lafferty, J. (2002) · International Conference on Machine Learning · Cited by 1,112
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
Demmel, J. W., Dongarra, J. J., Ruhe, A., van der Vorst, H. A., & Bai, Z. (1987) · Medical Entomology and Zoology · Cited by 1,102
Proceedings of the twenty-first international conference on Machine learning
Brodley, C. E. (2004) · Cited by 1,020
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Joachims, T. (2002) · Cited by 932
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Convolution Kernels for Natural Language
Collins, M., & Duffy, N. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0085 · Cited by 808
Learning and evaluating classifiers under sample selection bias
Zadrozny, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015425 · Cited by 800 · cited 1×
“, 2009) and ordinary cross-validation is known to be significantly biased in such situations (Zadrozny, 2004), while importance-weighted cross-validation is unbiased under covariate shift (Sugiyama et al.”
Semi-supervised Discriminant Analysis
Cai, D., He, X., & Han, J. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408856 · Cited by 758
Regression and the Moore-Penrose Pseudoinverse
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6167-3 · Cited by 718
Marginalized kernels between labeled graphs
Kashima, H., Tsuda, K., & Inokuchi, A. (2003) · Cited by 710
Dimensionality Reduction of Multimodal Labeled Data by Local Fisher Discriminant Analysis
SugiyamaMasashi (2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248694 · Cited by 703
Metric Learning by Collapsing Classes
Globerson, A., & Roweis, S. T. (2005) · Cited by 665
Regression and the Moore-Penrose Pseudoinverse.
Troskie, C. G., & Albert, A. (1975) · Journal of the American Statistical Association · doi:10.2307/2285416 · Cited by 620
A survey of kernels for structured data
Gärtner, T. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959248 · Cited by 452
Proceedings, Twentieth International Conference on Machine Learning
Fawcett, T. E., & Mishra, N. (2003) · AAAI Press eBooks · Cited by 374
Ye, J. (2005) · Cited by 353
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
Mika, S., Ratsch, G., Weston, J., Scholkopf, B., Smola, A., & Muller, K.-R. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195996 · Cited by 195
A unified framework for semi-supervised dimensionality reduction
Song, Y., Nie, F., Zhang, C., & Xiang, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.01.001 · Cited by 176
Proceedings of the Nineteenth International Conference on Machine Learning
Sammut, C., & Hoffmann, A. G. (2002) · Cited by 168
Semi-Supervised Local Fisher Discriminant Analysis for Dimensionality Reduction
Sugiyama, M., Idé, T., Nakajima, S., & Sese, J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-68125-0_30 · Cited by 43
Self-citation
Cited by
Ghamisi, P., Yokoya, N., Li, J., Liao, W., Liu, S., Plaza, J., Rasti, B., & Plaza, A. (2017) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2017.2762087 · Cited by 909
“It may not be easy, however, to specify the optimal parameter values in these and similar semisupervised techniques, as mentioned in [70] and [72].”
BackgroundMethodInfluentialLocal Linear Discriminant Analysis Framework Using Sample Neighbors
Fan, Z., Xu, Y., & Zhang, D. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2152852 · Cited by 198
“However, the approaches proposed in [32], [39]–[43] need to compute the affinity matrix in which each element is a distance between two data vectors, and need to perform an eigendecomposition of the matrix generated by the whole training set.”
BackgroundOverfitting in linear feature extraction for classification of high-dimensional image data
Liu, R., & Gillies, D. F. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2015.11.015 · Cited by 123
Metadata
- Authors
- Sugiyama, M., Idé, T., Nakajima, S., & Sese, J.
- Venue
- Machine Learning
- Published
- 2009-07-11
- Volume
- 78
- Issue
- 1-2
- Pages
- 35-61
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1969204685
- Cited by
- 259
- References
- 54
- FWCI
- 17.22
- 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.