|
|
@ -21,28 +21,35 @@ class StructureEstimator: |
|
|
|
""" |
|
|
|
""" |
|
|
|
Has the task of estimating the network structure given the trajectories in samplepath. |
|
|
|
Has the task of estimating the network structure given the trajectories in samplepath. |
|
|
|
|
|
|
|
|
|
|
|
:sample_path: the sample_path object containing the trajectories and the real structure |
|
|
|
:_sample_path: the _sample_path object containing the trajectories and the real structure |
|
|
|
:exp_test_sign: the significance level for the exponential Hp test |
|
|
|
:_exp_test_sign: the significance level for the exponential Hp test |
|
|
|
:chi_test_alfa: the significance level for the chi Hp test |
|
|
|
:_chi_test_alfa: the significance level for the chi Hp test |
|
|
|
|
|
|
|
|
|
|
|
:nodes: the nodes labels |
|
|
|
:_nodes: the _nodes labels |
|
|
|
:nodes_vals: the nodes cardinalities |
|
|
|
:_nodes_vals: the nodes cardinalities |
|
|
|
:nodes_indxs: the nodes indexes |
|
|
|
:_nodes_indxs: the nodes indexes |
|
|
|
:complete_graph: the complete directed graph built using the nodes labels in nodes |
|
|
|
:_complete_graph: the complete directed graph built using the nodes labels in nodes |
|
|
|
:cache: the cache object |
|
|
|
:_cache: the _cache object |
|
|
|
""" |
|
|
|
""" |
|
|
|
|
|
|
|
|
|
|
|
def __init__(self, sample_path: sp.SamplePath, exp_test_alfa: float, chi_test_alfa: float): |
|
|
|
def __init__(self, sample_path: sp.SamplePath, exp_test_alfa: float, chi_test_alfa: float): |
|
|
|
self.sample_path = sample_path |
|
|
|
""" |
|
|
|
self.nodes = np.array(self.sample_path.structure.nodes_labels) |
|
|
|
Parameters: |
|
|
|
self.nodes_vals = self.sample_path.structure.nodes_values |
|
|
|
:_sample_path: the _sample_path object containing the trajectories and the real structure |
|
|
|
self.nodes_indxs = self.sample_path.structure.nodes_indexes |
|
|
|
:_exp_test_sign: the significance level for the exponential Hp test |
|
|
|
self.complete_graph = self.build_complete_graph(self.sample_path.structure.nodes_labels) |
|
|
|
:_chi_test_alfa: the significance level for the chi Hp test |
|
|
|
self.exp_test_sign = exp_test_alfa |
|
|
|
|
|
|
|
self.chi_test_alfa = chi_test_alfa |
|
|
|
|
|
|
|
self.cache = ch.Cache() |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def build_complete_graph(self, node_ids: typing.List): |
|
|
|
""" |
|
|
|
|
|
|
|
self._sample_path = sample_path |
|
|
|
|
|
|
|
self._nodes = np.array(self._sample_path.structure.nodes_labels) |
|
|
|
|
|
|
|
self._nodes_vals = self._sample_path.structure.nodes_values |
|
|
|
|
|
|
|
self._nodes_indxs = self._sample_path.structure.nodes_indexes |
|
|
|
|
|
|
|
self._complete_graph = self.build_complete_graph(self._sample_path.structure.nodes_labels) |
|
|
|
|
|
|
|
self._exp_test_sign = exp_test_alfa |
|
|
|
|
|
|
|
self._chi_test_alfa = chi_test_alfa |
|
|
|
|
|
|
|
self._cache = ch.Cache() |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def build_complete_graph(self, node_ids: typing.List) -> nx.DiGraph: |
|
|
|
""" |
|
|
|
""" |
|
|
|
Builds a complete directed graph (no self loops) given the nodes labels in the list node_ids: |
|
|
|
Builds a complete directed graph (no self loops) given the nodes labels in the list node_ids: |
|
|
|
|
|
|
|
|
|
|
@ -57,9 +64,9 @@ class StructureEstimator: |
|
|
|
return complete_graph |
|
|
|
return complete_graph |
|
|
|
|
|
|
|
|
|
|
|
def complete_test(self, test_parent: str, test_child: str, parent_set: typing.List, child_states_numb: int, |
|
|
|
def complete_test(self, test_parent: str, test_child: str, parent_set: typing.List, child_states_numb: int, |
|
|
|
tot_vars_count: int): |
|
|
|
tot_vars_count: int) -> bool: |
|
|
|
""" |
|
|
|
""" |
|
|
|
Permorms a complete independence test on the directed graphs G1 = test_child U parent_set |
|
|
|
Performs a complete independence test on the directed graphs G1 = test_child U parent_set |
|
|
|
G2 = G1 U test_parent (added as an additional parent of the test_child). |
|
|
|
G2 = G1 U test_parent (added as an additional parent of the test_child). |
|
|
|
Generates all the necessary structures and datas to perform the tests. |
|
|
|
Generates all the necessary structures and datas to perform the tests. |
|
|
|
|
|
|
|
|
|
|
@ -68,98 +75,61 @@ class StructureEstimator: |
|
|
|
test_child: the node label of the child |
|
|
|
test_child: the node label of the child |
|
|
|
parent_set: the common parent set |
|
|
|
parent_set: the common parent set |
|
|
|
child_states_numb: the cardinality of the test_child |
|
|
|
child_states_numb: the cardinality of the test_child |
|
|
|
tot_vars_count_ the total number of variables in the net |
|
|
|
tot_vars_count: the total number of variables in the net |
|
|
|
Returns: |
|
|
|
Returns: |
|
|
|
True iff test_child and test_parent are independent given the sep_set parent_set |
|
|
|
True iff test_child and test_parent are independent given the sep_set parent_set |
|
|
|
False otherwise |
|
|
|
False otherwise |
|
|
|
""" |
|
|
|
""" |
|
|
|
#print("Test Parent:", test_parent) |
|
|
|
|
|
|
|
#print("Sep Set", parent_set) |
|
|
|
|
|
|
|
p_set = parent_set[:] |
|
|
|
p_set = parent_set[:] |
|
|
|
complete_info = parent_set[:] |
|
|
|
complete_info = parent_set[:] |
|
|
|
complete_info.append(test_child) |
|
|
|
complete_info.append(test_child) |
|
|
|
|
|
|
|
|
|
|
|
parents = np.array(parent_set) |
|
|
|
parents = np.array(parent_set) |
|
|
|
parents = np.append(parents, test_parent) |
|
|
|
parents = np.append(parents, test_parent) |
|
|
|
#print("PARENTS", parents) |
|
|
|
sorted_parents = self._nodes[np.isin(self._nodes, parents)] |
|
|
|
#parents.sort() |
|
|
|
|
|
|
|
sorted_parents = self.nodes[np.isin(self.nodes, parents)] |
|
|
|
|
|
|
|
#print("SORTED PARENTS", sorted_parents) |
|
|
|
|
|
|
|
cims_filter = sorted_parents != test_parent |
|
|
|
cims_filter = sorted_parents != test_parent |
|
|
|
#print("PARENTS NO FROM MASK", cims_filter) |
|
|
|
sofc1 = self._cache.find(set(p_set)) |
|
|
|
#if not p_set: |
|
|
|
|
|
|
|
#print("EMPTY PSET TRYING TO FIND", test_child) |
|
|
|
|
|
|
|
#sofc1 = self.cache.find(test_child) |
|
|
|
|
|
|
|
#else: |
|
|
|
|
|
|
|
sofc1 = self.cache.find(set(p_set)) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if not sofc1: |
|
|
|
if not sofc1: |
|
|
|
#print("CACHE MISSS SOFC1") |
|
|
|
bool_mask1 = np.isin(self._nodes, complete_info) |
|
|
|
bool_mask1 = np.isin(self.nodes,complete_info) |
|
|
|
l1 = list(self._nodes[bool_mask1]) |
|
|
|
#print("Bool mask 1", bool_mask1) |
|
|
|
indxs1 = self._nodes_indxs[bool_mask1] |
|
|
|
l1 = list(self.nodes[bool_mask1]) |
|
|
|
vals1 = self._nodes_vals[bool_mask1] |
|
|
|
#print("L1", l1) |
|
|
|
|
|
|
|
indxs1 = self.nodes_indxs[bool_mask1] |
|
|
|
|
|
|
|
#print("INDXS 1", indxs1) |
|
|
|
|
|
|
|
vals1 = self.nodes_vals[bool_mask1] |
|
|
|
|
|
|
|
eds1 = list(itertools.product(parent_set,test_child)) |
|
|
|
eds1 = list(itertools.product(parent_set,test_child)) |
|
|
|
s1 = st.Structure(l1, indxs1, vals1, eds1, tot_vars_count) |
|
|
|
s1 = st.Structure(l1, indxs1, vals1, eds1, tot_vars_count) |
|
|
|
g1 = ng.NetworkGraph(s1) |
|
|
|
g1 = ng.NetworkGraph(s1) |
|
|
|
g1.fast_init(test_child) |
|
|
|
g1.fast_init(test_child) |
|
|
|
p1 = pe.ParametersEstimator(self.sample_path, g1) |
|
|
|
p1 = pe.ParametersEstimator(self._sample_path.trajectories, g1) |
|
|
|
p1.fast_init(test_child) |
|
|
|
p1.fast_init(test_child) |
|
|
|
sofc1 = p1.compute_parameters_for_node(test_child) |
|
|
|
sofc1 = p1.compute_parameters_for_node(test_child) |
|
|
|
#if not p_set: |
|
|
|
self._cache.put(set(p_set), sofc1) |
|
|
|
#self.cache.put(test_child, sofc1) |
|
|
|
|
|
|
|
#else: |
|
|
|
|
|
|
|
self.cache.put(set(p_set), sofc1) |
|
|
|
|
|
|
|
sofc2 = None |
|
|
|
sofc2 = None |
|
|
|
#p_set.append(test_parent) |
|
|
|
|
|
|
|
p_set.insert(0, test_parent) |
|
|
|
p_set.insert(0, test_parent) |
|
|
|
if p_set: |
|
|
|
if p_set: |
|
|
|
#print("FULL PSET TRYING TO FIND", p_set) |
|
|
|
sofc2 = self._cache.find(set(p_set)) |
|
|
|
#p_set.append(test_parent) |
|
|
|
|
|
|
|
#print("PSET ", p_set) |
|
|
|
|
|
|
|
#set_p_set = set(p_set) |
|
|
|
|
|
|
|
sofc2 = self.cache.find(set(p_set)) |
|
|
|
|
|
|
|
#if sofc2: |
|
|
|
|
|
|
|
#print("Sofc2 in CACHE ", sofc2.actual_cims) |
|
|
|
|
|
|
|
#print(self.cache.list_of_sets_of_indxs) |
|
|
|
|
|
|
|
if not sofc2: |
|
|
|
if not sofc2: |
|
|
|
#print("Cache MISSS SOFC2") |
|
|
|
|
|
|
|
complete_info.append(test_parent) |
|
|
|
complete_info.append(test_parent) |
|
|
|
bool_mask2 = np.isin(self.nodes, complete_info) |
|
|
|
bool_mask2 = np.isin(self._nodes, complete_info) |
|
|
|
#print("BOOL MASK 2",bool_mask2) |
|
|
|
l2 = list(self._nodes[bool_mask2]) |
|
|
|
l2 = list(self.nodes[bool_mask2]) |
|
|
|
indxs2 = self._nodes_indxs[bool_mask2] |
|
|
|
#print("L2", l2) |
|
|
|
vals2 = self._nodes_vals[bool_mask2] |
|
|
|
indxs2 = self.nodes_indxs[bool_mask2] |
|
|
|
|
|
|
|
#print("INDXS 2", indxs2) |
|
|
|
|
|
|
|
vals2 = self.nodes_vals[bool_mask2] |
|
|
|
|
|
|
|
eds2 = list(itertools.product(p_set, test_child)) |
|
|
|
eds2 = list(itertools.product(p_set, test_child)) |
|
|
|
s2 = st.Structure(l2, indxs2, vals2, eds2, tot_vars_count) |
|
|
|
s2 = st.Structure(l2, indxs2, vals2, eds2, tot_vars_count) |
|
|
|
g2 = ng.NetworkGraph(s2) |
|
|
|
g2 = ng.NetworkGraph(s2) |
|
|
|
g2.fast_init(test_child) |
|
|
|
g2.fast_init(test_child) |
|
|
|
p2 = pe.ParametersEstimator(self.sample_path, g2) |
|
|
|
p2 = pe.ParametersEstimator(self._sample_path.trajectories, g2) |
|
|
|
p2.fast_init(test_child) |
|
|
|
p2.fast_init(test_child) |
|
|
|
sofc2 = p2.compute_parameters_for_node(test_child) |
|
|
|
sofc2 = p2.compute_parameters_for_node(test_child) |
|
|
|
self.cache.put(set(p_set), sofc2) |
|
|
|
self._cache.put(set(p_set), sofc2) |
|
|
|
for cim1, p_comb in zip(sofc1.actual_cims, sofc1.p_combs): |
|
|
|
for cim1, p_comb in zip(sofc1.actual_cims, sofc1.p_combs): |
|
|
|
#print("GETTING THIS P COMB", p_comb) |
|
|
|
|
|
|
|
#if len(parent_set) > 1: |
|
|
|
|
|
|
|
cond_cims = sofc2.filter_cims_with_mask(cims_filter, p_comb) |
|
|
|
cond_cims = sofc2.filter_cims_with_mask(cims_filter, p_comb) |
|
|
|
#else: |
|
|
|
|
|
|
|
#cond_cims = sofc2.actual_cims |
|
|
|
|
|
|
|
#print("COnd Cims", cond_cims) |
|
|
|
|
|
|
|
for cim2 in cond_cims: |
|
|
|
for cim2 in cond_cims: |
|
|
|
#cim2 = sofc2.actual_cims[j] |
|
|
|
|
|
|
|
#print(indx) |
|
|
|
|
|
|
|
#print("Run Test", i, j) |
|
|
|
|
|
|
|
if not self.independence_test(child_states_numb, cim1, cim2): |
|
|
|
if not self.independence_test(child_states_numb, cim1, cim2): |
|
|
|
return False |
|
|
|
return False |
|
|
|
return True |
|
|
|
return True |
|
|
|
|
|
|
|
|
|
|
|
def independence_test(self, child_states_numb: int, cim1: condim.ConditionalIntensityMatrix, |
|
|
|
def independence_test(self, child_states_numb: int, cim1: condim.ConditionalIntensityMatrix, |
|
|
|
cim2: condim.ConditionalIntensityMatrix): |
|
|
|
cim2: condim.ConditionalIntensityMatrix) -> bool: |
|
|
|
""" |
|
|
|
""" |
|
|
|
Compute the actual independence test using two cims. |
|
|
|
Compute the actual independence test using two cims. |
|
|
|
It is performed first the exponential test and if the null hypothesis is not rejected, |
|
|
|
It is performed first the exponential test and if the null hypothesis is not rejected, |
|
|
@ -181,38 +151,23 @@ class StructureEstimator: |
|
|
|
C1 = cim1.cim |
|
|
|
C1 = cim1.cim |
|
|
|
C2 = cim2.cim |
|
|
|
C2 = cim2.cim |
|
|
|
F_stats = C2.diagonal() / C1.diagonal() |
|
|
|
F_stats = C2.diagonal() / C1.diagonal() |
|
|
|
exp_alfa = self.exp_test_sign |
|
|
|
exp_alfa = self._exp_test_sign |
|
|
|
for val in range(0, child_states_numb): |
|
|
|
for val in range(0, child_states_numb): |
|
|
|
if F_stats[val] < f_dist.ppf(exp_alfa / 2, r1s[val], r2s[val]) or \ |
|
|
|
if F_stats[val] < f_dist.ppf(exp_alfa / 2, r1s[val], r2s[val]) or \ |
|
|
|
F_stats[val] > f_dist.ppf(1 - exp_alfa / 2, r1s[val], r2s[val]): |
|
|
|
F_stats[val] > f_dist.ppf(1 - exp_alfa / 2, r1s[val], r2s[val]): |
|
|
|
#print("CONDITIONALLY DEPENDENT EXP") |
|
|
|
#print("CONDITIONALLY DEPENDENT EXP") |
|
|
|
return False |
|
|
|
return False |
|
|
|
#M1_no_diag = self.remove_diagonal_elements(cim1.state_transition_matrix) |
|
|
|
|
|
|
|
#M2_no_diag = self.remove_diagonal_elements(cim2.state_transition_matrix) |
|
|
|
|
|
|
|
M1_no_diag = M1[~np.eye(M1.shape[0], dtype=bool)].reshape(M1.shape[0], -1) |
|
|
|
M1_no_diag = M1[~np.eye(M1.shape[0], dtype=bool)].reshape(M1.shape[0], -1) |
|
|
|
M2_no_diag = M2[~np.eye(M2.shape[0], dtype=bool)].reshape( |
|
|
|
M2_no_diag = M2[~np.eye(M2.shape[0], dtype=bool)].reshape( |
|
|
|
M2.shape[0], -1) |
|
|
|
M2.shape[0], -1) |
|
|
|
chi_2_quantile = chi2_dist.ppf(1 - self.chi_test_alfa, child_states_numb - 1) |
|
|
|
chi_2_quantile = chi2_dist.ppf(1 - self._chi_test_alfa, child_states_numb - 1) |
|
|
|
""" |
|
|
|
|
|
|
|
Ks = np.sqrt(cim1.state_transition_matrix.diagonal() / cim2.state_transition_matrix.diagonal()) |
|
|
|
|
|
|
|
Ls = np.reciprocal(Ks) |
|
|
|
|
|
|
|
chi_stats = np.sum((np.power((M2_no_diag.T * Ks).T - (M1_no_diag.T * Ls).T, 2) \ |
|
|
|
|
|
|
|
/ (M1_no_diag + M2_no_diag)), axis=1)""" |
|
|
|
|
|
|
|
Ks = np.sqrt(r1s / r2s) |
|
|
|
Ks = np.sqrt(r1s / r2s) |
|
|
|
Ls = np.sqrt(r2s / r1s) |
|
|
|
Ls = np.sqrt(r2s / r1s) |
|
|
|
for val in range(0, child_states_numb): |
|
|
|
for val in range(0, child_states_numb): |
|
|
|
#K = math.sqrt(cim1.state_transition_matrix[val][val] / cim2.state_transition_matrix[val][val]) |
|
|
|
|
|
|
|
#L = 1 / K |
|
|
|
|
|
|
|
Chi = np.sum(np.power(Ks[val] * M2_no_diag[val] - Ls[val] *M1_no_diag[val], 2) / |
|
|
|
Chi = np.sum(np.power(Ks[val] * M2_no_diag[val] - Ls[val] *M1_no_diag[val], 2) / |
|
|
|
(M1_no_diag[val] + M2_no_diag[val])) |
|
|
|
(M1_no_diag[val] + M2_no_diag[val])) |
|
|
|
|
|
|
|
|
|
|
|
#print("Chi Stats", Chi) |
|
|
|
|
|
|
|
#print("Chi Quantile", chi_2_quantile) |
|
|
|
|
|
|
|
if Chi > chi_2_quantile: |
|
|
|
if Chi > chi_2_quantile: |
|
|
|
#if np.any(chi_stats > chi_2_quantile): |
|
|
|
|
|
|
|
#print("CONDITIONALLY DEPENDENT CHI") |
|
|
|
|
|
|
|
return False |
|
|
|
return False |
|
|
|
#print("Chi test", Chi) |
|
|
|
|
|
|
|
return True |
|
|
|
return True |
|
|
|
|
|
|
|
|
|
|
|
def one_iteration_of_CTPC_algorithm(self, var_id: str, tot_vars_count: int): |
|
|
|
def one_iteration_of_CTPC_algorithm(self, var_id: str, tot_vars_count: int): |
|
|
@ -221,54 +176,45 @@ class StructureEstimator: |
|
|
|
|
|
|
|
|
|
|
|
Parameters: |
|
|
|
Parameters: |
|
|
|
var_id: the node label of the test child |
|
|
|
var_id: the node label of the test child |
|
|
|
tot_vars_count: the number of nodes in the net |
|
|
|
tot_vars_count: the number of _nodes in the net |
|
|
|
Returns: |
|
|
|
Returns: |
|
|
|
void |
|
|
|
void |
|
|
|
""" |
|
|
|
""" |
|
|
|
print("##################TESTING VAR################", var_id) |
|
|
|
print("##################TESTING VAR################", var_id) |
|
|
|
u = list(self.complete_graph.predecessors(var_id)) |
|
|
|
u = list(self._complete_graph.predecessors(var_id)) |
|
|
|
#tests_parents_numb = len(u) |
|
|
|
child_states_numb = self._sample_path.structure.get_states_number(var_id) |
|
|
|
#complete_frame = self.complete_graph_frame |
|
|
|
|
|
|
|
#test_frame = complete_frame.loc[complete_frame['To'].isin([var_id])] |
|
|
|
|
|
|
|
child_states_numb = self.sample_path.structure.get_states_number(var_id) |
|
|
|
|
|
|
|
b = 0 |
|
|
|
b = 0 |
|
|
|
while b < len(u): |
|
|
|
while b < len(u): |
|
|
|
#for parent_id in u: |
|
|
|
|
|
|
|
parent_indx = 0 |
|
|
|
parent_indx = 0 |
|
|
|
while parent_indx < len(u): |
|
|
|
while parent_indx < len(u): |
|
|
|
removed = False |
|
|
|
removed = False |
|
|
|
#if not list(self.generate_possible_sub_sets_of_size(u, b, u[parent_indx])): |
|
|
|
|
|
|
|
#break |
|
|
|
|
|
|
|
S = self.generate_possible_sub_sets_of_size(u, b, u[parent_indx]) |
|
|
|
S = self.generate_possible_sub_sets_of_size(u, b, u[parent_indx]) |
|
|
|
#print("U Set", u) |
|
|
|
|
|
|
|
#print("S", S) |
|
|
|
|
|
|
|
test_parent = u[parent_indx] |
|
|
|
test_parent = u[parent_indx] |
|
|
|
#print("Test Parent", test_parent) |
|
|
|
#print("Test Parent", test_parent) |
|
|
|
for parents_set in S: |
|
|
|
for parents_set in S: |
|
|
|
#print("Parent Set", parents_set) |
|
|
|
print("Parent Set", parents_set) |
|
|
|
#print("Test Parent", test_parent) |
|
|
|
print("Test Parent", test_parent) |
|
|
|
if self.complete_test(test_parent, var_id, parents_set, child_states_numb, tot_vars_count): |
|
|
|
if self.complete_test(test_parent, var_id, parents_set, child_states_numb, tot_vars_count): |
|
|
|
#print("Removing EDGE:", test_parent, var_id) |
|
|
|
#print("Removing EDGE:", test_parent, var_id) |
|
|
|
self.complete_graph.remove_edge(test_parent, var_id) |
|
|
|
self._complete_graph.remove_edge(test_parent, var_id) |
|
|
|
u.remove(test_parent) |
|
|
|
u.remove(test_parent) |
|
|
|
removed = True |
|
|
|
removed = True |
|
|
|
break |
|
|
|
break |
|
|
|
#else: |
|
|
|
|
|
|
|
#parent_indx += 1 |
|
|
|
|
|
|
|
if not removed: |
|
|
|
if not removed: |
|
|
|
parent_indx += 1 |
|
|
|
parent_indx += 1 |
|
|
|
b += 1 |
|
|
|
b += 1 |
|
|
|
self.cache.clear() |
|
|
|
self._cache.clear() |
|
|
|
|
|
|
|
|
|
|
|
def generate_possible_sub_sets_of_size(self, u: typing.List, size: int, parent_label: str): |
|
|
|
def generate_possible_sub_sets_of_size(self, u: typing.List, size: int, parent_label: str) -> \ |
|
|
|
|
|
|
|
typing.Iterator: |
|
|
|
""" |
|
|
|
""" |
|
|
|
Creates a list containing all possible subsets of the list u of size size, |
|
|
|
Creates a list containing all possible subsets of the list u of size size, |
|
|
|
that do not contains a the node identified by parent_label. |
|
|
|
that do not contains a the node identified by parent_label. |
|
|
|
|
|
|
|
|
|
|
|
Parameters: |
|
|
|
Parameters: |
|
|
|
u: the list of nodes |
|
|
|
u: the list of _nodes |
|
|
|
size: the size of the subsets |
|
|
|
size: the size of the subsets |
|
|
|
parent_label: the nodes to exclude in the subsets generation |
|
|
|
parent_label: the _nodes to exclude in the subsets generation |
|
|
|
Returns: |
|
|
|
Returns: |
|
|
|
a Map Object containing a list of lists |
|
|
|
a Map Object containing a list of lists |
|
|
|
|
|
|
|
|
|
|
@ -286,8 +232,8 @@ class StructureEstimator: |
|
|
|
void |
|
|
|
void |
|
|
|
""" |
|
|
|
""" |
|
|
|
ctpc_algo = self.one_iteration_of_CTPC_algorithm |
|
|
|
ctpc_algo = self.one_iteration_of_CTPC_algorithm |
|
|
|
total_vars_numb = self.sample_path.total_variables_count |
|
|
|
total_vars_numb = self._sample_path.total_variables_count |
|
|
|
[ctpc_algo(n, total_vars_numb) for n in self.nodes] |
|
|
|
[ctpc_algo(n, total_vars_numb) for n in self._nodes] |
|
|
|
|
|
|
|
|
|
|
|
def save_results(self): |
|
|
|
def save_results(self): |
|
|
|
""" |
|
|
|
""" |
|
|
@ -298,17 +244,10 @@ class StructureEstimator: |
|
|
|
Returns: |
|
|
|
Returns: |
|
|
|
void |
|
|
|
void |
|
|
|
""" |
|
|
|
""" |
|
|
|
res = json_graph.node_link_data(self.complete_graph) |
|
|
|
res = json_graph.node_link_data(self._complete_graph) |
|
|
|
name = self.sample_path.importer.file_path.rsplit('/',1)[-1] |
|
|
|
name = self._sample_path._importer.file_path.rsplit('/', 1)[-1] |
|
|
|
#print(name) |
|
|
|
name = 'results_' + name #TODO va aggiunto anche l'indice di array |
|
|
|
name = 'results_' + name |
|
|
|
|
|
|
|
with open(name, 'w') as f: |
|
|
|
with open(name, 'w') as f: |
|
|
|
json.dump(res, f) |
|
|
|
json.dump(res, f) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def remove_diagonal_elements(self, matrix): |
|
|
|
|
|
|
|
m = matrix.shape[0] |
|
|
|
|
|
|
|
strided = np.lib.stride_tricks.as_strided |
|
|
|
|
|
|
|
s0, s1 = matrix.strides |
|
|
|
|
|
|
|
return strided(matrix.ravel()[1:], shape=(m - 1, m), strides=(s0 + s1, s1)).reshape(m, -1) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|