convGAN.py 24 KB

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