k-means 聚类算法 的朴素julia实现_julia_代码_下载

[{"title":"（ 36 个子文件 31.86MB ） k-means 聚类算法 的朴素julia实现_julia_代码_下载","children":[{"title":"kmeans-julia-master","children":[{"title":"benchmark","children":[{"title":"testcase9.txt <span style='color:#111;'> 3.48MB </span>","children":null,"spread":false},{"title":"clustering_testcase_generator.jl <span style='color:#111;'> 4.25KB </span>","children":null,"spread":false},{"title":"testcase8.txt <span style='color:#111;'> 1.40MB </span>","children":null,"spread":false},{"title":"init.jl <span style='color:#111;'> 459B </span>","children":null,"spread":false},{"title":"init_all_data.jl <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"testcase6.txt <span style='color:#111;'> 714.08KB </span>","children":null,"spread":false},{"title":"benchmark.jl <span style='color:#111;'> 2.88KB </span>","children":null,"spread":false},{"title":"testcase2.txt <span style='color:#111;'> 17.90KB </span>","children":null,"spread":false},{"title":"testcase1.txt <span style='color:#111;'> 3.60KB </span>","children":null,"spread":false},{"title":"adult.txt <span style='color:#111;'> 3.79MB </span>","children":null,"spread":false},{"title":"benchmarktypes.jl <span style='color:#111;'> 423B </span>","children":null,"spread":false},{"title":"testcase12.txt <span style='color:#111;'> 43.56MB </span>","children":null,"spread":false},{"title":"init_data.jl <span style='color:#111;'> 23B </span>","children":null,"spread":false},{"title":"adult_text.txt <span style='color:#111;'> 1.91MB </span>","children":null,"spread":false},{"title":"init_all.jl <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"testcase10.txt <span style='color:#111;'> 4.36MB </span>","children":null,"spread":false},{"title":"testcase3.txt <span style='color:#111;'> 89.36KB </span>","children":null,"spread":false},{"title":"testcase4.txt <span style='color:#111;'> 133.72KB </span>","children":null,"spread":false},{"title":"testcase5.txt <span style='color:#111;'> 178.08KB </span>","children":null,"spread":false},{"title":"testcase11.txt <span style='color:#111;'> 8.74MB </span>","children":null,"spread":false},{"title":"iris.txt <span style='color:#111;'> 8.97KB </span>","children":null,"spread":false},{"title":"testcase7.txt <span style='color:#111;'> 890.27KB </span>","children":null,"spread":false}],"spread":false},{"title":"test","children":[{"title":"run_benchmark.jl <span style='color:#111;'> 175B </span>","children":null,"spread":false}],"spread":true},{"title":"report.txt <span style='color:#111;'> 46.35KB </span>","children":null,"spread":false},{"title":"src","children":[{"title":"distributed_worker.jl <span style='color:#111;'> 1.66KB </span>","children":null,"spread":false},{"title":"shared_worker.jl <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"threaded_kmeans.jl <span style='color:#111;'> 2.70KB </span>","children":null,"spread":false},{"title":"serial_kmeans.jl <span style='color:#111;'> 1.83KB </span>","children":null,"spread":false},{"title":"distributed_kmeans.jl <span style='color:#111;'> 633B </span>","children":null,"spread":false},{"title":"shared_scheduler.jl <span style='color:#111;'> 3.51KB </span>","children":null,"spread":false},{"title":"distributed_scheduler.jl <span style='color:#111;'> 2.87KB </span>","children":null,"spread":false},{"title":"shared_kmeans.jl <span style='color:#111;'> 620B </span>","children":null,"spread":false},{"title":"worker.jl <span style='color:#111;'> 2.12KB </span>","children":null,"spread":false},{"title":"utils.jl <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false}],"spread":true},{"title":".gitignore <span style='color:#111;'> 649B </span>","children":null,"spread":false},{"title":".gitattributes <span style='color:#111;'> 378B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]