Learning to Predict Memory Robustness from Spiking Neural Networks.
Load dataset
import pickle
dataset = pickle.load(open('RCN_dataset.pickle', 'rb'))
dataset['features'] # axis labels (metrics)
dataset['X'] # 400 datapoints (15D vectors)
dataset['Y'] # 400 target values (maximal connections drops)
Features
- nonrecurrent_count: number of non-reciprocal edges (a->b but not b->a).
- recurrent_count: number of reciprocal edges (a->b and b->a).
- cliques_count: number of maximal cliques within the graph.
- k_edge_connect: k value at which the graph becomes disconnected.
- clique_size_avg: average maximal clique size (number of nodes).
- clique_size_std: standard deviation of clique_size_avg.
- cs_max: biggest maximal clique.
- in_degree_centrality_avg: average in-degree centrality of nodes.
- in_degree_centrality_std: standard deviation of in_degree_centrality_avg.
- out_degree_centrality_avg: average out-degree centrality of nodes.
- out_degree_centrality_std: standard deviation of out_degree_centrality_avg.
- between_centrality_avg: average betweenness-centrality of nodes.
- between_centrality_std: standard deviation of between_centrality_avg.
- closeness_centrality_avg: average closeness-centrality of nodes.
- closeness_centrality_std: standard deviation of closeness_centrality_avg.
Observations
- Some metrics (e.g. cliques count) are integers while others (e.g. in/out-degree centrality) are continuous values - normalization might be needed.
- Some data points (the ones with target values very low or very high) might be underrepresented - filtering might be needed.