Open Access. Powered by Scholars. Published by Universities.®
Science and Technology Studies Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Science and Technology Studies
Determining The Best K For Clustering Transactional Datasets: A Coverage Density-Based Approach, Hua Yan, Keke Chen, Ling Liu
Determining The Best K For Clustering Transactional Datasets: A Coverage Density-Based Approach, Hua Yan, Keke Chen, Ling Liu
Kno.e.sis Publications
The problem of determining the optimal number of clusters is important but mysterious in cluster analysis. In this paper, we propose a novel method to find a set of candidate optimal number Ks of clusters in transactional datasets. Concretely, we propose Transactional-cluster-modes Dissimilarity based on the concept of coverage density as an intuitive transactional inter-cluster dissimilarity measure. Based on the above measure, an agglomerative hierachical clustering algorithm is developed and the Merge Dissimilarity Indexes, which are generated in hierachical cluster merging processes, are used to find the candidate optimal number Ks of clusters of transactional data. Our experimental results on …