Njia ya Kuratibu Nasibu
Njia ya kuratibu nasibu hupunguza mwelekeo kwa kuzidisha data kwa matriksi nasibu, ikitegemea kauli ya Johnson-Lindenstrauss (1984), ambayo huhakikisha kuwa kuratibu katika pande za kutosha nasibu huhifadhi takriban umbali wote wa pande mbili. Tofauti na PCA haichambui data hata kidogo — kuratibu ni nasibu na haitegemei data — ikifanya iwe rahisi sana na inafaa kwa data yenye mwelekeo mwingi sana na mipangilio ya mtiririko au yenye kuhifadhi faragha.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Johnson, W. B., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26, 189–206. DOI: 10.1090/conm/026/737400 ↗
- Achlioptas, D. (2003). Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66(4), 671–687. DOI: 10.1016/S0022-0000(03)00025-4 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Random Projection (Johnson-Lindenstrauss Dimensionality Reduction). ScholarGate. https://scholargate.app/sw/machine-learning/random-projection
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Ufumbuzi wa Kina wa Kienyeji (LLE)Ujifunzaji wa Mashine↔ compare
- Uamiliishaji wa MatrikiUjifunzaji wa Mashine↔ compare
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →