Clustering on Customer Purchasing Behaviors dataset
0.595ARIICOMT-K
Evaluation results
| Method | Links | |
|---|---|---|
| ICOMT-KSelection criterion=Best Silhouette Coefficient, Tree depth=3, Number of clusters=8, Computation time (s)=0.01382026.02 | 0.595 | |
| ICOMT-KSelection criterion=Best Dunn Index, Tree depth=3, Number of clusters=8, Computation time (s)=0.01382026.02 | 0.595 | |
| PCTSelection criterion=Best Silhouette Coefficient, Tree depth=3, Number of clusters=5, Computation time (s)=0.00032026.02 | 0.551 | |
| PCTSelection criterion=Best Dunn Index, Tree depth=3, Number of clusters=8, Computation time (s)=0.00032026.02 | 0.551 | |
| ICOTSelection criterion=Best Silhouette Coefficient, Tree depth=3, Number of clusters=5, Computation time (s)=0.06792026.02 | 0.55 | |
| ICOTSelection criterion=Best Dunn Index, Tree depth=3, Number of clusters=5, Computation time (s)=0.07042026.02 | 0.55 | |
| CART-HybridSelection criterion=Best Silhouette Coefficient, Tree depth=3, Number of clusters=6, Computation time (s)=0.04232026.02 | 0.502 | |
| CART-HybridSelection criterion=Best Dunn Index, Tree depth=3, Number of clusters=6, Computation time (s)=0.03622026.02 | 0.502 | |
| ICOMT-BSelection criterion=Best Dunn Index, Tree depth=1, Number of clusters=3, Computation time (s)=0.00722026.02 | 0.452 | |
| ICOMT-BSelection criterion=Best Silhouette Coefficient, Tree depth=1, Number of clusters=2, Computation time (s)=0.00822026.02 | 0.235 |