Designing cross-validation consensus clustering with reference point in determining the optimal number of clusters

• 主要作者: Norin Rahayu, Shamsuddin
• 格式: Thesis
• 語言: English; English; English
• 出版: 2022
• 主題: QA Mathematics
• 在線閱讀: https://etd.uum.edu.my/9744/1/permission%20to%20deposit-900985.pdf; https://etd.uum.edu.my/9744/2/s900985_01.pdf; https://etd.uum.edu.my/9744/3/s900985_02.pdf; https://etd.uum.edu.my/9744/
• 機構: Universiti Utara Malaysia

Consensus clustering has an ability to overcome instability in estimating the number of clusters, k faced by traditional clustering approach. Consensus clustering offers better estimate by consolidating clustering results into an optimal value. However, the consensus clustering approach faced with three weakness which are lack of clear rules for construction of multiple base partitions, B; lack of specific procedure in combining the outcome of clustering from B into a single consolidated value; and suffers from excessive computational time and complexity in identifying k. Motivated by those weaknesses, this study designs a cross-validation consensus clustering using reference point at every base partition to obtain optimal number of clusters, ˘k*y to produce more robust and stable results. The proposed design creates base partitions using a 10-fold cross-validation approach. In each base partition, the reference point was imposed by extracting 30% of the objects from a dataset to identify ˘k*y. The ˘k*y is used to cluster the objects and identify its clusters. The designed was tested on both simulated and real datasets using stability index, heatmap visualisation and clustering validations. The findings showed that the proposed design performs better in term of computational times in clustering the objects in less than one minute once ˘k*y is obtained. The results also revealed that clustering throughout base partitions in both simulated and real datasets are robust and stable. The proposed design works well on non-overlapping clusters or unequal size of objects cases with least completion time for clustering process. The design also competitive to other clustering approaches in high overlapping clusters and unclear structure of clusters problems.