![]() calculate ( validation_name, 'majority_vote', 'parent' ) name = validation_name + '_parent_majority_vote' det_arr. validation ) #A metric for connectedness validation_name = 'det_ratio' v. calculate ( validation_name, 'majority_vote', 'parent' ) name = validation_name + '_parent_majority_vote' sil_arr. validation ( dataObj, x ) #A compactness metric validation_name = 'silhouette' v. finish_majority_vote ( threshold = 0.5 ) c_MV_arr. ![]() cluster ( 'parent', 'kmeans', name, K, init = 'random', n_init = 1 ) if not i % modulo : x = c. cluster ( dataObj ) K = 10 numIterations = 40 c_MV_arr = fig_arr = modulo = 1 #if you want to calculate majority vote only ever other or few solutions, increase this number sil_arr = det_arr = num_clusters = for i in range ( 1, numIterations ): name = 'kmeans_' + str ( i ) c. ![]() # Build towards a majority voting that finds the two continuous partitions c = oe.
0 Comments
Leave a Reply. |