“…Optimisation : To optimise the subset of extracted features, we construct a complete and weighted graph G from the dissimilarity matrix, where the nodes represent the features and the edges (weight) represent the similarity between the features. To do this, We apply a multi‐objective binary PSO [34] G, to find an optimal sub graph which contains only the most significant features. The extracted features have been optimised using this optimisation algorithm.…”