Human Activity Discovery with Automatic Multi-objective Particle Swarm Optimization Clustering with Gaussian Mutation and Game Theory
preprintposted on 07.06.2022, 21:19 authored by Parham HadikhaniParham Hadikhani, Daphne Teck Ching Lai, Wee-Hong Ong
Despite many advances in human activity recognition, most existing works are conducted with supervision. Supervised methods rely on labeled training data. However, obtaining labeled data is difficult, costly, and time-consuming. In this paper, we introduce an automatic multi-objective particle swarm optimization clustering based on Gaussian mutation and game theory (MOPGMGT) to tackle the problem of human activity discovery fully unsupervised and map the multi-objective clustering problem to game theory to get the best optimal solution. The proposed algorithm does not require any prior knowledge of the number of activities to be discovered and can find the optimal number. Multi-objective optimization problems typically cannot have a single optimal solution. To solve this issue, Nash Equilibrium (NE) is applied to the pareto front to choose the best solution. NE does not just look for the best solution, but tries to optimize the final solution by considering the effect of choosing each of the solutions as the best solution on the other solutions and one with the best impact is chosen. Moreover, a Gaussian mutation is applied on the pareto front to avoid premature convergence. Experiments on five challenging datasets demonstrate that the proposed approach is the most efficient to achieve better accuracy in human activity discovery and also can determine the optimal number of clusters.