Please use this identifier to cite or link to this item: http://irepo.futminna.edu.ng:8080/jspui/handle/123456789/11766
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIsmaila, Idris-
dc.contributor.authorAli, Selamat-
dc.date.accessioned2021-07-26T20:42:23Z-
dc.date.available2021-07-26T20:42:23Z-
dc.date.issued2012-
dc.identifier.issn1992-8645-
dc.identifier.urihttp://repository.futminna.edu.ng:8080/jspui/handle/123456789/11766-
dc.description.abstractThis paper initializes a two element concentration vector as a feature vector for classification and spam detection. Negative selection algorithm proposed by the immune system in solving problems in spam detection is used to distinguish spam from non-spam (self from non-self). Self concentration and non-self concentration are generated to form two element concentration vectors. In this approach to e-mail classification, the e-mail are considered as an optimization problem using genetic algorithm to minimize the cost function that was generated and then classification of these cost function shall aid in creating a classifier. This classifier will aid in the new formation of algorithm that comprises of both greater efficiency detector rate and also speedy detection of spam e-mail. The algorithm implementation of the research work shall come in stages were spam and non-spam are detected in all phases for an efficient classifier.en_US
dc.language.isoenen_US
dc.publisherJournal of Theoretical and Applied Information Technologyen_US
dc.subjectNegative Selection Algorithm, Neural Network, Support Vector Machine, Model, Self, Non-selfen_US
dc.titleOptimized Spam Classification Approach with Negative Selection Algorithmen_US
dc.typeArticleen_US
Appears in Collections:Cyber Security Science

Files in This Item:
File Description SizeFormat 
Optimized Spam Classification Approach with Negative Selection Algorithm.pdfOPTIMIZED SPAM CLASSIFICATION APPROACH WITH NEGATIVE SELECTION ALGORITHMelf, Non-self151.6 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.