PSO was originally introduced as an optimization technique for continuous space. in order to extend the application to discrete spaces, Kennedy and Eberhart [43] proposed a discrete binary version of PSO where a particle moves in a state space re

K-means clustering algorithm based on the PSO, Based on negative entropy largest independent component analysis, Nonlinear discrete system identification.