06-Jun-2023 18:45:57 test_nearest_test(): MATLAB/Octave version 5.2.0 test_nearest() implements various nearest neighbor algorithms. M = 2, NR = 100000, NS = 10 #1 time: 21.346, size = 10, i(1) = 76149 #2 time: 0.026, size = 10, i(1) = 76149 #3 time: 0.016, size = 10, i(1) = 76149 #4 time: 0.004, size = 10, i(1) = 76149 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 8.762, size = 10, i(1) = 76149 M = 2, NR = 10000, NS = 100 #1 time: 21.320, size = 100, i(1) = 1371 #2 time: 0.035, size = 100, i(1) = 1371 #3 time: 0.012, size = 100, i(1) = 1371 #4 time: 0.003, size = 100, i(1) = 1371 #5 time: 0.045 (for Delaunay triangulation) #5 time: 0.003 (for Delaunay search) #5 time: 0.048, size = 100, i(1) = 1371 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 8.760, size = 100, i(1) = 1371 M = 2, NR = 1000, NS = 1000 #1 time: 21.882, size = 1000, i(1) = 471 #2 time: 0.180, size = 1000, i(1) = 471 #3 time: 0.033, size = 1000, i(1) = 471 #4 time: 0.003, size = 1000, i(1) = 471 #5 time: 0.004 (for Delaunay triangulation) #5 time: 0.003 (for Delaunay search) #5 time: 0.007, size = 1000, i(1) = 471 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.007, size = 1000, i(1) = 471 M = 2, NR = 100, NS = 10000 #1 time: 22.120, size = 10000, i(1) = 3 #2 time: 1.616, size = 10000, i(1) = 3 #3 time: 0.242, size = 10000, i(1) = 3 #4 time: 0.004, size = 10000, i(1) = 3 #5 time: 0.001 (for Delaunay triangulation) #5 time: 0.004 (for Delaunay search) #5 time: 0.005, size = 10000, i(1) = 3 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.005, size = 10000, i(1) = 3 M = 2, NR = 10, NS = 100000 #1 time: 23.465, size = 100000, i(1) = 5 #2 time: 15.936, size = 100000, i(1) = 5 #3 time: 2.271, size = 100000, i(1) = 5 #4 time: 0.009, size = 100000, i(1) = 5 #5 time: 0.001 (for Delaunay triangulation) #5 time: 0.008 (for Delaunay search) #5 time: 0.008, size = 100000, i(1) = 5 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.009, size = 100000, i(1) = 5 M = 4, NR = 100000, NS = 10 #1 time: 39.274, size = 10, i(1) = 85579 #2 time: 0.031, size = 10, i(1) = 85579 #3 time: 0.023, size = 10, i(1) = 85579 #4 time: 0.007, size = 10, i(1) = 85579 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 8.797, size = 10, i(1) = 85579 M = 4, NR = 10000, NS = 100 #1 time: 39.192, size = 100, i(1) = 2705 #2 time: 0.039, size = 100, i(1) = 2705 #3 time: 0.017, size = 100, i(1) = 2705 #4 time: 0.003, size = 100, i(1) = 2705 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 8.763, size = 100, i(1) = 2705 M = 4, NR = 1000, NS = 1000 #1 time: 40.278, size = 1000, i(1) = 115 #2 time: 0.182, size = 1000, i(1) = 115 #3 time: 0.037, size = 1000, i(1) = 115 #4 time: 0.003, size = 1000, i(1) = 115 #5 time: 1.583 (for Delaunay triangulation) #5 time: 0.004 (for Delaunay search) #5 time: 1.587, size = 1000, i(1) = 115 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 9.048, size = 1000, i(1) = 115 M = 4, NR = 100, NS = 10000 #1 time: 40.498, size = 10000, i(1) = 22 #2 time: 1.612, size = 10000, i(1) = 22 #3 time: 0.248, size = 10000, i(1) = 22 #4 time: 0.005, size = 10000, i(1) = 22 #5 time: 0.100 (for Delaunay triangulation) #5 time: 0.005 (for Delaunay search) #5 time: 0.105, size = 10000, i(1) = 22 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.104, size = 10000, i(1) = 22 M = 4, NR = 10, NS = 100000 #1 time: 41.840, size = 100000, i(1) = 3 #2 time: 15.889, size = 100000, i(1) = 3 #3 time: 2.275, size = 100000, i(1) = 3 #4 time: 0.012, size = 100000, i(1) = 3 #5 time: 0.002 (for Delaunay triangulation) #5 time: 0.010 (for Delaunay search) #5 time: 0.011, size = 100000, i(1) = 3 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 0.013, size = 100000, i(1) = 3 M = 8, NR = 100000, NS = 10 #1 time: 75.090, size = 10, i(1) = 41940 #2 time: 0.047, size = 10, i(1) = 41940 #3 time: 0.045, size = 10, i(1) = 41940 #4 time: 0.011, size = 10, i(1) = 41940 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 8.855, size = 10, i(1) = 41940 M = 8, NR = 10000, NS = 100 #1 time: 75.182, size = 100, i(1) = 8714 #2 time: 0.047, size = 100, i(1) = 8714 #3 time: 0.028, size = 100, i(1) = 8714 #4 time: 0.005, size = 100, i(1) = 8714 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 8.804, size = 100, i(1) = 8714 M = 8, NR = 1000, NS = 1000 #1 time: 77.216, size = 1000, i(1) = 136 #2 time: 0.188, size = 1000, i(1) = 136 #3 time: 0.047, size = 1000, i(1) = 136 #4 time: 0.005, size = 1000, i(1) = 136 #5 skipped! #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 9.108, size = 1000, i(1) = 136 M = 8, NR = 100, NS = 10000 #1 time: 77.489, size = 10000, i(1) = 67 #2 time: 1.622, size = 10000, i(1) = 67 #3 time: 0.255, size = 10000, i(1) = 67 #4 time: 0.007, size = 10000, i(1) = 67 #5 time: 16.324 (for Delaunay triangulation) #5 time: 0.007 (for Delaunay search) #5 time: 16.331, size = 10000, i(1) = 67 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 11.587, size = 10000, i(1) = 67 M = 8, NR = 10, NS = 100000 #1 time: 78.985, size = 100000, i(1) = 10 #2 time: 15.918, size = 100000, i(1) = 10 #3 time: 2.282, size = 100000, i(1) = 10 #4 time: 0.018, size = 100000, i(1) = 10 #5 time: 0.002 (for Delaunay triangulation) #5 time: 0.015 (for Delaunay search) #5 time: 0.017, size = 100000, i(1) = 10 #6 CANCELLED, knnsearch requires Statistics and Machine Learning Toolbox #7 time: 30.693, size = 100000, i(1) = 10 test_nearest_test(): Normal end of execution. 06-Jun-2023 19:00:45