Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/317973
Title: | Novel Initial Seed Selection Methodology for Partitional Clustering Algorithms |
Researcher: | Sajidha,S A |
Guide(s): | Kalyani Desikan |
Keywords: | Computer Science Computer Science Interdisciplinary Applications Engineering and Technology |
University: | VIT University |
Completed Date: | 2020 |
Abstract: | The underlying open issues in the partitional clustering algorithms such as K means newlineand K modes algorithms are as follows - random initial seed point selection, identifying the number of clusters, clustering tendency, handling empty clusters, identifying outliers and so on. Many authors have proposed different techniques to identify initial seed points which may involve setting of values for parameters, randomisation etc. This may not generate clustering solution having the minimal number of misclassifications. Thus, a clustering solution having high intra-cluster similarity and very low inter-cluster similarity cannot be assured. Also the same clustering solution which satisfies the above condition cannot be generated every time the clustering algorithm is executed. Therefore, it is important to identify the initial seed points which are representative points of the clusters of the final clustering solution. This ensures the final clustering solution to have high intra-cluster similarity and low inter-cluster similarity. Since the initial seed points are identified the final clustering solution can be regenerated everytime the clustering algorithm is executed. We have, hence, put forth a novel and simple methodology to overcome the problem of initial seed point selection which has a major impact on the final clustering solution. Our methodology ensures that the clustering solution is a repeatable one with minimal number of misclassifications compared to the existing newlineclustering techniques or generates the same clustering solution as that of the existing algorithms. This is not possible using K means clustering algorithm as the initial seeds are selected randomly during the clustering process. In K means clustering algorithm one needs to make all possible enumerations to find the clustering solution having minimal number of misclassifications. The proposed methodology overcomes this problem by selecting the seed points which are well separated from each other such that they fall into different clusters of the fina |
Pagination: | i-viii, 1-177 |
URI: | http://hdl.handle.net/10603/317973 |
Appears in Departments: | School of Computing Science and Engineering -VIT-Chennai |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_ title page.pdf | Attached File | 102.76 kB | Adobe PDF | View/Open |
02_ signed copy of declaration_&_certificate.pdf | 81.13 kB | Adobe PDF | View/Open | |
03_ abstract.pdf | 57.89 kB | Adobe PDF | View/Open | |
04_content.pdf | 42.86 kB | Adobe PDF | View/Open | |
05_ list of tables.pdf | 61.88 kB | Adobe PDF | View/Open | |
06_ list of figures.pdf | 60.99 kB | Adobe PDF | View/Open | |
07_ acknowledgement.pdf | 40.84 kB | Adobe PDF | View/Open | |
08_ chapter-1.pdf | 364.02 kB | Adobe PDF | View/Open | |
09_ chapter-2.pdf | 195.76 kB | Adobe PDF | View/Open | |
10_ chapter-3.pdf | 451.55 kB | Adobe PDF | View/Open | |
11_ chapter-4.pdf | 308.12 kB | Adobe PDF | View/Open | |
12_ chapter-5.pdf | 403.73 kB | Adobe PDF | View/Open | |
13_ chapter-6.pdf | 81.55 kB | Adobe PDF | View/Open | |
14_ chapter-7.pdf | 49.51 kB | Adobe PDF | View/Open | |
15_ references.pdf | 73.43 kB | Adobe PDF | View/Open | |
16_ list of publications.pdf | 40.19 kB | Adobe PDF | View/Open | |
80_recommendation.pdf | 245.21 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: