๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A heuristic clustering algorithm for intrusion detection based on information entropy

โœ Scribed by Xiong Jiajun; Li Qinghua; Tu Jing

Publisher
Wuhan University
Year
2006
Tongue
English
Weight
445 KB
Volume
11
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new efficient algorithm based on DC pr
A new efficient algorithm based on DC programming and DCA for clustering
โœ Le Thi Hoai An; M. Tayeb Belghiti; Pham Dinh Tao ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer US ๐ŸŒ English โš– 221 KB

In this paper, a version of K-median problem, one of the most popular and best studied clustering measures, is discussed. The model using squared Euclidean distances terms to which the K-means algorithm has been successfully applied is considered. A fast and robust algorithm based on DC (Difference