| perm_vector = [perm_vector, missing_nodes_mapping(1,:)]; % add missing node as last indexes | 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 | remapped_data = original_data(perm_vector,perm_vector); % return original graph according to perm | ||||
| out_data_p = out_data%(perm_vector,perm_vector); | 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'); | save(graphs_out, 'out_data_p', 'out_data', 'remapped_data', 'original_data'); | ||||
| %sigal - return data only with missing nodes and their friends | %sigal - return data only with missing nodes and their friends | ||||
| % reduce size to improve GED calulation | % reduce size to improve GED calulation | ||||
| temp_purity = 99; %Sigal 12.8.12 - add invalid value incase of exception | temp_purity = 99; %Sigal 12.8.12 - add invalid value incase of exception | ||||
| ddddd = 1; | ddddd = 1; | ||||
| end | 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(clusters_out, 'true_clustering', 'test_clustering'); | ||||
| % save results | % save results |