Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 |
Tags
- 맥실리콘
- BOJ
- MIT
- CNNarchitecture
- arm칩에안드로이드
- CNN구조정리
- 맥북원스토어
- Algorithm
- gpumemory
- CS231nAssignment1
- 선대
- 아이폰원스토어
- monoculardepthestimation
- CS231n
- CS231nAssignments
- RegionProposalNetworks
- pycharmerror
- Gilbert Strang
- 백준
- BAEKJOON
- Linear algebra
- CS231nSVM
- adversarialattackonmonoculardepthestimation
- 선형대수학
- ㅐㅕ세ㅕㅅ
- MacOS
- 백준알고리즘
- CS231ntwolayerneuralnet
- ios원스토어
- professor strang
Archives
- Today
- Total
목록KNeareastNeighbors (1)
개발로 하는 개발
[CS231n] Assignment 1 - KNN
- KNN ( K nearest neighbor) hyperparameter : k, L1 or L2 (distance calculating formula) Basically, you are trying to figure out which dot belongs to what region. And you are determining this by calculating the distance between the test point and train points. You get the value of k nearest points, and decide whichever the majority is. There are two ways to calculate this. L1 and L2. in the assig..
Study
2023. 5. 3. 14:57