08-Jan-2022 10:28:09 test_nearest_test(): MATLAB/Octave version 9.8.0.1380330 (R2020a) Update 2 test_nearest() implements various nearest neighbor algorithms. M = 2, NR = 1000000, NS = 10 #1 time: 0.125, size = 10, i(1) = 367341 #2 time: 0.046, size = 10, i(1) = 367341 #3 time: 0.177, size = 10, i(1) = 367341 #4 time: 0.072, size = 10, i(1) = 367341 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.232, size = 10, i(1) = 367341 M = 2, NR = 100000, NS = 100 #1 time: 0.099, size = 100, i(1) = 8599 #2 time: 0.014, size = 100, i(1) = 8599 #3 time: 0.048, size = 100, i(1) = 8599 #4 time: 0.020, size = 100, i(1) = 8599 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.123, size = 100, i(1) = 8599 M = 2, NR = 10000, NS = 1000 #1 time: 0.071, size = 1000, i(1) = 7699 #2 time: 0.040, size = 1000, i(1) = 7699 #3 time: 0.073, size = 1000, i(1) = 7699 #4 time: 0.034, size = 1000, i(1) = 7699 #5 time: 0.249 (for Delaunay triangulation) #5 time: 0.006 (for Delaunay search) #5 time: 0.255, size = 1000, i(1) = 7699 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.134, size = 1000, i(1) = 7699 M = 2, NR = 1000, NS = 10000 #1 time: 0.071, size = 10000, i(1) = 434 #2 time: 0.033, size = 10000, i(1) = 434 #3 time: 0.078, size = 10000, i(1) = 434 #4 time: 0.041, size = 10000, i(1) = 434 #5 time: 0.015 (for Delaunay triangulation) #5 time: 0.006 (for Delaunay search) #5 time: 0.020, size = 10000, i(1) = 434 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.019, size = 10000, i(1) = 434 M = 2, NR = 100, NS = 100000 #1 time: 0.078, size = 100000, i(1) = 60 #2 time: 0.148, size = 100000, i(1) = 60 #3 time: 0.183, size = 100000, i(1) = 60 #4 time: 0.180, size = 100000, i(1) = 60 #5 time: 0.010 (for Delaunay triangulation) #5 time: 0.036 (for Delaunay search) #5 time: 0.047, size = 100000, i(1) = 60 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.041, size = 100000, i(1) = 60 M = 2, NR = 10, NS = 1000000 #1 time: 0.105, size = 1000000, i(1) = 4 #2 time: 1.243, size = 1000000, i(1) = 4 #3 time: 1.210, size = 1000000, i(1) = 4 #4 time: 1.527, size = 1000000, i(1) = 4 #5 time: 0.000 (for Delaunay triangulation) #5 time: 0.201 (for Delaunay search) #5 time: 0.201, size = 1000000, i(1) = 4 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.208, size = 1000000, i(1) = 4 M = 4, NR = 1000000, NS = 10 #1 time: 0.109, size = 10, i(1) = 196372 #2 time: 0.076, size = 10, i(1) = 196372 #3 time: 0.149, size = 10, i(1) = 196372 #4 time: 0.126, size = 10, i(1) = 196372 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.375, size = 10, i(1) = 196372 M = 4, NR = 100000, NS = 100 #1 time: 0.108, size = 100, i(1) = 37064 #2 time: 0.026, size = 100, i(1) = 37064 #3 time: 0.098, size = 100, i(1) = 37064 #4 time: 0.064, size = 100, i(1) = 37064 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.271, size = 100, i(1) = 37064 M = 4, NR = 10000, NS = 1000 #1 time: 0.107, size = 1000, i(1) = 7412 #2 time: 0.039, size = 1000, i(1) = 7412 #3 time: 0.069, size = 1000, i(1) = 7412 #4 time: 0.037, size = 1000, i(1) = 7412 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.182, size = 1000, i(1) = 7412 M = 4, NR = 1000, NS = 10000 #1 time: 0.108, size = 10000, i(1) = 653 #2 time: 0.054, size = 10000, i(1) = 653 #3 time: 0.114, size = 10000, i(1) = 653 #4 time: 0.065, size = 10000, i(1) = 653 #5 time: 0.205 (for Delaunay triangulation) #5 time: 0.020 (for Delaunay search) #5 time: 0.225, size = 10000, i(1) = 653 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.226, size = 10000, i(1) = 653 M = 4, NR = 100, NS = 100000 #1 time: 0.110, size = 100000, i(1) = 52 #2 time: 0.164, size = 100000, i(1) = 52 #3 time: 0.207, size = 100000, i(1) = 52 #4 time: 0.219, size = 100000, i(1) = 52 #5 time: 0.012 (for Delaunay triangulation) #5 time: 0.079 (for Delaunay search) #5 time: 0.091, size = 100000, i(1) = 52 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.092, size = 100000, i(1) = 52 M = 4, NR = 10, NS = 1000000 #1 time: 0.130, size = 1000000, i(1) = 5 #2 time: 1.260, size = 1000000, i(1) = 5 #3 time: 1.218, size = 1000000, i(1) = 5 #4 time: 1.591, size = 1000000, i(1) = 5 #5 time: 0.001 (for Delaunay triangulation) #5 time: 0.311 (for Delaunay search) #5 time: 0.312, size = 1000000, i(1) = 5 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.317, size = 1000000, i(1) = 5 M = 8, NR = 1000000, NS = 10 #1 time: 0.184, size = 10, i(1) = 80092 #2 time: 0.224, size = 10, i(1) = 80092 #3 time: 0.367, size = 10, i(1) = 80092 #4 time: 0.300, size = 10, i(1) = 80092 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 1.066, size = 10, i(1) = 80092 M = 8, NR = 100000, NS = 100 #1 time: 0.176, size = 100, i(1) = 80002 #2 time: 0.094, size = 100, i(1) = 80002 #3 time: 0.214, size = 100, i(1) = 80002 #4 time: 0.165, size = 100, i(1) = 80002 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.793, size = 100, i(1) = 80002 M = 8, NR = 10000, NS = 1000 #1 time: 0.182, size = 1000, i(1) = 1272 #2 time: 0.051, size = 1000, i(1) = 1272 #3 time: 0.076, size = 1000, i(1) = 1272 #4 time: 0.051, size = 1000, i(1) = 1272 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.243, size = 1000, i(1) = 1272 M = 8, NR = 1000, NS = 10000 #1 time: 0.166, size = 10000, i(1) = 357 #2 time: 0.089, size = 10000, i(1) = 357 #3 time: 0.182, size = 10000, i(1) = 357 #4 time: 0.101, size = 10000, i(1) = 357 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.588, size = 10000, i(1) = 357 M = 8, NR = 100, NS = 100000 #1 time: 0.172, size = 100000, i(1) = 6 #2 time: 0.195, size = 100000, i(1) = 6 #3 time: 0.250, size = 100000, i(1) = 6 #4 time: 0.256, size = 100000, i(1) = 6 #5 time: 4.535 (for Delaunay triangulation) #5 time: 0.285 (for Delaunay search) #5 time: 4.821, size = 100000, i(1) = 6 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 2.259, size = 100000, i(1) = 6 M = 8, NR = 10, NS = 1000000 #1 time: 0.200, size = 1000000, i(1) = 7 #2 time: 1.291, size = 1000000, i(1) = 7 #3 time: 1.269, size = 1000000, i(1) = 7 #4 time: 1.685, size = 1000000, i(1) = 7 #5 time: 0.000 (for Delaunay triangulation) #5 time: 0.446 (for Delaunay search) #5 time: 0.446, size = 1000000, i(1) = 7 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 12.767, size = 1000000, i(1) = 7 test_nearest_test(): Normal end of execution. 08-Jan-2022 10:28:55