---
id: wiki-2026-0508-nearest-neighbor-search
title: Nearest Neighbor Search
category: 10_Wiki/Topics
status: duplicate
canonical_id: wiki-2026-0508-k-nearest-neighbors-knn-canonical
duplicate_of: "[[K-Nearest-Neighbors-K-NN]]"
aliases: [Nearest Neighbor Search, NN Search, ANN]
source_trust_level: C
confidence_score: 0.5
verification_status: redirect
tags: [redirect, duplicate, knn, search]
raw_sources: []
last_reinforced: 2026-05-10
github_commit: pending
tech_stack: { language: none, framework: redirect }
---

# Nearest-Neighbor-Search → [[K-Nearest-Neighbors-K-NN]]

이 문서는 **중복(duplicate)** 입니다. 정식 문서로 이동하세요.

## 매 한 줄
- Nearest neighbor search는 k-NN 알고리즘과 통합 관리합니다.

## 매 핵심
- ANN(FAISS, HNSW, Annoy) 등 근사 검색은 canonical 문서의 "벡터 검색" 섹션에서 다룹니다.
- 본 redirect는 backlink 보존 용도.

## 🔗 Graph
- canonical: [[K-Nearest-Neighbors-K-NN]]
- 관련: [[Embeddings]], [[Distance-Metrics]]

## 🕓 Changelog
- 2026-05-08 Phase 1: duplicate detection.
- 2026-05-10 Manual cleanup: redirect 표준화.
