Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
了解KNN算法
Search
yafei002
January 08, 2017
Technology
170
0
Share
了解KNN算法
yafei002
January 08, 2017
More Decks by yafei002
See All by yafei002
了解人工神经网络
yafei002
1
220
了解朴素贝叶斯
yafei002
1
240
了解K-Means算法
yafei002
1
220
了解决策树和C4.5算法
yafei002
1
270
数据可视化之视觉感知与认知
yafei002
1
400
数据可视化之地理信息可视化
yafei002
1
400
数据可视化之层次和网络数据可视化(上)
yafei002
1
700
数据可视化之复杂高维多元数据的可视化(上)
yafei002
1
290
Data Visualization Introduction and History
yafei002
1
320
Other Decks in Technology
See All in Technology
はじめてのDatadog
kairim0
0
260
Mastering Ruby Box
tagomoris
3
140
実装は速くなった、レビューはどうする? ― 自身のレビューをAIで再現させるサーヴァントエンジニアリングのすゝめ / Implementation got faster. So what about reviews? — An invitation to Servant Engineering: Recreating your own code reviews with AI
nrslib
6
2.7k
Javaで学ぶSOLID原則
negima
1
270
Platform engineering for developers, architects & the rest of us (AI agents)
danielbryantuk
0
170
MIERUNE JCT 発表資料「宇宙から伊能忠敬ごっこ」
syuchimu
0
100
プラットフォームエンジニア ワークショップ/ platform-workshop
databricksjapan
0
170
Databricks における 生成AIガバナンスの実践
taka_aki
1
260
電子辞書Brainをネットに繋げてみた(自力編)
raspython3
0
420
トークン数だけでは測れない — Claude Code 組織展開の効果検証から学んだこと
makikub
0
110
GoとSIMDとWasmの今。
askua
3
470
Claude code Orchestra
ozakiomumkj
3
910
Featured
See All Featured
Game over? The fight for quality and originality in the time of robots
wayneb77
1
190
Chrome DevTools: State of the Union 2024 - Debugging React & Beyond
addyosmani
10
1.2k
How to build a perfect <img>
jonoalderson
1
5.6k
Practical Orchestrator
shlominoach
191
11k
Into the Great Unknown - MozCon
thekraken
41
2.5k
Making Projects Easy
brettharned
120
6.7k
Accessibility Awareness
sabderemane
1
130
Building Experiences: Design Systems, User Experience, and Full Site Editing
marktimemedia
0
520
Creating an realtime collaboration tool: Agile Flush - .NET Oxford
marcduiker
35
2.5k
Test your architecture with Archunit
thirion
1
2.3k
How To Stay Up To Date on Web Technology
chriscoyier
790
250k
A designer walks into a library…
pauljervisheath
211
24k
Transcript
了解KNN算法 yafei002
a a a a a a a a o o
o c o o o 给定N个训练样本, 无论什么类别,KNN算法识别离目标最近的k个邻居
a 当k=1时,在空间中每个样本确定一个区域,也就是Voronoi分区 e c b R1 R2 R3 R4
注意 • 对于二分类问题k选择为奇数 • k不能是类别数量的整数倍 • KNN算法的主要缺点是复杂度,它需要搜索所有的样本从而找到最近的邻居
THANKS