/* nag_mv_kmeans_cluster_analysis (g03efc) Example Program. * * Copyright 1998 Numerical Algorithms Group. * * Mark 5, 1998. * Mark 7, revised, 2001. * Mark 8 revised, 2004. * */ #include #include #include #include #define CMEANS(I, J) cmeans[(I) *tdcmeans + J] #define X(I, J) x[(I) *tdx + J] int main(void) { Integer exit_status = 0, i, *inc = 0, *isx = 0, j, k, m, maxit, n, *nic = 0, nvar; Integer tdcmeans, tdx; NagError fail; char weight[2]; double *cmeans = 0, *css = 0, *csw = 0, *wt = 0, *wtptr, *x = 0; INIT_FAIL(fail); printf( "nag_mv_kmeans_cluster_analysis (g03efc) Example Program Results" "\n\n"); /* Skip heading in the data file */ scanf("%*[^\n]"); scanf("%s", weight); scanf("%ld", &n); scanf("%ld", &m); scanf("%ld", &nvar); scanf("%ld", &k); scanf("%ld", &maxit); if (n >= 2 && nvar >= 1 && m >= nvar && k >= 2) { if (!(cmeans = NAG_ALLOC((k)*(nvar), double)) || !(css = NAG_ALLOC(k, double)) || !(csw = NAG_ALLOC(k, double)) || !(wt = NAG_ALLOC(n, double)) || !(x = NAG_ALLOC((n)*(m), double)) || !(inc = NAG_ALLOC(n, Integer)) || !(isx = NAG_ALLOC(m, Integer)) || !(nic = NAG_ALLOC(k, Integer))) { printf("Allocation failure\n"); exit_status = -1; goto END; } tdx = m; tdcmeans = nvar; } else { printf("Invalid n or nvar or m or k.\n"); exit_status = 1; return exit_status; } if (*weight == 'W') { for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) scanf("%lf", &X(i, j)); scanf("%lf", &wt[i]); } wtptr = wt; } else { for (i = 0; i < n; ++i) { for (j = 0; j < m; ++j) scanf("%lf", &X(i, j)); } wtptr = 0; } for (i = 0; i < k; ++i) { for (j = 0; j < nvar; ++j) scanf("%lf", &CMEANS(i, j)); } for (j = 0; j < m; ++j) scanf("%ld", &isx[j]); /* nag_mv_kmeans_cluster_analysis (g03efc). * K-means */ nag_mv_kmeans_cluster_analysis(n, m, x, tdx, isx, nvar, k, cmeans, tdcmeans, wtptr, inc, nic, css, csw, maxit, &fail); if (fail.code != NE_NOERROR) { printf( "Error from nag_mv_kmeans_cluster_analysis (g03efc).\n%s\n", fail.message); exit_status = 1; goto END; } printf("\nThe cluster each point belongs to\n"); for (i = 0; i < n; ++i) printf(" %6ld%s", inc[i], (i+1)%10?"":"\n"); printf("\n\nThe number of points in each cluster\n"); for (i = 0; i < k; ++i) printf(" %6ld", nic[i]); printf("\n\nThe within-cluster sum of weights of each cluster\n"); for (i = 0; i < k; ++i) printf(" %9.2f", csw[i]); printf("\n\nThe within-cluster sum of squares of each cluster\n\n"); for (i = 0; i < k; ++i) printf(" %13.4f", css[i]); printf("\n\nThe final cluster centres\n"); printf(" 1 2 3 4 5\n"); for (i = 0; i < k; ++i) { printf(" %5ld ", i+1); for (j = 0; j < nvar; ++j) printf("%8.4f", CMEANS(i, j)); printf("\n"); } END: if (cmeans) NAG_FREE(cmeans); if (css) NAG_FREE(css); if (csw) NAG_FREE(csw); if (wt) NAG_FREE(wt); if (x) NAG_FREE(x); if (inc) NAG_FREE(inc); if (isx) NAG_FREE(isx); if (nic) NAG_FREE(nic); return exit_status; }