Novel Initial Seed Selection Methodology for Partitional Clustering Algorithms
| dc.contributor.guide | Kalyani Desikan | |
| dc.coverage.spatial | ||
| dc.creator.researcher | Sajidha,S A | |
| dc.date.accessioned | 2021-03-11T04:37:53Z | |
| dc.date.available | 2021-03-11T04:37:53Z | |
| dc.date.awarded | ||
| dc.date.completed | 2020 | |
| dc.date.registered | 2010 | |
| dc.description.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 | |
| dc.description.note | ||
| dc.format.accompanyingmaterial | None | |
| dc.format.dimensions | ||
| dc.format.extent | i-viii, 1-177 | |
| dc.identifier.uri | http://hdl.handle.net/10603/317973 | |
| dc.language | English | |
| dc.publisher.institution | School of Computing Science and Engineering -VIT-Chennai | |
| dc.publisher.place | Vellore | |
| dc.publisher.university | VIT University | |
| dc.relation | ||
| dc.rights | university | |
| dc.source.university | University | |
| dc.subject.keyword | Computer Science | |
| dc.subject.keyword | Computer Science Interdisciplinary Applications | |
| dc.subject.keyword | Engineering and Technology | |
| dc.title | Novel Initial Seed Selection Methodology for Partitional Clustering Algorithms | |
| dc.title.alternative | ||
| dc.type.degree | Ph.D. |
Files
Original bundle
1 - 5 of 17
Loading...
- Name:
- 01_ title page.pdf
- Size:
- 102.76 KB
- Format:
- Adobe Portable Document Format
- Description:
- Attached File
Loading...
- Name:
- 02_ signed copy of declaration_&_certificate.pdf
- Size:
- 81.13 KB
- Format:
- Adobe Portable Document Format
Loading...
- Name:
- 05_ list of tables.pdf
- Size:
- 61.88 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1