Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/73801
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Costa, Kelton | - |
dc.contributor.author | Pereira, Clayton | - |
dc.contributor.author | Nakamura, Rodrigo | - |
dc.contributor.author | Pereira, Luis | - |
dc.contributor.author | Papa, Joao | - |
dc.date.accessioned | 2014-05-27T11:27:17Z | - |
dc.date.accessioned | 2016-10-25T18:39:59Z | - |
dc.date.available | 2014-05-27T11:27:17Z | - |
dc.date.available | 2016-10-25T18:39:59Z | - |
dc.date.issued | 2012-12-01 | - |
dc.identifier | http://dx.doi.org/10.1109/CASoN.2012.6412399 | - |
dc.identifier.citation | Proceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012, p. 181-185. | - |
dc.identifier.uri | http://hdl.handle.net/11449/73801 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/73801 | - |
dc.description.abstract | 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. | en |
dc.format.extent | 181-185 | - |
dc.language.iso | eng | - |
dc.source | Scopus | - |
dc.subject | Discrete lattices | - |
dc.subject | Exhaustive search | - |
dc.subject | Harmony search | - |
dc.subject | ITS applications | - |
dc.subject | Optimum-path forests | - |
dc.subject | Traffic networks | - |
dc.subject | Clustering algorithms | - |
dc.subject | Intrusion detection | - |
dc.subject | Social networking (online) | - |
dc.subject | Forestry | - |
dc.subject | Algorithms | - |
dc.title | Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | Department of Computing UNESP Univ Estadual Paulista | - |
dc.description.affiliationUnesp | Department of Computing UNESP Univ Estadual Paulista | - |
dc.identifier.doi | 10.1109/CASoN.2012.6412399 | - |
dc.identifier.wos | WOS:000314803000031 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Proceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012 | - |
dc.identifier.scopus | 2-s2.0-84874030833 | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.