convGAN.py 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536
  1. import os
  2. import math
  3. import random
  4. import numpy as np
  5. import pandas as pd
  6. import matplotlib.pyplot as plt
  7. import random
  8. from scipy import ndarray
  9. from sklearn.neighbors import NearestNeighbors
  10. from sklearn.decomposition import PCA
  11. from sklearn.metrics import confusion_matrix
  12. from sklearn.metrics import f1_score
  13. from sklearn.metrics import cohen_kappa_score
  14. from sklearn.metrics import precision_score
  15. from sklearn.metrics import recall_score
  16. from collections import Counter
  17. from imblearn.datasets import fetch_datasets
  18. from sklearn.preprocessing import StandardScaler
  19. import keras
  20. from keras.layers import Dense, Dropout, Input
  21. from keras.models import Model,Sequential
  22. from tqdm import tqdm
  23. from keras.layers.advanced_activations import LeakyReLU
  24. from tensorflow.keras.optimizers import Adam
  25. from keras import losses
  26. from keras import backend as K
  27. import tensorflow as tf
  28. import warnings
  29. warnings.filterwarnings("ignore")
  30. from sklearn.neighbors import KNeighborsClassifier
  31. from sklearn.ensemble import RandomForestClassifier
  32. from sklearn.ensemble import GradientBoostingClassifier
  33. from numpy.random import seed
  34. seed_num=1
  35. seed(seed_num)
  36. tf.random.set_seed(seed_num)
  37. ## Import dataset
  38. data = fetch_datasets()['yeast_me2']
  39. ## Creating label and feature matrices
  40. labels_x=data.target ## labels of the data
  41. labels_x.shape
  42. features_x=data.data ## features of the data
  43. features_x.shape
  44. # Until now we have obtained the data. We divided it into training and test sets. we separated obtained seperate variables for the majority and miority classes and their labels for both sets.
  45. ## convGAN
  46. def unison_shuffled_copies(a, b,seed_perm):
  47. 'Shuffling the feature matrix along with the labels with same order'
  48. np.random.seed(seed_perm)##change seed 1,2,3,4,5
  49. assert len(a) == len(b)
  50. p = np.random.permutation(len(a))
  51. return a[p], b[p]
  52. def BMB(data_min,data_maj, neb, gen):
  53. ## Generate a borderline majority batch
  54. ## data_min -> minority class data
  55. ## data_maj -> majority class data
  56. ## neb -> oversampling neighbourhood
  57. ## gen -> convex combinations generated from each neighbourhood
  58. from sklearn.neighbors import NearestNeighbors
  59. from sklearn.utils import shuffle
  60. neigh = NearestNeighbors(neb)
  61. n_feat=data_min.shape[1]
  62. neigh.fit(data_maj)
  63. bmbi=[]
  64. for i in range(len(data_min)):
  65. indices=neigh.kneighbors([data_min[i]],neb,return_distance=False)
  66. bmbi.append(indices)
  67. bmbi=np.unique(np.array(bmbi).flatten())
  68. bmbi=shuffle(bmbi)
  69. bmb=data_maj[np.random.randint(len(data_maj),size=gen)]
  70. bmb=tf.convert_to_tensor(bmb)
  71. return bmb
  72. def NMB_guided(data_min, neb, index):
  73. ## generate a minority neighbourhood batch for a particular minority sample
  74. ## we need this for minority data generation
  75. ## we will generate synthetic samples for each training data neighbourhood
  76. ## index -> index of the minority sample in a training data whose neighbourhood we want to obtain
  77. ## data_min -> minority class data
  78. ## neb -> oversampling neighbourhood
  79. from sklearn.neighbors import NearestNeighbors
  80. from sklearn.utils import shuffle
  81. neigh = NearestNeighbors(neb)
  82. neigh.fit(data_min)
  83. ind=index
  84. nmbi=neigh.kneighbors([data_min[ind]],neb,return_distance=False)
  85. nmbi=shuffle(nmbi)
  86. nmb=data_min[nmbi]
  87. nmb=tf.convert_to_tensor(nmb[0])
  88. return (nmb)
  89. def conv_sample_gen():
  90. ## the generator network to generate synthetic samples from the convex space of arbitrary minority neighbourhoods
  91. min_neb_batch = keras.layers.Input(shape=(n_feat,)) ## takes minority batch as input
  92. x=tf.reshape(min_neb_batch, (1,neb,n_feat), name=None) ## reshaping the 2D tensor to 3D for using 1-D convolution, otherwise 1-D convolution won't work.
  93. x= keras.layers.Conv1D(n_feat, 3, activation='relu')(x) ## using 1-D convolution, feature dimension remains the same
  94. x= keras.layers.Flatten()(x) ## flatten after convolution
  95. x= keras.layers.Dense(neb*gen, activation='relu')(x) ## add dense layer to transform the vector to a convenient dimension
  96. x= keras.layers.Reshape((neb,gen))(x)## again, witching to 2-D tensor once we have the convenient shape
  97. s=K.sum(x,axis=1) ## row wise sum
  98. s_non_zero=tf.keras.layers.Lambda(lambda x: x+.000001)(s) ## adding a small constant to always ensure the row sums are non zero. if this is not done then during initialization the sum can be zero
  99. sinv=tf.math.reciprocal(s_non_zero) ## reprocals of the approximated row sum
  100. x=keras.layers.Multiply()([sinv,x]) ## At this step we ensure that row sum is 1 for every row in x. That means, each row is set of convex co-efficient
  101. aff=tf.transpose(x[0]) ## Now we transpose the matrix. So each column is now a set of convex coefficients
  102. synth=tf.matmul(aff,min_neb_batch) ## We now do matrix multiplication of the affine combinations with the original minority batch taken as input. This generates a convex transformation of the input minority batch
  103. model = Model(inputs=min_neb_batch, outputs=synth) ## finally we compile the generator with an arbitrary minortiy neighbourhood batch as input and a covex space transformation of the same number of samples as output
  104. opt = Adam(learning_rate=0.001)
  105. model.compile(loss='mean_squared_logarithmic_error', optimizer=opt)
  106. return model
  107. def maj_min_disc():
  108. ## the discriminator is trained intwo phase:
  109. ## first phase: while training GAN the discriminator learns to differentiate synthetic minority samples generated from convex minority data space against the borderline majority samples
  110. ## second phase: after the GAN generator learns to create synthetic samples, it can be used to generate synthetic samples to balance the dataset
  111. ## and then rettrain the discriminator with the balanced dataset
  112. samples=keras.layers.Input(shape=(n_feat,)) ## takes as input synthetic sample generated as input stacked upon a batch of borderline majority samples
  113. y= keras.layers.Dense(250, activation='relu')(samples) ## passed through two dense layers
  114. y= keras.layers.Dense(125, activation='relu')(y)
  115. output= keras.layers.Dense(2, activation='sigmoid')(y) ## two output nodes. outputs have to be one-hot coded (see labels variable before)
  116. model = Model(inputs=samples, outputs=output) ## compile model
  117. opt = Adam(learning_rate=0.0001)
  118. model.compile(loss='binary_crossentropy', optimizer=opt)
  119. return model
  120. def convGAN(generator,discriminator):
  121. ## for joining the generator and the discriminator
  122. ## conv_coeff_generator-> generator network instance
  123. ## maj_min_discriminator -> discriminator network instance
  124. maj_min_disc.trainable=False ## by default the discriminator trainability is switched off.
  125. ## Thus training the GAN means training the generator network as per previously trained discriminator network.
  126. batch_data = keras.layers.Input(shape=(n_feat,)) ## input receives a neighbourhood minority batch and a proximal majority batch concatenated
  127. min_batch = tf.keras.layers.Lambda(lambda x: x[:neb])(batch_data) ## extract minority batch
  128. maj_batch = tf.keras.layers.Lambda(lambda x: x[neb:])(batch_data) ## extract majority batch
  129. conv_samples=generator(min_batch) ## pass minority batch into generator to obtain convex space transformation (synthetic samples) of the minority neighbourhood input batch
  130. new_samples=tf.concat([conv_samples,maj_batch],axis=0) ## concatenate the synthetic samples with the majority samples
  131. output=discriminator(new_samples) ## pass the concatenated vector into the discriminator to know its decisions
  132. ## note that, the discriminator will not be traied but will make decisions based on its previous training while using this function
  133. model = Model(inputs=batch_data, outputs=output)
  134. opt = Adam(learning_rate=0.0001)
  135. model.compile(loss='mse', optimizer=opt)
  136. return model
  137. ## this is the main training process where the GAn learns to generate appropriate samples from the convex space
  138. ## this is the first training phase for the discriminator and the only training phase for the generator.
  139. def rough_learning(neb_epochs,data_min,data_maj,neb,gen,generator, discriminator,GAN):
  140. step=1
  141. loss_history=[] ## this is for stroring the loss for every run
  142. min_idx=0
  143. neb_epoch_count=1
  144. labels=[]
  145. for i in range(2*gen):
  146. if i<gen:
  147. labels.append(np.array([1,0]))
  148. else:
  149. labels.append(np.array([0,1]))
  150. labels=np.array(labels)
  151. labels=tf.convert_to_tensor(labels)
  152. while step<(neb_epochs*len(data_min)):
  153. min_batch=NMB_guided(data_min, neb, min_idx) ## generate minority neighbourhood batch for every minority class sampls by index
  154. min_idx=min_idx+1
  155. maj_batch=BMB(data_min,data_maj,neb,gen) ## generate random proximal majority batch
  156. conv_samples=generator.predict(min_batch) ## generate synthetic samples from convex space of minority neighbourhood batch using generator
  157. concat_sample=tf.concat([conv_samples,maj_batch],axis=0) ## concatenate them with the majority batch
  158. discriminator.trainable=True ## switch on discriminator training
  159. discriminator.fit(x=concat_sample,y=labels,verbose=0) ## train the discriminator with the concatenated samples and the one-hot encoded labels
  160. discriminator.trainable=False ## switch off the discriminator training again
  161. gan_loss_history=GAN.fit(concat_sample,y=labels,verbose=0) ## use the GAN to make the generator learn on the decisions made by the previous discriminator training
  162. loss_history.append(gan_loss_history.history['loss']) ## store the loss for the step
  163. if step%10 == 0:
  164. print(str(step)+' neighbourhood batches trained; running neighbourhood epoch ' + str(neb_epoch_count))
  165. if min_idx==len(data_min)-1:
  166. print(str('Neighbourhood epoch '+ str(neb_epoch_count) +' complete'))
  167. neb_epoch_count=neb_epoch_count+1
  168. min_idx=0
  169. step=step+1
  170. run_range=range(1,len(loss_history)+1)
  171. plt.rcParams["figure.figsize"] = (16,10)
  172. plt.xticks(fontsize=20)
  173. plt.yticks(fontsize=20)
  174. plt.xlabel('runs',fontsize=25)
  175. plt.ylabel('loss', fontsize=25)
  176. plt.title('Rough learning loss for discriminator', fontsize=25)
  177. plt.plot(run_range, loss_history)
  178. plt.show()
  179. return generator, discriminator, GAN, loss_history
  180. def rough_learning_predictions(discriminator,test_data_numpy,test_labels_numpy):
  181. ## after the first phase of training the discriminator can be used for classification
  182. ## it already learns to differentiate the convex minority points with majority points during the first training phase
  183. y_pred_2d=discriminator.predict(tf.convert_to_tensor(test_data_numpy))
  184. ## discretisation of the labels
  185. y_pred=np.digitize(y_pred_2d[:,0], [.5])
  186. ## prediction shows a model with good recall and less precision
  187. c=confusion_matrix(test_labels_numpy, y_pred)
  188. f=f1_score(test_labels_numpy, y_pred)
  189. pr=precision_score(test_labels_numpy, y_pred)
  190. rc=recall_score(test_labels_numpy, y_pred)
  191. k=cohen_kappa_score(test_labels_numpy, y_pred)
  192. print('Rough learning confusion matrix:', c)
  193. print('Rough learning f1 score', f)
  194. print('Rough learning precision score', pr)
  195. print('Rough learning recall score', rc)
  196. print('Rough learning kappa score', k)
  197. return c,f,pr,rc,k
  198. def generate_data_for_min_point(data_min,neb,index,synth_num,generator):
  199. ## generate synth_num synthetic points for a particular minoity sample
  200. ## synth_num -> required number of data points that can be generated from a neighbourhood
  201. ## data_min -> minority class data
  202. ## neb -> oversampling neighbourhood
  203. ## index -> index of the minority sample in a training data whose neighbourhood we want to obtain
  204. runs=int(synth_num/neb)+1
  205. synth_set=[]
  206. for run in range(runs):
  207. batch=NMB_guided(data_min, neb, index)
  208. synth_batch=generator.predict(batch)
  209. for i in range(len(synth_batch)):
  210. synth_set.append(synth_batch[i])
  211. synth_set=synth_set[:synth_num]
  212. synth_set=np.array(synth_set)
  213. return(synth_set)
  214. def generate_synthetic_data(data_min,data_maj,neb,generator):
  215. ## roughly claculate the upper bound of the synthetic samples to be generated from each neighbourhood
  216. synth_num=((len(data_maj)-len(data_min))//len(data_min))+1
  217. ## generate synth_num synthetic samples from each minority neighbourhood
  218. synth_set=[]
  219. for i in range(len(data_min)):
  220. synth_i=generate_data_for_min_point(data_min,neb,i,synth_num,generator)
  221. for k in range(len(synth_i)):
  222. synth_set.append(synth_i[k])
  223. synth_set=synth_set[:(len(data_maj)-len(data_min))] ## extract the exact number of synthetic samples needed to exactly balance the two classes
  224. synth_set=np.array(synth_set)
  225. ovs_min_class=np.concatenate((data_min,synth_set),axis=0)
  226. ovs_training_dataset=np.concatenate((ovs_min_class,data_maj),axis=0)
  227. ovs_pca_labels=np.concatenate((np.zeros(len(data_min)),np.zeros(len(synth_set))+1,np.zeros(len(data_maj))+2))
  228. ovs_training_labels=np.concatenate((np.zeros(len(ovs_min_class))+1,np.zeros(len(data_maj))+0))
  229. ovs_training_labels_oh=[]
  230. for i in range(len(ovs_training_dataset)):
  231. if i<len(ovs_min_class):
  232. ovs_training_labels_oh.append(np.array([1,0]))
  233. else:
  234. ovs_training_labels_oh.append(np.array([0,1]))
  235. ovs_training_labels_oh=np.array(ovs_training_labels_oh)
  236. ovs_training_labels_oh=tf.convert_to_tensor(ovs_training_labels_oh)
  237. ## PCA visualization of the synthetic sata
  238. ## observe how the minority samples from convex space have optimal variance and avoids overlap with the majority
  239. pca = PCA(n_components=2)
  240. pca.fit(ovs_training_dataset)
  241. data_pca= pca.transform(ovs_training_dataset)
  242. ## plot PCA
  243. plt.rcParams["figure.figsize"] = (12,12)
  244. colors=['r', 'b', 'g']
  245. plt.xticks(fontsize=20)
  246. plt.yticks(fontsize=20)
  247. plt.xlabel('PCA1',fontsize=25)
  248. plt.ylabel('PCA2', fontsize=25)
  249. plt.title('PCA plot of oversampled data',fontsize=25)
  250. classes = ['minority', 'synthetic minority', 'majority']
  251. scatter=plt.scatter(data_pca[:,0], data_pca[:,1], c=ovs_pca_labels, cmap='Set1')
  252. plt.legend(handles=scatter.legend_elements()[0], labels=classes, fontsize=20)
  253. plt.show()
  254. return ovs_training_dataset, ovs_pca_labels, ovs_training_labels_oh
  255. def final_learning(discriminator, ovs_training_dataset, ovs_training_labels_oh, test_data_numpy, test_labels_numpy, num_epochs):
  256. print('\n')
  257. print('Final round training of the discrminator as a majority-minority classifier')
  258. print('\n')
  259. ## second phase training of the discriminator with balanced data
  260. history_second_learning=discriminator.fit(x=ovs_training_dataset,y=ovs_training_labels_oh, batch_size=20, epochs=num_epochs)
  261. ## loss of the second phase learning smoothly decreses
  262. ## this is because now the data is fixed and diverse convex combinations are no longer fed into the discriminator at every training step
  263. run_range=range(1,num_epochs+1)
  264. plt.rcParams["figure.figsize"] = (16,10)
  265. plt.xticks(fontsize=20)
  266. plt.yticks(fontsize=20)
  267. plt.xlabel('runs',fontsize=25)
  268. plt.ylabel('loss', fontsize=25)
  269. plt.title('Final learning loss for discriminator', fontsize=25)
  270. plt.plot(run_range, history_second_learning.history['loss'])
  271. plt.show()
  272. ## finally after second phase training the discriminator classifier has a more balanced performance
  273. ## meaning better F1-Score
  274. ## the recall decreases but the precision improves
  275. print('\n')
  276. y_pred_2d=discriminator.predict(tf.convert_to_tensor(test_data_numpy))
  277. y_pred=np.digitize(y_pred_2d[:,0], [.5])
  278. c=confusion_matrix(test_labels_numpy, y_pred)
  279. f=f1_score(test_labels_numpy, y_pred)
  280. pr=precision_score(test_labels_numpy, y_pred)
  281. rc=recall_score(test_labels_numpy, y_pred)
  282. k=cohen_kappa_score(test_labels_numpy, y_pred)
  283. print('Final learning confusion matrix:', c)
  284. print('Final learning f1 score', f)
  285. print('Final learning precision score', pr)
  286. print('Final learning recall score', rc)
  287. print('Final learning kappa score', k)
  288. return c,f,pr,rc,k
  289. def convGAN_train_end_to_end(training_data,training_labels,test_data,test_labels, neb, gen, neb_epochs,epochs_retrain_disc):
  290. ##minority class
  291. data_min=training_data[np.where(training_labels == 1)[0]]
  292. ##majority class
  293. data_maj=training_data[np.where(training_labels == 0)[0]]
  294. ## instanciate generator network and visualize architecture
  295. conv_sample_generator=conv_sample_gen()
  296. print(conv_sample_generator.summary())
  297. print('\n')
  298. ## instanciate discriminator network and visualize architecture
  299. maj_min_discriminator=maj_min_disc()
  300. print(maj_min_discriminator.summary())
  301. print('\n')
  302. ## instanciate network and visualize architecture
  303. cg=convGAN(conv_sample_generator, maj_min_discriminator)
  304. print(cg.summary())
  305. print('\n')
  306. print('Training the GAN, first round training of the discrminator as a majority-minority classifier')
  307. print('\n')
  308. ## train gan generator ## rough_train_discriminator
  309. conv_sample_generator, maj_min_discriminator_r ,cg , loss_history=rough_learning(neb_epochs, data_min,data_maj, neb, gen, conv_sample_generator, maj_min_discriminator, cg)
  310. print('\n')
  311. ## rough learning results
  312. c_r,f_r,pr_r,rc_r,k_r=rough_learning_predictions(maj_min_discriminator_r, test_data,test_labels)
  313. print('\n')
  314. ## generate synthetic data
  315. ovs_training_dataset, ovs_pca_labels, ovs_training_labels_oh=generate_synthetic_data(data_min, data_maj, neb, conv_sample_generator)
  316. print('\n')
  317. ## final training results
  318. c,f,pr,rc,k=final_learning(maj_min_discriminator, ovs_training_dataset, ovs_training_labels_oh, test_data, test_labels, epochs_retrain_disc)
  319. return ((c_r,f_r,pr_r,rc_r,k_r),(c,f,pr,rc,k))
  320. ## specify parameters
  321. neb=gen=5 ##neb=gen required
  322. neb_epochs=10
  323. epochs_retrain_disc=50
  324. n_feat=len(features_x[1]) ## number of features
  325. ## Training
  326. np.random.seed(42)
  327. strata=5
  328. results=[]
  329. for seed_perm in range(strata):
  330. features_x,labels_x=unison_shuffled_copies(features_x,labels_x,seed_perm)
  331. #scaler = StandardScaler()
  332. #scaler.fit(features_x)
  333. #features_x=(scaler.transform(features_x))
  334. ### Extracting all features and labels
  335. print('Extracting all features and labels for seed:'+ str(seed_perm)+'\n')
  336. ## Dividing data into training and testing datasets for 10-fold CV
  337. print('Dividing data into training and testing datasets for 10-fold CV for seed:'+ str(seed_perm)+'\n')
  338. label_1=np.where(labels_x == 1)[0]
  339. label_1=list(label_1)
  340. features_1=features_x[label_1]
  341. label_0=np.where(labels_x != 1)[0]
  342. label_0=list(label_0)
  343. len(label_0)
  344. features_0=features_x[label_0]
  345. a=len(features_1)//5
  346. b=len(features_0)//5
  347. fold_1_min=features_1[0:a]
  348. fold_1_maj=features_0[0:b]
  349. fold_1_tst=np.concatenate((fold_1_min,fold_1_maj))
  350. lab_1_tst=np.concatenate((np.zeros(len(fold_1_min))+1, np.zeros(len(fold_1_maj))))
  351. fold_2_min=features_1[a:2*a]
  352. fold_2_maj=features_0[b:2*b]
  353. fold_2_tst=np.concatenate((fold_2_min,fold_2_maj))
  354. lab_2_tst=np.concatenate((np.zeros(len(fold_1_min))+1, np.zeros(len(fold_1_maj))))
  355. fold_3_min=features_1[2*a:3*a]
  356. fold_3_maj=features_0[2*b:3*b]
  357. fold_3_tst=np.concatenate((fold_3_min,fold_3_maj))
  358. lab_3_tst=np.concatenate((np.zeros(len(fold_1_min))+1, np.zeros(len(fold_1_maj))))
  359. fold_4_min=features_1[3*a:4*a]
  360. fold_4_maj=features_0[3*b:4*b]
  361. fold_4_tst=np.concatenate((fold_4_min,fold_4_maj))
  362. lab_4_tst=np.concatenate((np.zeros(len(fold_1_min))+1, np.zeros(len(fold_1_maj))))
  363. fold_5_min=features_1[4*a:]
  364. fold_5_maj=features_0[4*b:]
  365. fold_5_tst=np.concatenate((fold_5_min,fold_5_maj))
  366. lab_5_tst=np.concatenate((np.zeros(len(fold_5_min))+1, np.zeros(len(fold_5_maj))))
  367. fold_1_trn=np.concatenate((fold_2_min,fold_3_min,fold_4_min,fold_5_min, fold_2_maj,fold_3_maj,fold_4_maj,fold_5_maj))
  368. lab_1_trn=np.concatenate((np.zeros(3*a+len(fold_5_min))+1,np.zeros(3*b+len(fold_5_maj))))
  369. fold_2_trn=np.concatenate((fold_1_min,fold_3_min,fold_4_min,fold_5_min,fold_1_maj,fold_3_maj,fold_4_maj,fold_5_maj))
  370. lab_2_trn=np.concatenate((np.zeros(3*a+len(fold_5_min))+1,np.zeros(3*b+len(fold_5_maj))))
  371. fold_3_trn=np.concatenate((fold_2_min,fold_1_min,fold_4_min,fold_5_min,fold_2_maj,fold_1_maj,fold_4_maj,fold_5_maj))
  372. lab_3_trn=np.concatenate((np.zeros(3*a+len(fold_5_min))+1,np.zeros(3*b+len(fold_5_maj))))
  373. fold_4_trn=np.concatenate((fold_2_min,fold_3_min,fold_1_min,fold_5_min,fold_2_maj,fold_3_maj,fold_1_maj,fold_5_maj))
  374. lab_4_trn=np.concatenate((np.zeros(3*a+len(fold_5_min))+1,np.zeros(3*b+len(fold_5_maj))))
  375. fold_5_trn=np.concatenate((fold_2_min,fold_3_min,fold_4_min,fold_1_min,fold_2_maj,fold_3_maj,fold_4_maj,fold_1_maj))
  376. lab_5_trn=np.concatenate((np.zeros(4*a)+1,np.zeros(4*b)))
  377. training_folds_feats=[fold_1_trn,fold_2_trn,fold_3_trn,fold_4_trn,fold_5_trn]
  378. testing_folds_feats=[fold_1_tst,fold_2_tst,fold_3_tst,fold_4_tst,fold_5_tst]
  379. training_folds_labels=[lab_1_trn,lab_2_trn,lab_3_trn,lab_4_trn,lab_5_trn]
  380. testing_folds_labels=[lab_1_tst,lab_2_tst,lab_3_tst,lab_4_tst,lab_5_tst]
  381. for i in range(5):
  382. print('\n')
  383. print('Executing fold: '+str(i+1))
  384. print('\n')
  385. r1,r2=convGAN_train_end_to_end(training_folds_feats[i],training_folds_labels[i],testing_folds_feats[i],testing_folds_labels[i], neb, gen, neb_epochs, epochs_retrain_disc)
  386. results.append(np.array([list(r1[1:]),list(r2[1:])]))
  387. results=np.array(results)
  388. ## Benchmark
  389. mean_rough=np.mean(results[:,0], axis=0)
  390. data_r={'F1-Score_r':[mean_rough[0]], 'Precision_r' : [mean_rough[1]], 'Recall_r' : [mean_rough[2]], 'Kappa_r': [mean_rough[3]]}
  391. df_r=pd.DataFrame(data=data_r)
  392. print('Rough training results:')
  393. print('\n')
  394. print(df_r)
  395. mean_final=np.mean(results[:,1], axis=0)
  396. data_f={'F1-Score_f':[mean_final[0]], 'Precision_f' : [mean_final[1]], 'Recall_f' : [mean_final[2]], 'Kappa_f': [mean_final[3]]}
  397. df_f=pd.DataFrame(data=data_f)
  398. print('Final training results:')
  399. print('\n')
  400. print(df_f)