Advertisement
Published in:
2019 | OriginalPaper | Chapter
A Speed-up K-Nearest Neighbor Classification Algorithm for Trojan Detection
Authors : Tianshuang Li, Xiang Ji, Jingmei Li
Published in: Advanced Hybrid Information Processing
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Aiming at the problem that the traditional K-nearest neighbor algorithm has a long classification time when predicting Trojan sample categories, this paper proposes a speed-up K-nearest neighbor classification algorithm CBBFKNN for Trojan detection. This method adopts the idea of rectangular partitioning to reduce the dimensionality of the sample data. Combining the simulated annealing algorithm and the Kmeans algorithm, the sample set is compressed and the BBF algorithm is used to quickly classify the sample. The experimental results show that, the CBBFKNN classification algorithm can effectively reduce the classification time while the precision loss is small in IRIS dataset. In terms of Trojan detection, the CBBFKNN classification algorithm can guarantee higher accuracy and lower misjudgment rate and lower missed detection rate in shorter detection time.