Certain investigations on data clustering using hybrid metaheuristic algorithms

dc.contributor.guideArunachalam V P
dc.coverage.spatialCertain investigations on data clustering using hybrid metaheuristic algorithms
dc.creator.researcherMageshkumar C
dc.date.accessioned2020-09-10T06:32:06Z
dc.date.available2020-09-10T06:32:06Z
dc.date.awarded31/10/2019
dc.date.completed2019
dc.date.registeredn.d.
dc.description.abstractClustering 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
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions21cm.
dc.format.extentxii,103p.
dc.identifier.urihttp://hdl.handle.net/10603/298678
dc.languageEnglish
dc.publisher.institutionFaculty of Information and Communication Engineering
dc.publisher.placeChennai
dc.publisher.universityAnna University
dc.relationp.95-102
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordEngineering and Technology
dc.subject.keywordComputer Science
dc.subject.keywordComputer Science Information Systems
dc.subject.keywordData clustering
dc.subject.keywordMetaheuristic algorithms
dc.titleCertain investigations on data clustering using hybrid metaheuristic algorithms
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 17
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
85.34 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_certificates.pdf
Size:
846.25 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_abstracts.pdf
Size:
81.83 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_acknowledgements.pdf
Size:
294.22 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_contents.pdf
Size:
125 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: