Costa, Kelton [UNESP]Pereira, Clayton [UNESP]Nakamura, Rodrigo [UNESP]Pereira, Luis [UNESP]Papa, Joao [UNESP]2014-05-272014-05-272012-12-01Proceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012, p. 181-185.http://hdl.handle.net/11449/73801In 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.181-185engDiscrete latticesExhaustive searchHarmony searchITS applicationsOptimum-path forestsTraffic networksClustering algorithmsIntrusion detectionSocial networking (online)ForestryAlgorithmsTrabalho apresentado em evento10.1109/CASoN.2012.6412399WOS:000314803000031Acesso aberto2-s2.0-84874030833