clusterSim

From MaRDI portal
Software:27995



swMATH16124CRANclusterSimMaRDI QIDQ27995

Searching for Optimal Clustering Procedure for a Data Set

Marek Walesiak

Last update: 10 June 2023

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 0.51-1, 0.51-2, 0.30-6, 0.30-7, 0.30-9, 0.32-3, 0.33-1, 0.34-1, 0.34-3, 0.36-1, 0.36-3, 0.36-4, 0.36-6, 0.37-1, 0.38-1, 0.38-2, 0.39-2, 0.40-5, 0.40-6, 0.41-5, 0.41-7, 0.41-8, 0.42-1, 0.43-1, 0.43-3, 0.43-4, 0.43-5, 0.44-1, 0.44-2, 0.44-4, 0.44-5, 0.45-1, 0.45-2, 0.46-1, 0.46-2, 0.47-1, 0.47-2, 0.47-3, 0.47-4, 0.48-1, 0.48-2, 0.48-3, 0.49-1, 0.49-2, 0.50-1, 0.51-3


Source code repository: https://github.com/cran/clusterSim

Distance measures (GDM1, GDM2,Sokal-Michener, Bray-Curtis, for symbolic interval-valued data), cluster quality indices (Calinski-Harabasz, Baker-Hubert, Hubert-Levine, Silhouette, Krzanowski-Lai, Hartigan, Gap,Davies-Bouldin),data normalization formulas (metric data, interval-valued symbolic data), data generation (typical and non-typical data), HINoV method,replication analysis, linear ordering methods, spectral clustering, agreement indices between two partitions, plot functions (for categorical and symbolic interval-valued data). (MILLIGAN, G.W., COOPER, M.C. (1985) <doi:10.1007/BF02294245>, HUBERT, L., ARABIE, P. (1985) <doi:10.1007%2FBF01908075>, RAND, W.M. (1971) <doi:10.1080/01621459.1971.10482356>, JAJUGA, K., WALESIAK, M. (2000) <doi:10.1007/978-3-642-57280-7_11>, MILLIGAN, G.W., COOPER, M.C. (1988) <doi:10.1007/BF01897163>, JAJUGA, K., WALESIAK, M., BAK, A. (2003) <doi:10.1007/978-3-642-55721-7_12>, DAVIES, D.L., BOULDIN, D.W. (1979) <doi:10.1109/TPAMI.1979.4766909>, CALINSKI, T., HARABASZ, J. (1974) <doi:10.1080/03610927408827101>, HUBERT, L. (1974) <doi:10.1080/01621459.1974.10480191>, TIBSHIRANI, R., WALTHER, G., HASTIE, T. (2001) <doi:10.1111/1467-9868.00293>, BRECKENRIDGE, J.N. (2000) <doi:10.1207/S15327906MBR3502_5>, WALESIAK, M., DUDEK, A. (2008) <doi:10.1007/978-3-540-78246-9_11>).