Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/05/2014
27/05/2014
01/12/2012
|
Resumo |
In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks. © 2012 IEEE. |
Formato |
181-185 |
Identificador |
http://dx.doi.org/10.1109/CASoN.2012.6412399 Proceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012, p. 181-185. http://hdl.handle.net/11449/73801 10.1109/CASoN.2012.6412399 WOS:000314803000031 2-s2.0-84874030833 |
Idioma(s) |
eng |
Relação |
Proceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012 |
Direitos |
closedAccess |
Palavras-Chave | #Discrete lattices #Exhaustive search #Harmony search #ITS applications #Optimum-path forests #Traffic networks #Clustering algorithms #Intrusion detection #Social networking (online) #Forestry #Algorithms |
Tipo |
info:eu-repo/semantics/conferencePaper |