convGAN.py 14 KB

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