convGAN.py 23 KB

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