Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/442651
Title: Novel feature selection technique with deep learning for big data classification
Researcher: Umanesan, R
Guide(s): Nandhagopal, N
Keywords: Engineering and Technology
Computer Science
Computer Science Information Systems
big data
effectual form
traditional software
University: Anna University
Completed Date: 2022
Abstract: In recent years, big data become more popular among the public and business enterprises. Big data became a suitable and effectual form of services, resources and applications. Big data is a collection of data which could not be collected, handled, and processed by traditional software models in a particular duration. Big data analytics has become a hot research topic due to its applicability in various real time applications. The recent advent of machine learning and deep learning models can be applied to analyze big data with better performance. At recent times, various domains have started to deal with big dataset which involves numerous set of features. Feature selection models intend to remove noise, repetitive and unwanted features which reduce the performance of the classification process. The conventional FS models do not have adequate ability to handle big dataset and filter effective results in limited time duration. At the same time, Feature Selection (FS) is considered a major process used to enhance the efficiency of big data analytics techniques. Since big data involves numerous features and necessitates high computational time, feature selection methodologies using metaheuristic optimization algorithms can be adopted to choose optimum set of features and thereby improves the overall classification performance. Metaheuristic optimization algorithms can be used to design effective feature selection methodologies. From the state of art literature, and it has been found that Meta heuristic algorithms perform better compared to other wrapper based techniques for FS. However, popular techniques like Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm suffers from slow convergence and local optima problem. These problems have been seen to solve using later generation algorithms like Firefly heuristic and Fish Swarm Heuristic. newline
Pagination: xix,129p.
URI: http://hdl.handle.net/10603/442651
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File48.91 kBAdobe PDFView/Open
02_prelim pages.pdf3.06 MBAdobe PDFView/Open
03_content.pdf19.17 kBAdobe PDFView/Open
04_abstract.pdf41.76 kBAdobe PDFView/Open
05_chapter 1.pdf476.96 kBAdobe PDFView/Open
06_chapter 2.pdf167.41 kBAdobe PDFView/Open
07_chapter 3.pdf64.92 kBAdobe PDFView/Open
08_chapter 4.pdf557.45 kBAdobe PDFView/Open
09_chapter 5.pdf601.42 kBAdobe PDFView/Open
10_chapter 6.pdf394.43 kBAdobe PDFView/Open
11_chapter 7.pdf30.89 kBAdobe PDFView/Open
12_annexures.pdf110.3 kBAdobe PDFView/Open
80_recommendation.pdf60.45 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: