Please use this identifier to cite or link to this item:
Title: A soft computing model for data clustering and application to gene grouping
Researcher: Jacob, Elizabeth
Guide(s): Nair, K N Ramachandran
Keywords: Computer Science
Upload Date: 28-Jan-2013
University: Mahatma Gandhi University
Completed Date: August 2005
Abstract: Data clustering aims at discovering groups and identifying patterns in data. A large number of clustering algorithms and their variations exist in literature. In this work, we consider data that has a natural ordering based on some criterion. The problem can be stated as clustering of sequential data based on multiple features. It belongs to the class of grouping problems. When pre-ordered data is clustered, it results in contiguous blocks. In the general clustering problem, an all-against-all comparison of data objects is required. However, in sequential data clustering, the data objects are position dependent which imposes the condition that only data objects appearing close together in the data stream will belong to the same cluster, thus avoiding an all-against-all comparison. The classical approach to data clustering has given rise to a large number of algorithms that mainly fall into the hierarchical and partitional categories. Soft Computing paradigms of genetic algorithms, fuzzy logic and artificial neural networks have also contributed towards data clustering. Hybrid algorithms mix different computing families to evolve algorithms that perform better than their constitutive elements. The proposed soft computing model belongs to the class of hybrid algorithms. It draws upon the capabilities of genetic algorithms and fuzzy logic to design a methodology to partition the data set into clusters based on the contribution of a set of factors that are known to have some influence in the formation of clusters. The model consists of a fuzzy guided genetic algorithm based on multiple criteria/features. The model has been successfully applied to the problem of gene grouping in the area of bioinformatics. An organism s genome consists of a sequence of genes. The algorithm attempts to discover groups of related genes that lie adjacent on the genome.
Pagination: 143p.
Appears in Departments:School of Computer Sciences

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File5.92 kBAdobe PDFView/Open
02_certificate.pdf146.74 kBAdobe PDFView/Open
03_declaration.pdf102.23 kBAdobe PDFView/Open
04_dedication.pdf4.98 kBAdobe PDFView/Open
05_acknowledgements.pdf16.31 kBAdobe PDFView/Open
06_abstract.pdf13.77 kBAdobe PDFView/Open
07_contents.pdf15.65 kBAdobe PDFView/Open
08_list of figures.pdf10.95 kBAdobe PDFView/Open
09_list of algorithms.pdf5.56 kBAdobe PDFView/Open
10_list of tables.pdf5.77 kBAdobe PDFView/Open
11_chapter 1.pdf53.55 kBAdobe PDFView/Open
12_chapter 2.pdf221.43 kBAdobe PDFView/Open
13_chapter 3.pdf215.35 kBAdobe PDFView/Open
14_chapter 4.pdf149.74 kBAdobe PDFView/Open
15_chapter 5.pdf169.29 kBAdobe PDFView/Open
16_chapter 6.pdf163.89 kBAdobe PDFView/Open
17_chapter 7.pdf30.22 kBAdobe PDFView/Open
18_bibliography.pdf61.8 kBAdobe PDFView/Open

Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.