1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 PAGE: 1 0REQUESTED OPTIONS (EXECUTE): OPT(2) XREF SXM 0OPTIONS IN EFFECT: NOLIST NOMAP XREF GOSTMT NODECK SOURCE TERM OBJECT FIXED TRMFLG SRCFLG NOSYM NORENT SDUMP(ISN) SXM NOVECTOR IL(DIM) NOTEST SC(*) NODC NOEC NOEMODE NOICA NODIRECTIVE NODBCS NOSAA NOPARALLEL NOSAVE NOTABS OPT(2) LANGLVL(77) NOFIPS FLAG(I) AUTODBL(NONE) LINECOUNT(60) CHARLEN(500) 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C C CLUSPAC: Computer Programs for Mixture-Model Clustering C C C C COPYRIGHT (C) 1991, 1992 STANLEY L. SCLOVE C C C C C CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C C CMS DSN = MIX1CMA CLUSPAC C C C C THE PROGRAMS MIX* CLUSPAC IN ISOPAC ARE FOR CLUSTERING DATA C C BY ITERATIVE MAXIMIZATION OF THE MIXTURE-MODEL LIKELIHOOD C C C C N K C C --- -- C C L = | | > p(c)*f(x(i)|c), C C | | -- C C i=1 c=1 C C C C WHERE C C C C N = NUMBER OF OBSERVATIONS ("SAMPLE SIZE"), C C K = NUMBER OF CLUSTERS, C C x(i) = i-TH OBSERVATION, i = 1,2,...,N, C C F(x|c) = VALUE AT x OF THE c-TH CLASS-CONDITIONAL C C DENSITY FUNCTION (c=1,2,...,K) C C AND C C p(c) = PRIOR PROBABILITY OF CLASS c. C C C C C C REFERENCE FOR CLUSTERING BY MIXTURE MODEL: C C C C Wolfe, J. H. (1970). Pattern clustering by multivariate C C mixture analysis. Multivariate Behavioral Research 5, 329-350. C C C C C C THE "1" IN THE PROGRAM NAME "MIX1CMA" MEANS THAT C C THE PROGRAM IS FOR UNIVARIATE (1-DIMENSIONAL) DATA C C (DATA ON THE LINE); THE "CM" MEANS THAT A COMMON VARIANCE IS C C ASSUMED ACROSS CLUSTERS; AND THE "A" INDICATES THAT THERE IS C C AUTOMATIC SETTING OF NUMBERS OF CLUSTERS AND INITIAL MEANS. C C C C C C PROGRAMMED BY C C DR. STANLEY L. SCLOVE 312/996-2681 C C DEPARTMENT OF C C INFORMATION & DECISION SCIENCES M/C 294 C 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 2 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C COLLEGE OF BUSINESS ADMINISTRATION C C UNIVERSITY OF ILLINOIS AT CHICAGO C C BOX 4348 C C CHICAGO, IL 60680-4348 C C C C C C VERSION 1.3 21-MAY-91 C C C C COPYRIGHT (C) 1991, 1992 STANLEY L. SCLOVE C C C C C C C C RESTRICTIONS (CAN BE MODIFIED): C C N, SAMPLE SIZE, AT MOST 999; C C K, NUMBER OF CLUSTERS, AT MOST 29; C C ITER, MAXIMUM NUMBER OF ITERATIONS, 20. C C C C C C C C CONTROL CARDS: C C C C (1) DATASET TITLE C C (2) N, IN FORMAT (2X,I4) C C (3) FMT, IN FORMAT (18A4), E.G., (1X,F4.1). C C ALLOW AT LEAST ONE BLANK IN FMT: IT WILL ALSO BE USED C C FOR OUTPUT, WHERE CC1 IS FOR CARRIAGE CONTROL. C C ALLOW A CC FOR THE DECIMAL POINT ON OUTPUT, C C WHETHER OR NOT THERE IS ONE ON INPUT. C C (4) DATA, IN FORMAT SPECIFIED BY FMT C C C C C C C CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C C C C C 1 DIMENSION X(999),XMNDSQ(999),ICLUS(999),IOTA(999) 2 DIMENSION XJ(9,9) 3 DIMENSION DSQ(29),C(29),SUM(29) 4 DIMENSION TITLE(18) 5 DIMENSION B(29),NC(29),XMEAN(29) 6 DIMENSION FMT(18) 7 DIMENSION SS(29),SSD(29) 8 DIMENSION SD(29) 9 DIMENSION VAR(29) 10 DIMENSION ICLSOL(999) 11 DIMENSION F(999,29) 12 DIMENSION P(29), XNC(29) 13 DIMENSION PP(29,999) 14 DIMENSION XMXPR(999) 15 DIMENSION DENOM(999) 16 DIMENSION AICVEC(29),SCHVEC(29),XKSVEC(29) C 17 DOUBLE PRECISION SUM,SS,F,P,PP C 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 3 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C CONTROL CARDS: C C (1) DATASET TITLE C (2) N, IN FORMAT (2X,I4) C (3) FMT, IN FORMAT (18A4), E.G., (1X,F4.1). C ALLOW AT LEAST ONE BLANK IN FMT: IT WILL ALSO BE USED C FOR OUTPUT, WHERE CC1 IS FOR CARRIAGE CONTROL. C ALLOW A CC FOR THE DECIMAL POINT ON OUTPUT, WHETHER OR NOR C THERE IS ONE ON INPUT. C (4) DATA, IN FORMAT SPECIFIED BY FMT C C 18 READ(5,15000) TITLE C C WRITE PROGRAM INFORMATION. 19 WRITE(6,20000) 20 WRITE(6,21000) 21 WRITE(6,22000) C 22 WRITE(6,16000) TITLE C C READ SAMPLE SIZE, N. 23 READ(5,10000) N 24 XN = N 25 WRITE(6, 1051) N C C READ DATA FORMAT. 26 READ(5,15000) FMT C C READ DATA AND C COMPUTE STATISTICS OF WHOLE SAMPLE: 27 TOTAL=0.0 28 SUMSQS=0.0 29 SSDEVS=0.0 C C READ(5, * ) ( X(I), I = 1,N ) C 30 READ(5,FMT) ( X(I), I = 1,N ) 31 DO 100 I = 1,N 1 32 TOTAL = TOTAL + X(I) 1 33 SUMSQS = SUMSQS + X(I)*X(I) 1 34 IF (I .EQ. 1) GO TO 498 1 35 GO TO 499 1 36 498 XMAX = X(1) 1 37 XMIN = X(1) 1 38 499 CONTINUE 1 39 IF (X(I) .LT. XMIN) XMIN=X(I) 1 41 IF (X(I) .GT. XMAX) XMAX=X(I) 1 43 100 CONTINUE C IF IT IS DESIRED TO PRINT OUT THE DATA, REMOVE THE "C"S C FROM CC1 IN THE APPROPRIATE FOLLOWING STATEMENTS: C WRITE DATA: C WRITE(6, 1009) C1009 FORMAT(1X,'DATA:'/) C WRITE(6, FMT) (X(I), I=1, N) C WRITE SUMMARY STATISTICS FOR WHOLE SAMPLE: 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 4 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 44 WRITE(6, 1151) 45 WRITE(6, * ) XMIN 46 WRITE(6, 1152) 47 WRITE(6, * ) XMAX 48 XBAR = TOTAL/XN 49 SSDEVS = SUMSQS- TOTAL*TOTAL/XN 50 VARHAT = SSDEVS/XN 51 WRITE(6, 1112) XBAR 52 WRITE(6, 1113) VARHAT 53 PI = 3.1415927 54 TEMP = 2.0*PI*SSDEVS/N 55 XMN2LL = N*(1.0 + ALOG(TEMP)) 56 STDDEV = SQRT(VARHAT) 57 WRITE(6, 1121) SSDEVS, XMN2LL, STDDEV C NO. OF PARAMETERS FOR UNCLUSTERED SAMPLE IS: C 1 MEAN + 1 VARIANCE = 2 PARAMETERS 58 NOPARM = 1 + 1 C 59 AIC = XMN2LL + 2.0*NOPARM 60 WRITE(6, 1205) AIC 61 SCH = XMN2LL + ALOG(XN)*NOPARM 62 XKASH = SCH - ALOG(2*VARHAT**3) 63 WRITE(6,18000) SCH 64 WRITE(6,17000) XKASH C A TABLE OF MODEL SELECTION CRITERIA-VALUES FOR VARIOUS K C WILL BE PRINTED AT THE END. THE NEXT INSTRUCTIONS C SET UP THE FIRST ENTRIES FOR THAT TABLE. 65 AICVEC(1) = AIC 66 SCHVEC(1) = SCH 67 XKSVEC(1) = XKASH C C C C SET CONSTANTS. C XJ(IC,K), K=1 TO 9, IC = 1 TO K C OPTIMAL CLASS PROBABILITIES - NORMAL DISTRIBUTION C JOHARI & SCLOVE (1975). "PARTITIONING A DISTRIBUTION." C COMMUNICATIONS IN STATISTICS. 68 XJ(1,2)=.5 69 XJ(2,2)=.5 70 XJ(1,3)=.2703 71 XJ(2,3)=.4594 72 XJ(3,3)=.2703 73 XJ(1,4)=.1631 74 XJ(2,4)=.3369 75 XJ(3,4)=.3369 76 XJ(4,4)=.1631 77 XJ(1,5)=.1068 78 XJ(2,5)=.2444 79 XJ(3,5)=.2976 80 XJ(4,5)=.2444 81 XJ(5,5)=.1068 82 XJ(1,6)=.0739 83 XJ(2,6)=.1810 84 XJ(3,6)=.2451 85 XJ(4,6)=.2451 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 5 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 86 XJ(5,6)=.1810 87 XJ(6,6)=.0739 88 XJ(1,7)=.0536 89 XJ(2,7)=.1375 90 XJ(3,7)=.1986 91 XJ(4,7)=.2106 92 XJ(5,7)=.1986 93 XJ(6,7)=.1375 94 XJ(7,7)=.0536 95 XJ(1,8)=.0402 96 XJ(2,8)=.1067 97 XJ(3,8)=.1613 98 XJ(4,8)=.1918 99 XJ(5,8)=.1918 100 XJ(6,8)=.1613 101 XJ(7,8)=.1067 102 XJ(8,8)=.0402 103 XJ(1,9)=.0310 104 XJ(2,9)=.0845 105 XJ(3,9)=.1324 106 XJ(4,9)=.1643 107 XJ(5,9)=.1756 108 XJ(6,9)=.1643 109 XJ(7,9)=.1324 110 XJ(8,9)=.0845 111 XJ(9,9)=.0310 C C PERFORM CLUSTERING FOR K = 2 TO 9 GROUPS. 112 DO 995 K = 2,9 1 113 WGSS = 0.0 1 114 WRITE(6,23000) K C C COMPUTE INITIAL MEANS, EQUALLY SPACED THROUGH RANGE OF DATA, C INITIAL PRIOR PROBABILITIES (EQUAL) AND INITIAL VALUE C OF COMMON VARIANCE: 1 115 XK = K 1 116 DO 101 IC=1,K C XC = IC 2 117 XMEAN(IC) = XMIN + (IC-1)*(XMAX-XMIN)/(K-1) C C For more centered spacing, use the following: C XMEAN(IC) = XMIN + IC*(XMAX-XMIN)/(K+1) C C SET INITIAL VALUES OF PRIOR PROBABILITIES EQUAL TO THE C OPTIMAL VALUES FOR A NORMAL DISTRIBUTION: 2 118 P(IC) = XJ(IC,K) C TO SET INITIAL VALUES OF PRIOR PROBABILITIES EQUAL TO C BINOMIAL(X=IC-1;N=K-1,P=1/2). C FOR IC = 1,2,...,K, C REMOVE THE "C" FROM CC1 OF THE NEXT LINE: C P(IC) = GAMMA(XK)/(GAMMA(XC)*GAMMA(XK-XC+1)*(2**K)) C C FOR EQUAL INITIAL VALUES OF PRIOR PROBABILITIES, C REMOVE THE "C" FROM CC1 OF THE NEXT LINE: C P(IC) = 1.0/K . C 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 6 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 2 119 101 CONTINUE 1 120 VARHAT = (XMAX - XMIN)/4 1 121 VARHAT =(VARHAT**2)/K C C C C WRITE INITIAL VALUES OF PRIOR PROBS: 1 122 WRITE(6,25000) C 1 123 WRITE(6, 1025) ( P(IC), IC = 1, K ) C C WRITE INITIAL MEANS: 1 124 WRITE(6,14000) C 1 125 WRITE(6,19000) ( XMEAN(IC), IC=1, K ) C WRITE INITIAL VARIANCE: 1 126 WRITE(6,24000) C 1 127 WRITE(6, 1017) VARHAT 1 128 DO 105 INTGER=1,N 2 129 IOTA(INTGER) = INTGER 2 130 105 CONTINUE C 1 131 ITER = 1 C 1 132 601 CONTINUE C 1 133 IF (ITER .EQ. 1) GO TO 560 C STORE OLD CLUSTERING: 1 134 DO 565 I = 1,N 2 135 ICLSOL(I) = ICLUS(I) 2 136 565 CONTINUE C COMMENCE DISTANCE COMPUTATIONS. 1 137 560 CONTINUE 1 138 DO 102 I = 1,N 2 139 DO 102 IC = 1,K 3 140 DSQ(IC) = ( XMEAN(IC) - X(I) )**2 3 141 ZSQ = DSQ(IC)/VARHAT 3 142 IF ( ZSQ .LE. 174.673 ) GO TO 110 3 143 F(I,IC) = 0.0 3 144 GO TO 102 3 145 110 CONTINUE 3 146 F(I,IC) = EXP(-ZSQ/2.0) 3 147 102 CONTINUE C C COMPUTE POSTERIOR PROBABILITIES OF GROUP MEMBERSHIP: 1 148 DO 405 I = 1,N 2 149 DENOM(I) = 0.0 2 150 DO 405 IH=1,K 3 151 DENOM(I) = DENOM(I) + P(IH)*F(I,IH) 3 152 405 CONTINUE 1 153 DO 406 I = 1,N 2 154 DO 406 IC=1,K C IF ( DENOM(I) .EQ. 0.0 ) DENOM(I)=0.0001 3 155 PP(IC,I)= P(IC)*F(I,IC)/DENOM(I) 3 156 406 CONTINUE 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 7 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C C COMPUTE NEW LABELS BY MAX POSTERIOR PROBABILITY: 1 157 DO 8 I = 1,N 2 158 XMXPR(I) = PP(1,I) 2 159 ICLUS(I) = 1 2 160 DO 8 IC = 2,K 3 161 IF ( PP(IC,I) .GT. XMXPR(I) ) GO TO 9 3 162 GO TO 8 3 163 9 XMXPR(I) = PP(IC,I) 3 164 ICLUS(I) = IC 3 165 8 CONTINUE C 1 166 IF (N .GE. 31) GO TO 200 C WRITE NEW LABELS: 1 167 WRITE(6, 11000) 1 168 WRITE(6,12000) (IOTA(I), I=1, N) 1 169 WRITE(6,13000) (ICLUS(I), I=1, N) 1 170 200 CONTINUE C C UPDATE CLUSTER PRIOR PROBABILITIES P(IC), MEANS XMEAN(IC) AND C VARIANCE VARHAT: 1 171 WGSS = 0.0 1 172 DO 6 IC = 1,K 2 173 XNC(IC) = 0.0 C XNC(IC) WILL BE THE SUM OVER ALL N OBSERVATIONS OF THEIR C POSTERIOR PROBABILITIES OF MEMBERSHIP IN CLUSTER IC. 2 174 SUM(IC) = 0.0 2 175 SS(IC) = 0.0 2 176 DO 67 I = 1,N 3 177 XNC(IC) = XNC(IC) + PP(IC,I) 3 178 SUM(IC) = SUM(IC) + PP(IC,I)*X(I) 3 179 SS(IC) = SS(IC) + PP(IC,I)*X(I)*X(I) 3 180 67 CONTINUE C C IF ONE OF THE K CLUSTERS BECOMES EMPTY, THE PROCEDURE C WILL GO ON TO THE NEXT VALUE OF K: 2 181 IF ( XNC(IC) .EQ. 0.0 ) GO TO 125 2 182 XMEAN(IC) = SUM(IC)/XNC(IC) 2 183 SSD(IC) = SS(IC) - SUM(IC)*SUM(IC)/XNC(IC) 2 184 VAR(IC) = SSD(IC)/( XNC(IC) ) C IF ( VAR(IC) .LE. 0.0 ) VAR(IC) = 0.0001 2 185 SD(IC) = SQRT(VAR(IC)) 2 186 P(IC) = XNC(IC)/XN 2 187 WGSS = WGSS + SSD(IC) 2 188 6 CONTINUE C C COUNT NUMBERS IN CLUSTERS: 1 189 DO 66 IC = 1,K 2 190 NC(IC) = 0 2 191 66 CONTINUE 1 192 DO 400 I = 1,N 2 193 IGROUP = ICLUS(I) 2 194 NC(IGROUP) = NC(IGROUP) + 1 2 195 400 CONTINUE C C 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 8 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C 1 196 VARHAT = WGSS/XN C 1 197 SUMLNF = 0.0 1 198 DO 161 I=1,N 2 199 SUMPXF = 0.0 2 200 DO 159 IC=1,K 3 201 SUMPXF = SUMPXF + P(IC)*F(I,IC) 3 202 159 CONTINUE C F(I,IC) HAD NOT PREVIOUSLY BEEN DIVIDED BY SQRT(2*PI*VARHAT): 2 203 SUMPXF = SUMPXF/SQRT(2.0*PI*VARHAT) 2 204 SUMLNF = SUMLNF + ALOG(SUMPXF) 2 205 161 CONTINUE C 1 206 XMN2LL = -2.0*SUMLNF C 1 207 WGMS = WGSS/(N-K) 1 208 WRITE(6, 1021) WGSS, XMN2LL, WGMS 1 209 STDERR = SQRT(WGMS) 1 210 WRITE(6,71000) STDERR C 1 211 KM1 = K-1 1 212 DO 500 IC=1,KM1 2 213 ICP1 = IC+1 C B(IC) IS BOUNDARY BETWEEN G-TH AND G+1-ST CLASSES. 2 214 B(IC) = ( XMEAN(IC) + XMEAN(ICP1) )/2.0 2 215 BDYADJ = DLOG(P(ICP1)) - DLOG(P(IC)) 2 216 BDYADJ = BDYADJ/(XMEAN(ICP1) - XMEAN(IC)) 2 217 BDYADJ = VARHAT*BDYADJ 2 218 B(IC) = B(IC) - BDYADJ 2 219 500 CONTINUE 1 220 WRITE(6, 1036) ITER 1 221 WRITE(6, 1035) (B(IC), IC=1, KM1) 1 222 WRITE(6, 1020) (XMEAN(IC), IC=1, K) 1 223 IF (ITER .EQ. 1) GO TO 600 1 224 DO 555 I = 1,N 2 225 IF (ICLUS(I) .EQ. ICLSOL(I)) GO TO 555 2 226 GO TO 600 2 227 555 CONTINUE 1 228 GO TO 530 1 229 600 CONTINUE 1 230 ITER = ITER + 1 C C IF PROCEDURE HAS NOT CONVERGED IN 20 ITERATIONS, IT WILL C GO ON TO THE NEXT VALUE OF K. 1 231 IF (ITER.GE.21) GO TO 570 1 232 GO TO 601 1 233 570 WRITE(6, 1160) 1 234 GO TO 995 C C IF ONE OF THE K CLUSTERS BECOMES EMPTY, THE PROCEDURE C WILL GO ON TO THE NEXT VALUE OF K. 1 235 125 CONTINUE 1 236 WRITE(6, 1235) 1 237 GO TO 995 C 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 9 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 C 1 238 530 CONTINUE C 1 239 WRITE(6, 1040) (SUM(IC), IC=1, K) 1 240 WRITE(6, 1045) (NC(IC), IC=1, K) 1 241 WRITE(6,70000) (VAR(IC), IC=1, K) 1 242 WRITE(6, 1055) (SD(IC), IC=1, K) C VARHAT IS MLE OF VARIANCE. 1 243 VARHAT = WGSS/N 1 244 WRITE(6, 1100) VARHAT C C C C COMPUTE MODEL-SELECTION CRITERIA: C NO. PARAMETERS = K MEANS + 1 VARIANCE + (K-1) PROBS. 1 245 NOPARM = K + 1 1 246 NOPARM = NOPARM + K - 1 1 247 WRITE(6,72000) NOPARM 1 248 AIC = XMN2LL + 2.0*NOPARM 1 249 SCH = XMN2LL + ALOG(XN)*NOPARM C 1 250 XKASH = SCH - ALOG(2*VARHAT**3) C 1 251 WRITE(6, 1205) AIC 1 252 WRITE(6,18000) SCH 1 253 WRITE(6,17000) XKASH C C C C C Store values of model-selection criteria for this value of K: C 1 254 AICVEC(K) = AIC 1 255 SCHVEC(K) = SCH 1 256 XKSVEC(K) = XKASH C C GO ON TO NEXT VALUE OF K: 1 257 995 CONTINUE C C WRITE VALUES OF MSC'S FOR VARIOUS K: 258 WRITE(6,34000) 259 DO 605 K = 1,9 1 260 WRITE(6,33000) K, AICVEC(K), SCHVEC(K), XKSVEC(K) 1 261 605 CONTINUE C 262 10000 FORMAT(2X,I4) 263 11000 FORMAT(1X,'CLUSTERING') 264 12000 FORMAT(1X,'POINT: '/, (1X,40I3)) 265 13000 FORMAT(1X,'CLUSTER: '/, (1X,40I3)) 266 33000 FORMAT(1X,'K=',I3, 3F15.2) 267 34000 FORMAT(1X,'MODEL SELECTION CRITERIA'/ X' AIC SCHWARZ KASHYAP '/) 268 14000 FORMAT(/1X,'INITIAL MEANS') 269 25000 FORMAT(/1X,'INITIAL VALUES OF PRIOR PROBS') 270 19000 FORMAT(1X, 9F13.2/) 271 1025 FORMAT(1X, 9F13.4/) 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 10 0 IF DO ISN *....*...1.........2.........3.........4.........5.........6.........7.*.......8 0 272 24000 FORMAT(/1X,'INITIAL VARIANCE') 273 1017 FORMAT(1X, F15.4/) 274 1100 FORMAT(1X, 'M.L. ESTIMATE OF COMMON VARIANCE = ',F14.5/) 275 21000 FORMAT(1X,'CMS DSN = MIX1CMA CLUSPAC') 276 22000 FORMAT(1X,'COPYRIGHT (C) 1991, 1992 STANLEY L. SCLOVE.'/) 277 23000 FORMAT('1',1X,'K = ',I1,' CLUSTERS') 278 1020 FORMAT(1X,'MEANS: ',9F13.2) 279 1021 FORMAT(/1X,'WGSS = ',F14.4,' MINUS 2 LOG LIKELIHOOD = ', XF14.4, ' WGMS = ',F14.4/) 280 1035 FORMAT(1X,'BOUNDARIES:', 8X, 9F13.2) 281 1151 FORMAT(1X,'MINIMUM OF SAMPLE: ') 282 1152 FORMAT(1X,'MAXIMUM OF SAMPLE: ') 283 17000 FORMAT(/,1X,'KASHYAP CRITERION = ', F14.4) 284 1112 FORMAT(/,1X,'MEAN = ', F14.4) 285 1113 FORMAT(1X, 'ESTIMATE OF VARIANCE = ', F14.5/) 286 1121 FORMAT(/1X,'SSDEVS = ',F14.4,' MINUS 2 LOG LIKELIHOOD = ', XF14.4, ' STDDEV = ',F14.4/) 287 20000 FORMAT('1','-------------------------------------------', A/,1X,'PROGRAM MIX1CMA CLUSPAC '/ B,1X,'FOR CLUSTERING UNIVARIATE DATA (DATA ON THE LINE)'/ C1X,'DEVELOPED AND PROGRAMMED BY DR. STANLEY L. SCLOVE' D/,1X,'VERSION 1.3 21-MAY-91 '/) 288 1036 FORMAT(1X,'ITERATION ', I2) 289 1040 FORMAT(1X,'SUMS:',6X,9F13.2) 290 1045 FORMAT(1X,'NUMBERS:',3X,9(I10,3X)) 291 15000 FORMAT(18A4) 292 1051 FORMAT(1X,'N = ',I3/) 293 1055 FORMAT(1X,'STD.DEVS.: ',9F13.2) 294 16000 FORMAT(1X,18A4/) 295 70000 FORMAT(1X,'VARIANCES: ',9F13.2) 296 71000 FORMAT(1X,'STD.ERROR=SQRT(WGMS) = ',F13.4/) C 297 1160 FORMAT(1X,'PROGRAM HAS NOT CONVERGED IN 20 ITERATIONS. STOP') 298 1205 FORMAT(1X,'AIC = ', F14.4/) 299 18000 FORMAT(1X,'SCHWARZ CRITERION = ', F14.4/) 300 72000 FORMAT(/1X,'NUMBER OF PARAMETERS = ',I4/) 301 1235 FORMAT(1X,'NO OBSERVATIONS IN GROUP ',I3,'. STOP') C 302 1995 STOP 303 END 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 11 0SYMBOL CROSS REFERENCE DICTIONARY 0PROGRAM NAME: MAIN# 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME Z-EXTENDED COMMON 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +______ ____ ______ ________ ________________________________________ 0AIC R*4 59S 60F 65F 248S 251F 254F AICVEC R*4 A 16 65S 254S 260F ALOG R*4 I 55 61 62 204 249 250 B R*4 A 5 214S 218F 218S 221F BDYADJ R*4 215S 216F 216S 217F 217S 218F C R*4 A 3 UNREFERENCED DENOM R*4 A 15 149S 151F 151S 155F DLOG R*8 I 215 215 DSQ R*4 A 3 140S 141F EXP GI 146 F R*8 AT 11 17 143S 146S 151F 155F 201F FMT R*4 A 6 26S 30 I I*4 30S 30S 31S 32F 33F 33F 34F 39F 40F 41F 42B 134S 135F 135B 138S 140F 143F 146B 148S 149F 151F 151F 151B 153S 155F 155F 155B 157S 158F 158F 159F 161F 161F 163F 163F 164B 168S 168S 169S 169S 176S 177F 178F 178F 179F 179F 179B 192S 193B 198S 201B 224S 225F 225B IC I*4 116S 117F 117F 118F 118B 123S 123S 125S 125S 139S 140F 140F 141F 143F 146B 154S 155F 155F 155B 160S 161F 163F 164B 172S 173F 174F 175F 177F 177F 177F 178F 178F 178F 179F 179F 179F 181F 182F 182F 182F 183F 183F 183F 183F 183F 184F 184F 184F 185F 185F 186F 186F 187B 189S 190B 200S 201F 201B 212S 213F 214F 214F 215F 216F 218F 218B 221S 221S 222S 222S 239S 239S 240S 240S 241S 241S 242S 242S ICLSOL I*4 A 10 135S 225F 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 12 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME Z-EXTENDED COMMON 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +______ ____ ______ ________ ________________________________________ 0ICLUS I*4 A 1 135F 159S 164S 169F 193F 225F ICP1 I*4 213S 214F 215F 216F IGROUP I*4 193S 194F 194F IH I*4 150S 151F 151B INTGER I*4 128S 129F 129B IOTA I*4 A 1 129S 168F ITER I*4 131S 133F 220F 223F 230F 230S 231F K I*4 112S 114F 115F 116F 117F 118F 121F 123F 125F 139F 150F 154F 160F 172F 189F 200F 207F 211F 222F 239F 240F 241F 242F 245F 246F 254F 255F 256B 259S 260F 260F 260F 260B KM1 I*4 211S 212F 221F N I*4 23S 24F 25F 30 31F 54F 55F 128F 134F 138F 148F 153F 157F 166F 168F 169F 176F 192F 198F 207F 224F 243F NC I*4 A 5 190S 194F 194S 240F NOPARM I*4 58S 59F 61F 245S 246F 246S 247F 248F 249F P R*8 AT 12 17 118S 123F 151F 155F 186S 201F 215F 215F PI R*4 53S 54F 203F PP R*8 AT 13 17 155S 158F 161F 163F 177F 178F 179F SCH R*4 61S 62F 63F 66F 249S 250F 252F 255F SCHVEC R*4 A 16 66S 255S 260F SD R*4 A 8 185S 242F SQRT GI 56 185 203 209 SS R*8 AT 7 17 175S 179F 179S 183F SSD R*4 A 7 183S 184F 187F SSDEVS R*4 29S 49S 50F 54F 57F STDDEV R*4 56S 57F STDERR R*4 209S 210F SUM R*8 AT 3 17 174S 178F 178S 182F 183F 183F 239F SUMLNF R*4 197S 204F 204S 206F SUMPXF R*4 199S 201F 201S 203F 203S 204F SUMSQS R*4 28S 33F 33S 49F TEMP R*4 54S 55F TITLE R*4 A 4 18S 22F 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 13 0TAGS: A-ARRAY I-INTRINSIC FUNCTION S-ASSIGNED C-COMMON K-NAMED CONSTANT T-EXPLICITLY TYPED D-DUMMY ARGUMENT N-ENTRY V-INITIAL VALUE E-EQUIVALENCED P-PROMOTED X-EXTERNAL SUBPROGRAM F-STATEMENT FUNCTION Q-PADDED Y-DYNAMIC COMMON G-GENERIC NAME R-SUBPROGRAM NAME Z-EXTENDED COMMON 0NAME TYPE TAG DECLARED REFS (F:REFD S:SET B:REFD/MAY BE SET) +______ ____ ______ ________ ________________________________________ 0TOTAL R*4 27S 32F 32S 48F 49F 49F VAR R*4 A 9 184S 185F 241F VARHAT R*4 50S 52F 56F 62F 120S 121F 121S 127F 141F 196S 203F 217F 243S 244F 250F WGMS R*4 207S 208F 209F WGSS R*4 113S 171S 187F 187S 196F 207F 208F 243F X R*4 A 1 30S 32F 33F 33F 36F 37F 39F 40F 41F 42F 140F 178F 179F 179F XBAR R*4 48S 51F XJ R*4 A 2 68S 69S 70S 71S 72S 73S 74S 75S 76S 77S 78S 79S 80S 81S 82S 83S 84S 85S 86S 87S 88S 89S 90S 91S 92S 93S 94S 95S 96S 97S 98S 99S 100S 101S 102S 103S 104S 105S 106S 107S 108S 109S 110S 111S 118F XK R*4 115S XKASH R*4 62S 64F 67F 250S 253F 256F XKSVEC R*4 A 16 67S 256S 260F XMAX R*4 36S 41F 42S 47F 117F 120F XMEAN R*4 A 5 117S 125F 140F 182S 214F 214F 216F 216F 222F XMIN R*4 37S 39F 40S 45F 117F 117F 120F XMNDSQ R*4 A 1 UNREFERENCED XMN2LL R*4 55S 57F 59F 61F 206S 208F 248F 249F XMXPR R*4 A 14 158S 161F 163S XN R*4 24S 48F 49F 50F 61F 186F 196F 249F XNC R*4 A 12 173S 177F 177S 181F 182F 183F 184F 186F ZSQ R*4 141S 142F 146F 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 14 0LABEL CROSS REFERENCE DICTIONARY 0TAGS: A-USED AS ARGUMENT F-FORMAT S-USED IN ASSIGN STATEMENT B-OBJECT OF BRANCH N-NON-EXECUTABLE 0 LABEL TAG DEFINED REFERENCED +____________ ___ _______ ___________________________________________ 0 6 188 172 8 B 165 157 160 162 9 B 163 161 66 191 189 67 180 176 100 43 31 101 119 116 102 B 147 138 139 144 105 130 128 110 B 145 142 125 B 235 181 159 202 200 161 205 198 200 B 170 166 400 195 192 405 152 148 150 406 156 153 154 498 B 36 34 499 B 38 35 500 219 212 530 B 238 228 555 B 227 224 225 560 B 137 133 565 136 134 570 B 233 231 600 B 229 223 226 601 B 132 232 605 261 259 995 B 257 112 234 237 1017 NF 273 127 1020 NF 278 222 1021 NF 279 208 1025 NF 271 123 1035 NF 280 221 1036 NF 288 220 1040 NF 289 239 1045 NF 290 240 1051 NF 292 25 1055 NF 293 242 1100 NF 274 244 1112 NF 284 51 1113 NF 285 52 1121 NF 286 57 1151 NF 281 44 1152 NF 282 46 1160 NF 297 233 1205 NF 298 60 251 1235 NF 301 236 1995 302 UNREFERENCED 10000 NF 262 23 1LEVEL 2.5.0 (JUNE 1991) VS FORTRAN MAY 21, 1992 23:39:13 NAME:MAIN# PAGE: 15 0TAGS: A-USED AS ARGUMENT F-FORMAT S-USED IN ASSIGN STATEMENT B-OBJECT OF BRANCH N-NON-EXECUTABLE 0 LABEL TAG DEFINED REFERENCED +____________ ___ _______ ___________________________________________ 0 11000 NF 263 167 12000 NF 264 168 13000 NF 265 169 14000 NF 268 124 15000 NF 291 18 26 16000 NF 294 22 17000 NF 283 64 253 18000 NF 299 63 252 19000 NF 270 125 20000 NF 287 19 21000 NF 275 20 22000 NF 276 21 23000 NF 277 114 24000 NF 272 126 25000 NF 269 122 33000 NF 266 260 34000 NF 267 258 70000 NF 295 241 71000 NF 296 210 72000 NF 300 247 0 NUMBER MODULE LEVEL ISN VS FORTRAN ERROR MESSAGES + ______ ______ _____ ___ __ _______ _____ ________ 0ILX3470I VPCQ 0(I) "XMIN,XMAX" MAY BE UNINITIALIZED WHEN USED 0*STATISTICS* SOURCE STATEMENTS: 301, PROGRAM SIZE: 499660 BYTES, PROGRAM NAME: MAIN#, PAGE: 1 *STATISTICS* 1 DIAGNOSTIC GENERATED. SEVERITY CODE IS 0. **MAIN#** END OF COMPILATION 1 ****** TIME STAMP: 92.14223.39.13