Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/8255
Title: Data clustering using evolutionary computation techniques
Researcher: Sai Hanuman, A
Guide(s): Vinaya Babu, A
Keywords: Computer Science
Upload Date: 22-Apr-2013
University: Acharya Nagarjuna University
Completed Date: 2011
Abstract: Globally, it is witnessed that the databases in number and size in terms of data volumes are proliferating in an exponential manner. These databases contain a rich treasure of knowledge based on which an organization may take a strategic decision or initiate a pivotal plan of action. It is also seen that the number of human data analysts grows at a much smaller rate than the amount of data stored. Hence there is a need for automatic methods to extract knowledge from the stored data through Data Mining. The goal of Data Mining is to extract high-level knowledge from low-level data in the context of large data sets. This thesis provides a comprehensive methodology of extracting useful information from various benchmark and real world datasets using evolutionary computation techniques. Due to the randomized nature of evolutionary computation techniques, they have been very suitable to explore and exploit the search space to extract useful information. In this work, the focus is on data clustering, which is an important task in the process of Data mining. Suitable approaches have been suggested to overcome the limitations of popular K-means approach. Two most popular evolutionary techniques, namely Particle Swarm Optimization (PSO) and Differential Evolution (DE) are used, to develop strategies to overcome difficulties like initial seed value and local optima problem encountered in K-means. Several simulations have been done to show the effectiveness of PSO and DE to overcome these problems. In this work, a new method of adopting the parameters of DE has been suggested. The new DE known as Adaptive Differential Evolution (ADE) works well when compared to simple DE in clustering and this has been demonstrated with several simulation runs. The thesis also suggests two novel hybridizations of PSO and ADE to exploit the advantage of both the techniques. Not knowing the number of clusters beforehand has been a great challenge for Data Mining researchers for several years.
Pagination: 153p.
URI: http://hdl.handle.net/10603/8255
Appears in Departments:Department of Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File48.98 kBAdobe PDFView/Open
02_declaration.pdf43.95 kBAdobe PDFView/Open
03_certificate.pdf38.97 kBAdobe PDFView/Open
04_acknowledgements.pdf36.74 kBAdobe PDFView/Open
05_abstract.pdf38.29 kBAdobe PDFView/Open
06_contents.pdf40.31 kBAdobe PDFView/Open
07_list of figures.pdf34.7 kBAdobe PDFView/Open
08_list of tables.pdf34.76 kBAdobe PDFView/Open
09_abbreviations.pdf32.91 kBAdobe PDFView/Open
10_chapter 1.pdf63.23 kBAdobe PDFView/Open
11_chapter 2.pdf69.61 kBAdobe PDFView/Open
12_chapter 3.pdf295.19 kBAdobe PDFView/Open
13_chapter 4.pdf483.56 kBAdobe PDFView/Open
14_chapter 5.pdf113.52 kBAdobe PDFView/Open
15_chapter 6.pdf114.4 kBAdobe PDFView/Open
16_chapter 7.pdf196.4 kBAdobe PDFView/Open
17_chapter 8.pdf46.23 kBAdobe PDFView/Open
18_references.pdf74.62 kBAdobe PDFView/Open
19_publications of the author.pdf22.78 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: