Weighted k-prototypes clustering algorithm based on the hybrid dissimilarity coefficient (Q2193363)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7239162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weighted k-prototypes clustering algorithm based on the hybrid dissimilarity coefficient |
scientific article; zbMATH DE number 7239162 |
Statements
Weighted k-prototypes clustering algorithm based on the hybrid dissimilarity coefficient (English)
0 references
25 August 2020
0 references
Summary: The k-prototypes algorithm is a hybrid clustering algorithm that can process Categorical Data and Numerical Data. In this study, the method of initial Cluster Center selection was improved and a new Hybrid Dissimilarity Coefficient was proposed. Based on the proposed Hybrid Dissimilarity Coefficient, a weighted k-prototype clustering algorithm based on the hybrid dissimilarity coefficient was proposed (WKPCA). The proposed WKPCA algorithm not only improves the selection of initial Cluster Centers, but also puts a new method to calculate the dissimilarity between data objects and Cluster Centers. The real dataset of UCI was used to test the WKPCA algorithm. Experimental results show that WKPCA algorithm is more efficient and robust than other k-prototypes algorithms.
0 references
0.8658880591392517
0 references
0.8634061813354492
0 references
0.8485100865364075
0 references
0.8106041550636292
0 references