搜索资源列表
-
0下载：
Builds a nearest neighbor graph in a very short time.In many cases is faster than ANN library.
-
-
0下载：
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds
-
-
0下载：
关于metric learning的综述，涉及到许多的知识：SVM、kernel、SDP等-This paper surveys the field of distance
metric learning from a principle perspective, and includes a broad selection of recent work. In particular, distance metric learning is reviewed under different
-
-
0下载：
its a machine learning programme which uses k nearest neighbor algorithm, find the distances between the k features point and plots the graph.
-
-
0下载：
D MANUSC
Graph-optimized Locality Preserving Projections (GoLPP) algorithm [28]. GoLPP
integrated the graph construction and a specific dimensionality reduction process (i.e.
LPP) into a unified framework, which results in a simultaneous learni
-
