k-NN
k-NN is a algorithm in the machine learning family. This learning algorithm turns examples/data into a rule, grouping or prediction based on a distance, objective or simple model.
이 멘탈 모델부터 시작하세요
k-NN is a algorithm in the machine learning family. This learning algorithm turns examples/data into a rule, grouping or prediction based on a distance, objective or simple model.
불필요한 전문용어 없이 동작 방식 이해하기
k-NN should be understood through its invariant and the state it changes at each step.
The practical complexity in this reading is query O(n·d) naive; always connect that cost to the actual loops, recursion, data structure operations or input assumptions.
알고리즘을 연속된 의사결정으로 읽기
Define features and scaling.
Run the model-specific update/search rule.
Evaluate with an appropriate metric and separate training from evaluation data.
Read a tiny input by hand and write down the state after every important operation. For k-NN, the goal is to make the invariant visible rather than to memorize code.
query O(n·d) naive
Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.
적합한 경우
- Use it when the model assumptions match the data and evaluation objective.
보통 어디에서 문제가 생기는가
- Ignoring feature scaling.
- Evaluating on training data only.
- Treating a toy implementation as production ML infrastructure.
전문적인 답변 구조
A strong interview explanation of k-NN should cover the problem it solves, its invariant, the important data structure/state, its query O(n·d) naive cost, and the constraint that would make you choose a different approach.
What problem does k-NN solve?
k-NN is a algorithm in the machine learning family. This learning algorithm turns examples/data into a rule, grouping or prediction based on a distance, objective or simple model.
복잡도에 대해 무엇을 언급해야 하나요?
Its typical cost here is query O(n·d) naive, but a complete answer should connect that cost to the representation, input constraints and the dominant operations.
가장 흔한 실수는 무엇인가요?
Ignoring feature scaling.