Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/161707
Title: Design and analysis of effective partitioned based clustering algorithm and its application
Researcher: Kumar Ajay
Guide(s): Kumar Shishir
Keywords: Big Data
Clustering Algorithms
Computer Vision
Data Compression
Image Processing
University: Jaypee University of Engineering and Technology, Guna
Completed Date: 15/07/2017
Abstract: These days a numerous data are generated and gathered by a mixed bag of disciplines In that respect there is a need to use these available data with efficiency and convert them into valuable information for the decision making process To achieve this goal one needs data accumulation analytic thinking and evaluation process Generally this process is called knowledge discovery and as the data is stored in a database they are also recognized as knowledge discovery in databases or data mining newlineThe machine learning community over the last decade continually striving to create computational methods for exploiting the knowledge The machine learning community uses two types of learning process that covers the major algorithm present in this field Supervised learning where information about the data is available and unsupervised learning where information about the data is not available In unsupervised learning only the similarity between the data objects can be exploited in order to discover groups of data that share some basic structure newlineIn order to describe and characterize objects by their properties in dataset and in exploratory data analysis grouping is an important technique Clustering algorithm is applied in a variety of scientific as well as engineering applications to organizes data on the basis structure of data objects either by grouping individual data objects or as a hierarchy of the groups It is also called as unsupervised learning in the field of artificial intelligence and pattern recognition newlineThe k means algorithm is among the topmost algorithms in the field of data mining and machine learning due to its simplicity and ease in implementation Despite being discovered in 1967 it remains popular clustering algorithm till date This algorithm begins with picking k initial seed values which can be used as initial centres The selection of initial set of centers is critical as it has a great impact on the quality and speed of the algorithm Therefore finding a way for initialization the k-means algorithm
Pagination: xiii, 179
URI: http://hdl.handle.net/10603/161707
Appears in Departments:Deaprtment of Computer Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File92.04 kBAdobe PDFView/Open
02_certificate.pdf81.56 kBAdobe PDFView/Open
03_abstract.pdf84.49 kBAdobe PDFView/Open
04_declaration.pdf156.24 kBAdobe PDFView/Open
05_acknowledgement.pdf83.91 kBAdobe PDFView/Open
06_contents.pdf191.56 kBAdobe PDFView/Open
07_list_of_tables.pdf101.43 kBAdobe PDFView/Open
08_list_of_figures.pdf179.07 kBAdobe PDFView/Open
09_abbreviations.pdf97.85 kBAdobe PDFView/Open
10_chapter 1.pdf439.22 kBAdobe PDFView/Open
11_chapter 2.pdf229.04 kBAdobe PDFView/Open
12_chapter 3.pdf1.67 MBAdobe PDFView/Open
13_chapter 4.pdf470.37 kBAdobe PDFView/Open
14_chapter 5.pdf237.1 kBAdobe PDFView/Open
15_chapter 6.pdf4.04 MBAdobe PDFView/Open
16_chapter7.pdf33.14 kBAdobe PDFView/Open
17_conclusion.pdf33.09 kBAdobe PDFView/Open
18_bibliography.pdf133.31 kBAdobe PDFView/Open
19_list of publication.pdf11.33 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: