| @@ -745,7 +745,7 @@ function [ rand_score, purity, p_triads, missing_nodes_mapping, removed_nodes] = | |||
| perm_vector = [perm_vector, missing_nodes_mapping(1,:)]; % add missing node as last indexes | |||
| remapped_data = original_data(perm_vector,perm_vector); % return original graph according to perm | |||
| out_data_p = out_data%(perm_vector,perm_vector); | |||
| graphs_out = sprintf('/Users/armin/Desktop/output/graphed_%d.mat', iter); | |||
| graphs_out = sprintf('../output/graphed_%d.mat', iter); | |||
| save(graphs_out, 'out_data_p', 'out_data', 'remapped_data', 'original_data'); | |||
| %sigal - return data only with missing nodes and their friends | |||
| % reduce size to improve GED calulation | |||
| @@ -824,7 +824,7 @@ function [ rand_score, purity, p_triads, missing_nodes_mapping, removed_nodes] = | |||
| temp_purity = 99; %Sigal 12.8.12 - add invalid value incase of exception | |||
| ddddd = 1; | |||
| end | |||
| clusters_out = sprintf('/Users/armin/Desktop/output/OUTp_%d.mat', iter); | |||
| clusters_out = sprintf('../output/OUTp_%d.mat', iter); | |||
| save(clusters_out, 'true_clustering', 'test_clustering'); | |||
| % save results | |||