Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/298678
Title: Certain investigations on data clustering using hybrid metaheuristic algorithms
Researcher: Mageshkumar C
Guide(s): Arunachalam V P
Keywords: Engineering and Technology
Computer Science
Computer Science Information Systems
Data clustering
Metaheuristic algorithms
University: Anna University
Completed Date: 2019
Abstract: Clustering procedures are very useful in different areas such as medical image analysis psychology pattern recognition information retrieval climate analysis business biology intrusion detection system and robotics The main objective of data clustering is to separate or group a large set of available data into meaningful clusters which maximize the intra cluster homogeneity and inter cluster heterogeneity Intra cluster homogeneity defines the degree of similarity between the elements which present in the cluster Clusters are internally homogeneous and it differs from the other clusters which are defined as inter cluster heterogeneity Hybrid metaheuristic algorithm is a combination of more than one algorithm in order to increase the quality of a solution Two main components which justify the quality of the solution are exploration and exploitation Each algorithm has its individual capacity and it may concentrate on either exploration or exploitation When we hybrid more than one algorithm it will help to improve the quality of the solution by focusing on both exploration and exploitation And one more important property is the gap between exploration and exploitation If the gap is very high then it will lead the poor solution On the other hand if the gap is very small in nature then it will yield good quality of the solution Proposed algorithms are developed based on three metaheuristic algorithms such as Ant Lion Optimization Raven Roosting Optimization and Mouth Brooding Fish Optimization algorithms These algorithms are included in intermediate solution generation part of the hybrid methodology The overall result shows that proposed hybrid MBF algorithm provides optimal solution in minimum number of iterations newline
Pagination: xii,103p.
URI: http://hdl.handle.net/10603/298678
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File85.34 kBAdobe PDFView/Open
02_certificates.pdf846.25 kBAdobe PDFView/Open
03_abstracts.pdf81.83 kBAdobe PDFView/Open
04_acknowledgements.pdf294.22 kBAdobe PDFView/Open
05_contents.pdf125 kBAdobe PDFView/Open
06_listoftables.pdf125 kBAdobe PDFView/Open
07_listoffigures.pdf144.72 kBAdobe PDFView/Open
08_listofabbreviations.pdf98.88 kBAdobe PDFView/Open
09_chapter1.pdf974.29 kBAdobe PDFView/Open
10_chapter2.pdf994.34 kBAdobe PDFView/Open
11_chapter3.pdf1.05 MBAdobe PDFView/Open
12_chapter4.pdf1.06 MBAdobe PDFView/Open
13_chapter5.pdf1.22 MBAdobe PDFView/Open
14_conclusion.pdf147.23 kBAdobe PDFView/Open
15_references.pdf166.49 kBAdobe PDFView/Open
16_listofpublications.pdf132.57 kBAdobe PDFView/Open
80_recommendation.pdf171.35 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: