InayofuataMwongozo unaofuata
Waainishaji wa Bayes wasio na akili
Misingi
MUONGOZO wa Misingi
K-Nearest Neighbors (KNN) huainisha sehemu mpya ya data kwa kuangalia mifano ya karibu ya K na kupiga kura nyingi.
Sikiliza mwongozo huuInaonyeshwa na AI · ~2 min
It matters as one of the simplest, most intuitive algorithms in machine learning, requiring almost no training.
A KNN classifier stores labeled training examples and, for a query, finds K neighbors under a selected distance metric before combining their labels. A KNN regressor commonly aggregates neighboring numeric targets. It is instance-based rather than a compact parametric model, but fitting may still include feature scaling, index construction, or other preprocessing. Because distance uses every feature, fit scaling on training data so large-range features do not dominate. Brute-force search compares a query with many or all stored examples; KD trees, Ball trees, and approximate-neighbor indexes can accelerate suitable data and metrics. In high dimensions, distance may become less informative and tree indexes may offer little speedup. A small K can be sensitive to noise, while a larger K smooths local decisions. Validate the representation, metric, K, and search method on the intended workload.
Mifumo ya mapendekezo: kupendekeza filamu au bidhaa zinazofanana na zile ambazo mtumiaji tayari alipenda.
Utambuzi wa tarakimu ulioandikwa kwa mkono: kuainisha tarakimu kwa kuilinganisha na picha zinazofanana zaidi zenye lebo.
Usaidizi wa uchunguzi wa kimatibabu: kutabiri hali kulingana na wagonjwa walio na matokeo ya mtihani yanayofanana zaidi.
Utafutaji wa kimantiki: kurejesha upachikaji wa maandishi ulio karibu zaidi ili kujibu swali katika hifadhidata ya vekta.
Wazo la msingi la KNN, tafuta mifano inayofanana zaidi, huwezesha utafutaji wa vekta wa kisasa na kizazi kilichoboreshwa, ambapo mifumo huleta vekta za upachikaji zilizo karibu zaidi ili kusaga miundo mikubwa ya lugha. Takriban maktaba za ujirani kama vile FAISS na HNSW hufanya utafutaji wa mfanano wa mabilioni kuwa wa vitendo. Ingawa mara chache huwa kiainishi cha mwisho katika mabomba makubwa, kanuni ya ujirani wa karibu inafaa zaidi kuliko hapo awali kama uti wa mgongo wa utafutaji na mapendekezo ya kisemantiki.
Jarida halali
Hadithi tatu za AI zilizothibitishwa kila asubuhi ya wiki, zimetengenezwa kwa Kiingereza rahisi. Bila malipo daima, hakuna matangazo.
Barua pepe moja kila siku ya wiki. Jiondoe kwa bonyeza moja. Hatutauza au kushiriki anwani yako.
Jijaribu mwenyewe
Maoni ya haraka juu ya kila jibu, na cheti kinachoweza kushirikishwa na kitambulisho kinachoweza kuthibitishwa baada ya kupita kozi.
Changia elimu ya AI bila malipo. AI Understanding ni 501(c)(3) isiyo na faida — hakuna matangazo, hakuna kizuizi cha malipo, daima. Toa mchango
K-Nearest Neighbors (KNN) huainisha sehemu mpya ya data kwa kuangalia mifano ya karibu ya K na kupiga kura nyingi. Ni muhimu kama mojawapo ya algoriti rahisi na angavu zaidi katika kujifunza kwa mashine, inayohitaji karibu hakuna mafunzo.
KNN hupata K mifano iliyohifadhiwa karibu zaidi na inapeana darasa la kawaida kati yao (kwa rejista, inakadiria maadili yao).
KNN is instance-based rather than learning a compact parametric weight set; implementations can still preprocess or build search indexes at fit time.
Kwa sababu KNN inategemea umbali, kipengele cha masafa makubwa ambacho hakijapimwa kinaweza kuwalemea wengine, kwa hivyo vipengele kawaida hurekebishwa.
K ndogo huruhusu jirani mmoja mwenye kelele au aliyeandikwa vibaya kuamua tokeo, na kusababisha mpaka ulioporomoka, wa kupita kiasi.
A brute-force scan compares against stored points, while trees or approximate-neighbor indexes can accelerate some workloads depending on data and metric.
Endelea kujifunza
Miongozo zaidi imechaguliwa kwa mada hii
InayofuataMwongozo unaofuata
Waainishaji wa Bayes wasio na akili
Misingi