Data reduction using metaheuristic algorithms

dc.contributor.guideSuganthi, M
dc.coverage.spatialData reduction using metaheuristic algorithms
dc.creator.researcherKarunakaran, V
dc.date.accessioned2021-08-02T04:29:57Z
dc.date.available2021-08-02T04:29:57Z
dc.date.awarded2019
dc.date.completed2019
dc.date.registered
dc.description.abstractOver the recent decades, the amount of data generated has been growing exponentially, the existing data mining algorithms are not feasible for processing of such huge amount of data. To solve such kind of issues, the two commonly adopted schemes are used, one is scaling up the data mining algorithms and other one is data reduction. Scaling up the data mining algorithms is not a best way, but data reduction is fairly possible. In this research work, feature selection, feature extraction and instance selection are carried out for data reduction and without downing the performance of the classification algorithms and classification accuracies. This research works conducts wide literature survey of existing instance selection, feature selection and feature extraction methods. This survey provides in depth view of existing techniques and gives a direction to rest of the study. Many approaches have been proposed for feature selection and instance selection, but most of the approaches still suffer from the problem of stagnation in local optima. Therefore, an efficient searching technique is required to address feature selection and instance selection tasks. In this research work, Cuttlefish Optimization Algorithm, Principal Component Analysis and Cuttlefish Optimization Algorithm through Tabu search are used for feature selection, feature extraction and instance selection. In the first work, instance selection is carried out by using cuttlefish optimization algorithm and the feature extraction is carried out by using principal component analysis. The obtained reduced dataset provides more or less similar detection rate, false positive rate and accuracy rate from what have obtained from using the entire dataset and it take small amount of computational time for training the classifiers newline
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions21cm
dc.format.extentxx,148p.
dc.identifier.urihttp://hdl.handle.net/10603/334222
dc.languageEnglish
dc.publisher.institutionFaculty of Information and Communication Engineering
dc.publisher.placeChennai
dc.publisher.universityAnna University
dc.relationp.139-147
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordData reduction
dc.subject.keywordData mining algorithms
dc.subject.keywordClassification algorithms
dc.titleData reduction using metaheuristic algorithms
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 20
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
142.18 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_certificates.pdf
Size:
196.57 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_vivaproceedings.pdf
Size:
299.08 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_bonafidecertificate.pdf
Size:
237.1 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_abstracts.pdf
Size:
717.31 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: