-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathutils.py
More file actions
196 lines (162 loc) · 8.51 KB
/
utils.py
File metadata and controls
196 lines (162 loc) · 8.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
import torch
from torch_geometric.utils import to_dense_adj
from torch_geometric.data import Data
def random_node_decay_ordering(datapoint):
# create random list of nodes
return torch.randperm(datapoint.x.shape[0]).tolist()
class NodeMasking:
def __init__(self, dataset):
self.dataset = dataset
assert dataset.x.shape[1] == 1, "Only one feature per node is supported"
self.NODE_MASK = dataset.x.unique().shape[0]
self.EMPTY_EDGE = dataset.edge_attr.unique().shape[0]
self.EDGE_MASK = dataset.edge_attr.unique().shape[0] + 1
def idxify(self, datapoint):
'''
Converts node and edge types to indices starting from 0
'''
datapoint = datapoint.clone()
unique_node_types = {node_type.item(): idx for idx, node_type in enumerate(datapoint.x.unique())}
unique_edge_types = {edge_type.item(): idx for idx, edge_type in enumerate(datapoint.edge_attr.unique())}
datapoint.x = torch.tensor([unique_node_types[node_type.item()] for node_type in datapoint.x]).reshape(-1, 1)
datapoint.edge_attr = torch.tensor([unique_edge_types[edge_type.item()] for edge_type in datapoint.edge_attr])
return datapoint
def deidxify(self, datapoint):
'''
Converts node and edge indices back to their original types
'''
datapoint = datapoint.clone()
unique_node_types = {idx: node_type.item() for idx, node_type in enumerate(datapoint.x.unique())}
unique_edge_types = {idx: edge_type.item() for idx, edge_type in enumerate(datapoint.edge_attr.unique())}
datapoint.x = torch.tensor([unique_node_types.get(node_idx.item(), self.NODE_MASK) for node_idx in datapoint.x]).reshape(-1, 1)
datapoint.edge_attr = torch.tensor([unique_edge_types.get(edge_idx.item(), self.EDGE_MASK) for edge_idx in datapoint.edge_attr])
return datapoint
def is_masked(self, datapoint, node=None):
'''
returns if node is masked or not, or array of masked nodes if node == None
'''
if node is None:
return datapoint.x == self.NODE_MASK
return datapoint.x[node] == self.NODE_MASK
def remove_node(self, datapoint, node):
'''
Removes node from graph, and all edges connected to it
'''
assert node < datapoint.x.shape[0], "Node does not exist"
if datapoint.x.shape[0] == 1:
return datapoint.clone()
datapoint = datapoint.clone()
# remove node
datapoint.x = torch.cat([datapoint.x[:node], datapoint.x[node+1:]])
# remove edges from edge_index (remove elements containing node in tuple of edge_index) (if datapoint.edge_index[:, 0] == node or datapoint.edge_index[:, 1] == node)
if datapoint.edge_index.shape[1] > 1:
# remove edges (remove elements containing node)
datapoint.edge_attr = torch.tensor([edge_attr for edge_attr, edge_index in zip(datapoint.edge_attr, datapoint.edge_index.T) if node not in edge_index])
edge_index_T = torch.stack([edge_index_tuple for edge_index_tuple in datapoint.edge_index.T if node not in edge_index_tuple])
datapoint.edge_index = edge_index_T.T
# update indices of edge_index
datapoint.edge_index[datapoint.edge_index > node] -= 1
return datapoint
def add_masked_node(self, datapoint):
'''
Adds a masked node to the graph
'''
datapoint = datapoint.clone()
n_nodes = datapoint.x.shape[0]
datapoint.x = torch.cat([datapoint.x.reshape(-1,1), torch.tensor([[self.NODE_MASK]])], dim=0)
datapoint.edge_attr = torch.cat([datapoint.edge_attr.reshape(-1,1), torch.tensor([self.EDGE_MASK]).repeat(n_nodes+1, 1)], dim=0)
new_edges = torch.tensor([(node, n_nodes) for node in range(n_nodes+1)], dtype=torch.long).transpose(1,0)
datapoint.edge_index = torch.cat([datapoint.edge_index, new_edges], dim=1)
return datapoint
def mask_node(self, datapoint, selected_node):
'''
Masking node mechanism
1. Masked node (x = -1)
2. Connected to all other nodes in graph by masked edges (edge_attr = -1)
datapoint.x: node feature matrix
datapoint.edge_index: edge index matrix
datapoint.edge_attr: edge attribute matrix
datapoint.y: target value
'''
# mask node
datapoint = datapoint.clone()
datapoint.x[selected_node] = self.NODE_MASK
# mask edges
datapoint.edge_attr[datapoint.edge_index[0] == selected_node] = self.EDGE_MASK
datapoint.edge_attr[datapoint.edge_index[1] == selected_node] = self.EDGE_MASK
return datapoint
def _reorder_edge_attr_and_index(self, graph):
'''
Reorders edge_attr and edge_index to be like on nx graph
(0, 0), (0, 1), (0, 2), ..., (0, n), (1, 0), (1, 1), ..., (n, n)
'''
graph = graph.clone()
# reorder edge_attr
edge_attr = torch.full((graph.x.shape[0], graph.x.shape[0]), self.EMPTY_EDGE, dtype=torch.long)
for edge_attr_value, edge_index in zip(graph.edge_attr, graph.edge_index.T):
edge_attr[edge_index[0], edge_index[1]] = edge_attr_value
graph.edge_attr = edge_attr.view(-1)
# reorder edge_index
edge_index = torch.stack([torch.tensor([i, j]) for i in range(graph.x.shape[0]) for j in range(graph.x.shape[0])], dim=1)
graph.edge_index = edge_index.long()
return graph
def remove_empty_edges(self, graph):
'''
Removes empty edges from graph
'''
graph = graph.clone()
# remove masker.EMPTY_EDGE from edge_attr, and equivalent in edge_index
graph.edge_index = graph.edge_index[:, graph.edge_attr.squeeze() != self.EMPTY_EDGE]
graph.edge_attr = graph.edge_attr[graph.edge_attr.squeeze() != self.EMPTY_EDGE]
return graph
def demask_node(self, graph, selected_node, node_type, connections_types):
'''
Demasking node mechanism
1. Unmasked node (graph.x = node_type)
2. Connected to all other nodes in graph by unmasked edges (graph.edge_attr <= connections_types)
'''
assert connections_types.shape[0] == graph.x.shape[0], "Number of connections must be equal to number of nodes"
# demask node
graph = graph.clone()
graph.x[selected_node] = node_type
# demask edge_attr
for i, connection in enumerate(connections_types):
if not self.is_masked(graph, node=i):
graph.edge_attr[torch.logical_and(graph.edge_index[0] == i, graph.edge_index[1] == selected_node)] = connection
graph.edge_attr[torch.logical_and(graph.edge_index[1] == i, graph.edge_index[0] == selected_node)] = connection
return graph
def fully_connect(self, graph, keep_original_edges=True):
'''
Fully connect graph with edge attribute value
'''
adjacency_matrix = to_dense_adj(graph.edge_index)[0]
adjacency_matrix[adjacency_matrix == 0] = 1
fully_connected = graph.clone()
fully_connected.edge_attr = torch.ones(fully_connected.x.shape[0]**2) * self.EMPTY_EDGE
fully_connected.edge_attr = fully_connected.edge_attr.long()
if keep_original_edges:
# restore values of original edges
for edge_attr, edge_index in zip(graph.edge_attr, graph.edge_index.T):
fully_connected.edge_attr[edge_index[0] * fully_connected.x.shape[0] + edge_index[1]] = edge_attr
fully_connected.edge_attr[edge_index[1] * fully_connected.x.shape[0] + edge_index[0]] = edge_attr # Ensure symmetry
fully_connected.edge_index = torch.nonzero(adjacency_matrix).T
return fully_connected
def generate_fully_masked(self, n_nodes):
'''
Generates a fully masked graph like the one provided
'''
fully_masked = Data(
x=torch.ones((n_nodes, 1))*self.NODE_MASK,
edge_index=torch.tensor([(i, j) for i in range(n_nodes) for j in range(n_nodes)], dtype=torch.int64).transpose(0,1),
edge_attr=torch.ones(n_nodes**2)*self.EDGE_MASK,
)
return fully_masked
def get_denoised_nodes(self, graph):
'''
Returns a list of nodes that are denoised
'''
denoised_nodes = []
for node in range(graph.x.shape[0]):
if not self.is_masked(graph, node):
denoised_nodes.append(node)
return denoised_nodes