Skip navigation

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/663
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSyed ibrahim, S P-
dc.contributor.authorChandran, K R-
dc.date.accessioned2022-05-18T07:31:05Z-
dc.date.available2022-05-18T07:31:05Z-
dc.date.issued2013-02-01-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/663-
dc.description.abstract                                                                                                                                   Combining different problem solving methods is a very active research area in data mining. Associative classification is a recent and rewarding technique in data mining that applies the methodology of association rule mining into classification and achieves higher classification accuracy. It is a known fact that, associative classification typically yields a large number of rules. If all the generated class association rules are used in the classifier, then, accuracy of the classifier may be high but the classification process will be slow and time-consuming. Hence, generating high quality class association rules and constructing the accurate classifier are indeed a challenging task. This research work aims to improve the performance of eager and lazy learning associative classification by generating minimal number of efficient class association rules, constructing the optimal associative classifier and introducing efficient lazy learning associative classification methods. Experiments are conducted with twelve datasets of different nature taken from the University of California at Irvine Repository (UCI Repository). The results of the proposed methods are compared based on classification accuracy, number of rules generated, number of rules used in the classifier, computation time, specificity, sensitivity, precision and recall. The experimental results show that the proposed methods improve the classification with respect to existing associative classifiers. en_US
dc.language.isoenen_US
dc.publisherAnna Universityen_US
dc.subjectAssociative classificationen_US
dc.subjectdata miningen_US
dc.subjectlarge number of rulesen_US
dc.subjectClassification accuracyen_US
dc.titleCertain investigations on eager and Lazy learning associative classificationen_US
dc.typeThesisen_US
Appears in Collections:Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
abstract 2.pdfABSTRACT15.33 kBAdobe PDFView/Open
Show simple item record


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