You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/73801
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCosta, Kelton-
dc.contributor.authorPereira, Clayton-
dc.contributor.authorNakamura, Rodrigo-
dc.contributor.authorPereira, Luis-
dc.contributor.authorPapa, Joao-
dc.date.accessioned2014-05-27T11:27:17Z-
dc.date.accessioned2016-10-25T18:39:59Z-
dc.date.available2014-05-27T11:27:17Z-
dc.date.available2016-10-25T18:39:59Z-
dc.date.issued2012-12-01-
dc.identifierhttp://dx.doi.org/10.1109/CASoN.2012.6412399-
dc.identifier.citationProceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012, p. 181-185.-
dc.identifier.urihttp://hdl.handle.net/11449/73801-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/73801-
dc.description.abstractIn 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.extent181-185-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectDiscrete lattices-
dc.subjectExhaustive search-
dc.subjectHarmony search-
dc.subjectITS applications-
dc.subjectOptimum-path forests-
dc.subjectTraffic networks-
dc.subjectClustering algorithms-
dc.subjectIntrusion detection-
dc.subjectSocial networking (online)-
dc.subjectForestry-
dc.subjectAlgorithms-
dc.titleBoosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networksen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationDepartment of Computing UNESP Univ Estadual Paulista-
dc.description.affiliationUnespDepartment of Computing UNESP Univ Estadual Paulista-
dc.identifier.doi10.1109/CASoN.2012.6412399-
dc.identifier.wosWOS:000314803000031-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofProceedings of the 2012 4th International Conference on Computational Aspects of Social Networks, CASoN 2012-
dc.identifier.scopus2-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.