losmib opened a new pull request #1513: URL: https://github.com/apache/systemds/pull/1513
This patch adds a built-in function for constructing knn graph matrix. The algorithm first calculates all the distances between neighbors and constructs the distance matrix using the built-in function dist. Then for each row in this matrix, it finds the kth smallest distance for reference using quickselect and then puts 0 in the graph for all distances greater than this reference and 1 for distances smaller than the reference. This approach has the smallest expected asymptotic runtime O(N^2). -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
