A heuristic clustering algorithm for intrusion detection based on information entropy
Xiong Jiajun, LI Qing-hua, Tu Jing · Wuhan University Journal of Natural Sciences · 2006
This paper studied on the clustering problem for intrusion detection with the theory of information entropy, it was put forward that the clustering problem for exact intrusion detection based on information entropy is NP-complete, therefore, the heuristic algorithm to solve the clustering problem for intrusion detection was designed, this algorithm has the characteristic of incremental development, it can deal with the database with large connection records from the internet.