ScholarGate
Msaidizi
Machine learningMissing data

Uamiliishaji wa Matriki

Uamiliishaji wa Matriki ni mbinu ya kurejesha matriki yenye kiwango cha chini kutoka kwa sehemu ndogo, ambayo huenda imechaguliwa kwa nasibu, ya vipengele vyake. Ilianzishwa na Emmanuel Candès na Benjamin Recht mwaka 2009, inaunda upya tatizo kama upunguzaji wa kiwango cha nyuklia - kiigaji cha duara kwa upunguzaji wa kiwango - na inatoa dhamana za kinadharia kwamba urejeshaji kamili unaweza kufikiwa wakati vipengele vinapoonekana kwa nasibu kwa usawa na matriki inatimiza sharti la kutokuunganishwa.

Fungua katika MethodMindHivi karibuniVideoHivi karibuniDownload slides

Soma mbinu kamili

Kwa wanachama pekee

Ingia kwa akaunti ya bure ili kusoma sehemu hii.

Ingia

Method map

The neighbourhood of related methods — select a node to explore.

Vyanzo

  1. Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772. DOI: 10.1007/s10208-009-9045-5

Jinsi ya kunukuu ukurasa huu

ScholarGate. (2026, June 2). Low-Rank Matrix Completion. ScholarGate. https://scholargate.app/sw/machine-learning/matrix-completion

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.

Compare side by side

Imerejelewa na

ScholarGateMatrix Completion (Low-Rank Matrix Completion). Imepatikana 2026-06-15 kutoka https://scholargate.app/sw/machine-learning/matrix-completion · Seti ya data: https://doi.org/10.5281/zenodo.20539026