Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/5833
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorLi, M-
dc.contributor.authorHammoud, Suhel-
dc.date.accessioned2011-09-21T10:56:29Z-
dc.date.available2011-09-21T10:56:29Z-
dc.date.issued2011-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/5833-
dc.descriptionThis thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.en_US
dc.description.abstractThere is growing evidence that integrating classification and association rule mining can produce more efficient and accurate classifiers than traditional techniques. This thesis introduces a new MapReduce based association rule miner for extracting strong rules from large datasets. This miner is used later to develop a new large scale classifier. Also new MapReduce simulator was developed to evaluate the scalability of proposed algorithms on MapReduce clusters. The developed associative rule miner inherits the MapReduce scalability to huge datasets and to thousands of processing nodes. For finding frequent itemsets, it uses hybrid approach between miners that uses counting methods on horizontal datasets, and miners that use set intersections on datasets of vertical formats. The new miner generates same rules that usually generated using apriori-like algorithms because it uses the same confidence and support thresholds definitions. In the last few years, a number of associative classification algorithms have been proposed, i.e. CPAR, CMAR, MCAR, MMAC and others. This thesis also introduces a new MapReduce classifier that based MapReduce associative rule mining. This algorithm employs different approaches in rule discovery, rule ranking, rule pruning, rule prediction and rule evaluation methods. The new classifier works on multi-class datasets and is able to produce multi-label predications with probabilities for each predicted label. To evaluate the classifier 20 different datasets from the UCI data collection were used. Results show that the proposed approach is an accurate and effective classification technique, highly competitive and scalable if compared with other traditional and associative classification approaches. Also a MapReduce simulator was developed to measure the scalability of MapReduce based applications easily and quickly, and to captures the behaviour of algorithms on cluster environments. This also allows optimizing the configurations of MapReduce clusters to get better execution times and hardware utilization.en_US
dc.language.isoenen_US
dc.publisherBrunel University School of Engineering and Design PhD Theses-
dc.relation.urihttp://bura.brunel.ac.uk/bitstream/2438/5833/1/FulltextThesis.pdf-
dc.subjectMapReduce simulatoren_US
dc.subjectMapReduce association rule mineren_US
dc.subjectMapReduce associative rules classifieren_US
dc.subjectMPApriorien_US
dc.subjectMRMCARen_US
dc.titleMapReduce network enabled algorithms for classification based on association rulesen_US
dc.typeThesisen_US
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Electrical Engineering Theses

Files in This Item:
File Description SizeFormat 
FulltextThesis.pdf2.58 MBAdobe PDFView/Open


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