convGAN.py 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358
  1. import numpy as np
  2. from numpy.random import seed
  3. import pandas as pd
  4. import matplotlib.pyplot as plt
  5. from library.interfaces import GanBaseClass
  6. from library.dataset import DataSet
  7. from sklearn.decomposition import PCA
  8. from sklearn.metrics import confusion_matrix
  9. from sklearn.metrics import f1_score
  10. from sklearn.metrics import cohen_kappa_score
  11. from sklearn.metrics import precision_score
  12. from sklearn.metrics import recall_score
  13. from sklearn.neighbors import NearestNeighbors
  14. from sklearn.utils import shuffle
  15. from imblearn.datasets import fetch_datasets
  16. from keras.layers import Dense, Input, Multiply, Flatten, Conv1D, Reshape
  17. from keras.models import Model
  18. from keras import backend as K
  19. from tqdm import tqdm
  20. import tensorflow as tf
  21. from tensorflow.keras.optimizers import Adam
  22. from tensorflow.keras.layers import Lambda
  23. import warnings
  24. warnings.filterwarnings("ignore")
  25. def repeat(x, times):
  26. return [x for _i in range(times)]
  27. def create01Labels(totalSize, sizeFirstHalf):
  28. labels = repeat(np.array([1,0]), sizeFirstHalf)
  29. labels.extend(repeat(np.array([0,1]), totalSize - sizeFirstHalf))
  30. return np.array(labels)
  31. class ConvGAN(GanBaseClass):
  32. """
  33. This is a toy example of a GAN.
  34. It repeats the first point of the training-data-set.
  35. """
  36. def __init__(self, n_feat, neb, gen, debug=True):
  37. self.isTrained = False
  38. self.n_feat = n_feat
  39. self.neb = neb
  40. self.gen = gen
  41. self.loss_history = None
  42. self.debug = debug
  43. self.dataSet = None
  44. self.conv_sample_generator = None
  45. self.maj_min_discriminator = None
  46. self.cg = None
  47. def reset(self):
  48. """
  49. Resets the trained GAN to an random state.
  50. """
  51. self.isTrained = False
  52. ## instanciate generator network and visualize architecture
  53. self.conv_sample_generator = self._conv_sample_gen()
  54. ## instanciate discriminator network and visualize architecture
  55. self.maj_min_discriminator = self._maj_min_disc()
  56. ## instanciate network and visualize architecture
  57. self.cg = self._convGAN(self.conv_sample_generator, self.maj_min_discriminator)
  58. def train(self, dataSet, neb_epochs=5):
  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. self.dataSet = dataSet
  68. self._rough_learning(neb_epochs, dataSet.data1, dataSet.data0)
  69. self.isTrained = True
  70. def generateDataPoint(self):
  71. """
  72. Returns one synthetic data point by repeating the stored list.
  73. """
  74. return (self.generateData(1))[0]
  75. def generateData(self, numOfSamples=1):
  76. """
  77. Generates a list of synthetic data-points.
  78. *numOfSamples* is a integer > 0. It gives the number of new generated samples.
  79. """
  80. if not self.isTrained:
  81. raise ValueError("Try to generate data with untrained Re.")
  82. data_min = self.dataSet.data1
  83. ## roughly claculate the upper bound of the synthetic samples to be generated from each neighbourhood
  84. synth_num = (numOfSamples // len(data_min)) + 1
  85. ## generate synth_num synthetic samples from each minority neighbourhood
  86. synth_set=[]
  87. for i in range(len(data_min)):
  88. synth_set.extend(self.generate_data_for_min_point(data_min, i, synth_num))
  89. synth_set = synth_set[:numOfSamples] ## extract the exact number of synthetic samples needed to exactly balance the two classes
  90. return np.array(synth_set)
  91. # ###############################################################
  92. # Hidden internal functions
  93. # ###############################################################
  94. # Creating the GAN
  95. def _conv_sample_gen(self):
  96. """
  97. the generator network to generate synthetic samples from the convex space
  98. of arbitrary minority neighbourhoods
  99. """
  100. ## takes minority batch as input
  101. min_neb_batch = Input(shape=(self.n_feat,))
  102. ## reshaping the 2D tensor to 3D for using 1-D convolution,
  103. ## otherwise 1-D convolution won't work.
  104. x = tf.reshape(min_neb_batch, (1, self.neb, self.n_feat), name=None)
  105. ## using 1-D convolution, feature dimension remains the same
  106. x = Conv1D(self.n_feat, 3, activation='relu')(x)
  107. ## flatten after convolution
  108. x = Flatten()(x)
  109. ## add dense layer to transform the vector to a convenient dimension
  110. x = Dense(self.neb * self.gen, activation='relu')(x)
  111. ## again, witching to 2-D tensor once we have the convenient shape
  112. x = Reshape((self.neb, self.gen))(x)
  113. ## row wise sum
  114. s = K.sum(x, axis=1)
  115. ## adding a small constant to always ensure the row sums are non zero.
  116. ## if this is not done then during initialization the sum can be zero.
  117. s_non_zero = Lambda(lambda x: x + .000001)(s)
  118. ## reprocals of the approximated row sum
  119. sinv = tf.math.reciprocal(s_non_zero)
  120. ## At this step we ensure that row sum is 1 for every row in x.
  121. ## That means, each row is set of convex co-efficient
  122. x = Multiply()([sinv, x])
  123. ## Now we transpose the matrix. So each column is now a set of convex coefficients
  124. aff=tf.transpose(x[0])
  125. ## We now do matrix multiplication of the affine combinations with the original
  126. ## minority batch taken as input. This generates a convex transformation
  127. ## of the input minority batch
  128. synth=tf.matmul(aff, min_neb_batch)
  129. ## finally we compile the generator with an arbitrary minortiy neighbourhood batch
  130. ## as input and a covex space transformation of the same number of samples as output
  131. model = Model(inputs=min_neb_batch, outputs=synth)
  132. opt = Adam(learning_rate=0.001)
  133. model.compile(loss='mean_squared_logarithmic_error', optimizer=opt)
  134. return model
  135. def _maj_min_disc(self):
  136. """
  137. the discriminator is trained intwo phase:
  138. first phase: while training GAN the discriminator learns to differentiate synthetic
  139. minority samples generated from convex minority data space against
  140. the borderline majority samples
  141. second phase: after the GAN generator learns to create synthetic samples,
  142. it can be used to generate synthetic samples to balance the dataset
  143. and then rettrain the discriminator with the balanced dataset
  144. """
  145. ## takes as input synthetic sample generated as input stacked upon a batch of
  146. ## borderline majority samples
  147. samples = Input(shape=(self.n_feat,))
  148. ## passed through two dense layers
  149. y = Dense(250, activation='relu')(samples)
  150. y = Dense(125, activation='relu')(y)
  151. ## two output nodes. outputs have to be one-hot coded (see labels variable before)
  152. output = Dense(2, activation='sigmoid')(y)
  153. ## compile model
  154. model = Model(inputs=samples, outputs=output)
  155. opt = Adam(learning_rate=0.0001)
  156. model.compile(loss='binary_crossentropy', optimizer=opt)
  157. return model
  158. def _convGAN(self, generator, discriminator):
  159. """
  160. for joining the generator and the discriminator
  161. conv_coeff_generator-> generator network instance
  162. maj_min_discriminator -> discriminator network instance
  163. """
  164. ## by default the discriminator trainability is switched off.
  165. ## Thus training the GAN means training the generator network as per previously
  166. ## trained discriminator network.
  167. discriminator.trainable = False
  168. ## input receives a neighbourhood minority batch
  169. ## and a proximal majority batch concatenated
  170. batch_data = Input(shape=(self.n_feat,))
  171. ## extract minority batch
  172. min_batch = Lambda(lambda x: x[:self.neb])(batch_data)
  173. ## extract majority batch
  174. maj_batch = Lambda(lambda x: x[self.neb:])(batch_data)
  175. ## pass minority batch into generator to obtain convex space transformation
  176. ## (synthetic samples) of the minority neighbourhood input batch
  177. conv_samples = generator(min_batch)
  178. ## concatenate the synthetic samples with the majority samples
  179. new_samples = tf.concat([conv_samples, maj_batch],axis=0)
  180. ## pass the concatenated vector into the discriminator to know its decisions
  181. output = discriminator(new_samples)
  182. ## note that, the discriminator will not be traied but will make decisions based
  183. ## on its previous training while using this function
  184. model = Model(inputs=batch_data, outputs=output)
  185. opt = Adam(learning_rate=0.0001)
  186. model.compile(loss='mse', optimizer=opt)
  187. return model
  188. # Create synthetic points
  189. def _generate_data_for_min_point(self, data_min, index, synth_num):
  190. """
  191. generate synth_num synthetic points for a particular minoity sample
  192. synth_num -> required number of data points that can be generated from a neighbourhood
  193. data_min -> minority class data
  194. neb -> oversampling neighbourhood
  195. index -> index of the minority sample in a training data whose neighbourhood we want to obtain
  196. """
  197. runs = int(synth_num / self.neb) + 1
  198. synth_set = []
  199. for _run in range(runs):
  200. batch = self._NMB_guided(data_min, index)
  201. synth_batch = self.conv_sample_generator.predict(batch)
  202. for x in synth_batch:
  203. synth_set.append(x)
  204. return synth_set[:synth_num]
  205. # Training
  206. def _rough_learning(self, neb_epochs, data_min, data_maj):
  207. generator = self.conv_sample_generator
  208. discriminator = self.maj_min_discriminator
  209. GAN = self.cg
  210. loss_history = [] ## this is for stroring the loss for every run
  211. min_idx = 0
  212. neb_epoch_count = 1
  213. labels = tf.convert_to_tensor(create01Labels(2 * self.gen, self.gen))
  214. for step in range(neb_epochs * len(data_min)):
  215. ## generate minority neighbourhood batch for every minority class sampls by index
  216. min_batch = self._NMB_guided(data_min, min_idx)
  217. min_idx = min_idx + 1
  218. ## generate random proximal majority batch
  219. maj_batch = self._BMB(data_min, data_maj)
  220. ## generate synthetic samples from convex space
  221. ## of minority neighbourhood batch using generator
  222. conv_samples = generator.predict(min_batch)
  223. ## concatenate them with the majority batch
  224. concat_sample = tf.concat([conv_samples, maj_batch], axis=0)
  225. ## switch on discriminator training
  226. discriminator.trainable = True
  227. ## train the discriminator with the concatenated samples and the one-hot encoded labels
  228. discriminator.fit(x=concat_sample, y=labels, verbose=0)
  229. ## switch off the discriminator training again
  230. discriminator.trainable = False
  231. ## use the GAN to make the generator learn on the decisions
  232. ## made by the previous discriminator training
  233. gan_loss_history = GAN.fit(concat_sample, y=labels, verbose=0)
  234. ## store the loss for the step
  235. loss_history.append(gan_loss_history.history['loss'])
  236. if self.debug and ((step + 1) % 10 == 0):
  237. print(f"{step + 1} neighbourhood batches trained; running neighbourhood epoch {neb_epoch_count}")
  238. if min_idx == len(data_min) - 1:
  239. if self.debug:
  240. print(f"Neighbourhood epoch {neb_epoch_count} complete")
  241. neb_epoch_count = neb_epoch_count + 1
  242. min_idx = 0
  243. if self.debug:
  244. run_range = range(1, len(loss_history) + 1)
  245. plt.rcParams["figure.figsize"] = (16,10)
  246. plt.xticks(fontsize=20)
  247. plt.yticks(fontsize=20)
  248. plt.xlabel('runs', fontsize=25)
  249. plt.ylabel('loss', fontsize=25)
  250. plt.title('Rough learning loss for discriminator', fontsize=25)
  251. plt.plot(run_range, loss_history)
  252. plt.show()
  253. self.conv_sample_generator = generator
  254. self.maj_min_discriminator = discriminator
  255. self.cg = GAN
  256. self.loss_history = loss_history
  257. ## convGAN
  258. def _BMB(self, data_min, data_maj):
  259. ## Generate a borderline majority batch
  260. ## data_min -> minority class data
  261. ## data_maj -> majority class data
  262. ## neb -> oversampling neighbourhood
  263. ## gen -> convex combinations generated from each neighbourhood
  264. neigh = NearestNeighbors(self.neb)
  265. neigh.fit(data_maj)
  266. bmbi = [
  267. neigh.kneighbors([data_min[i]], self.neb, return_distance=False)
  268. for i in range(len(data_min))
  269. ]
  270. bmbi = np.unique(np.array(bmbi).flatten())
  271. bmbi = shuffle(bmbi)
  272. return tf.convert_to_tensor(
  273. data_maj[np.random.randint(len(data_maj), size=self.gen)]
  274. )
  275. def _NMB_guided(self, data_min, index):
  276. ## generate a minority neighbourhood batch for a particular minority sample
  277. ## we need this for minority data generation
  278. ## we will generate synthetic samples for each training data neighbourhood
  279. ## index -> index of the minority sample in a training data whose neighbourhood we want to obtain
  280. ## data_min -> minority class data
  281. ## neb -> oversampling neighbourhood
  282. neigh = NearestNeighbors(self.neb)
  283. neigh.fit(data_min)
  284. nmbi = neigh.kneighbors([data_min[index]], self.neb, return_distance=False)
  285. nmbi = shuffle(nmbi)
  286. nmb = data_min[nmbi]
  287. nmb = tf.convert_to_tensor(nmb[0])
  288. return nmb