Random Projection
Random projection reduces dimensionality by multiplying the data by a random matrix, relying on the Johnson-Lindenstrauss lemma (1984), which guarantees that projecting onto enough random directions approximately preserves all pairwise distances. Unlike PCA it does not analyze the data at all — the projection is random and data-oblivious — making it extremely cheap and well suited to very high-dimensional data and streaming or privacy-sensitive settings.
Rekodi ya chanzo
Nukuu zimehamishwa kwa uhalisi kutoka kwa rekodi ya chanzo cha mbinu. Hakuna uthibitisho wa kiwango cha dai unaodokezwa kutoka kwao.
- 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
Madai yaliyotunzwa
Madai yamehifadhiwa katika daftari la ushahidi, kila moja ikiwa na tathmini yake.
Mwonekano huu haubuni tathmini ya dai wakati daftari haina yoyote.
Mbinu zinazohusiana
Zilizotengenezwa kutoka kwa grafu ya mbinu na kuonyeshwa kama uhusiano uliopendekezwa na mashine — hakuna dai la ushahidi linalodokezwa.