Kennedy, J. and Eberhart, R.C. (1997) A Discrete Binary Version of the Particle Swarm Algorithm. 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Orlando, 12-15 October 1997, 4104-4108.
https://doi.org/10.1109/ICSMC.1997.637339

has been cited by the following article:

• TITLE: Improved Isolation Forest Algorithm for Anomaly Test Data Detection

  AUTHORS: Yupeng Xu, Hao Dong, Mingzhu Zhou, Jun Xing, Xiaohui Li, Jian Yu

  KEYWORDS: Isolation Forest, BPSO, K-Means Cluster, Anomaly Detection

  JOURNAL NAME: Journal of Computer and Communications, Vol.9 No.8, August 18, 2021

  ABSTRACT: The cigarette detection data contains a large amount of true sample data and a small amount of false sample data. The false sample data is regarded as abnormal data, and anomaly detection is performed to realize the identification of real and fake cigarettes. Binary particle swarm optimization algorithm is used to improve the isolation forest construction process, and isolation trees with high precision and large differences are selected, which improves the accuracy and efficiency of the algorithm. The distance between the obtained anomaly score and the clustering center of the k-means algorithm is used as the threshold for anomaly judgment. The experimental results show that the accuracy of the BPSO-iForest algorithm is improved compared with the standard iForest algorithm. The experimental results of multiple brand samples also show that the method in this paper can accurately use the detection data for authenticity identification.