A common procedure in data science and mathematics is building graphs/networks from a large collection of data points. I am interested in the constructing the adjacency matrix for the k-nearest neighbor graph of a collection of data points. Is there a library for this ?
I couldn’t find this on Graphs.jl or on NearestNeighbors.jl.
You won’t find methods that take as input data files. This is outside the scope of any graph package. What matrix are you referring to? The coordinates of the points? The adjacency matrix?
Please take the time to formulate your problem. After that, take the time to read through the docs of the above mentioned packages. If you have more specific questions, preferably with code, please ask, and we can try help.
The function NNTree(data, metric; leafsize, reorder)
does not do what I am looking for. It wouldn’t work for example, for huge data sets.
Did you actually read the documentation for NearestNeighbors.jl?