방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 자기 지도 학습 지원 벡터 머신× | Kernel PCA× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열≠ | Machine learning | Latent structure |
| 기원 연도≠ | 2019–2021 | 1998 |
| 창시자≠ | Various (integration of self-supervised learning with SVM classifiers, ~2019–2021) | Schölkopf, B.; Smola, A. J.; Müller, K.-R. |
| 유형≠ | Hybrid (self-supervised pretraining + SVM classifier) | Nonlinear dimensionality reduction via kernel trick |
| 원전≠ | De Palma, A., Bucarelli, M. S., Goyal, P., & Silvestri, F. (2021). Self-supervised Support Vector Machine. Proceedings of the AAAI Workshop on Self-Supervised Learning for the Internet of Things. link ↗ | Schölkopf, B., Smola, A. J., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299–1319. DOI ↗ |
| 별칭 | Self-supervised SVM, SS-SVM, semi-self-supervised SVM, self-supervised kernel SVM | KPCA, kernel PCA, nonlinear PCA via kernel trick, kernel eigenvalue decomposition |
| 관련 | 5 | 5 |
| 요약≠ | A Self-supervised Support Vector Machine combines self-supervised pretraining — learning representations from unlabeled data via pretext tasks — with a Support Vector Machine classifier trained on the resulting features. This hybrid approach enables strong classification performance even when labeled data is scarce, by leveraging the structure embedded in large unlabeled datasets before applying the SVM's margin-maximization objective. | Kernel Principal Component Analysis (Kernel PCA) is a nonlinear dimensionality-reduction method introduced by Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller in 1997–1998. It extends classical linear PCA to curved, non-linear data manifolds by implicitly mapping input data into a high-dimensional feature space via a kernel function, then performing standard PCA in that space — all without ever computing the mapping explicitly. |
| ScholarGate데이터셋 ↗ |
|
|