Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/14479
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMAHESHWAR-
dc.date.accessioned2016-02-26T07:49:50Z-
dc.date.available2016-02-26T07:49:50Z-
dc.date.issued2016-02-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/14479-
dc.description.abstractAnt colony optimization algorithms have been used to extract classification rules in data mining. Different variants of ACO have been proposed and successfully applied to discover a list of classification rules. But most of these algorithms follow sequential covering of the algorithm where a rule is pruned without taking into consideration its effects on the whole list of the rules i.e. each rule is pruned individually. Moreover, the relation between the different terms in the rule generated is not taken into consideration. We have proposed a new rule pruning procedure that takes into account the association between the terms in a generated rule during pruning.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTD NO.1250;-
dc.subjectANT COLONY OPTIMIZATIONen_US
dc.subjectCLASSIFICATIONen_US
dc.subjectDATA MININGen_US
dc.subjectRULE PRUNINGen_US
dc.titleA GLOBAL RULE PRUNING FOR ACO IN CLASSIFICATION TASK OF DATA MININGen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Information Technology

Files in This Item:
File Description SizeFormat 
THESIS.pdf1.16 MBAdobe PDFView/Open


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