forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathspaeth.html
312 lines (282 loc) · 8.24 KB
/
spaeth.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
<html>
<head>
<title>
SPAETH - Cluster Analysis Tools
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
SPAETH <br> Cluster Analysis Tools
</h1>
<hr>
<p>
<b>SPAETH</b>
is a FORTRAN90 library which
analyzes data
by grouping it into clusters.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/asa058/asa058.html">
ASA058</a>,
a FORTRAN90 library which
implements the K-means algorithm of Sparks.
</p>
<p>
<a href = "../../f_src/asa136/asa136.html">
ASA136</a>,
a FORTRAN90 library which
implements the Hartigan and Wong clustering algorithm.
</p>
<p>
<a href = "../../datasets/cities/cities.html">
CITIES</a>,
a dataset directory which
contains sets of information about cities and the distances
between them;
</p>
<p>
<a href = "../../f_src/cities/cities.html">
CITIES</a>,
a FORTRAN90 library which
handles various problems associated with a set of "cities" on a map.
</p>
<p>
<a href = "../../f_src/kmeans/kmeans.html">
KMEANS</a>,
a FORTRAN90 library which
contains several different algorithms for the K-Means problem.
</p>
<p>
<a href = "../../f_src/lau_np/lau_np.html">
LAU_NP</a>,
a FORTRAN90 library which
implements heuristic algorithms for various NP-hard combinatorial problems.
</p>
<p>
<a href = "../../f_src/point_merge/point_merge.html">
POINT_MERGE</a>,
a FORTRAN90 library which
considers N points in M dimensional space, and counts or indexes
the unique or "tolerably unique" items.
</p>
<p>
<a href = "../../datasets/spaeth/spaeth.html">
SPAETH</a>,
a dataset directory which
contains datasets for cluster analysis;
</p>
<p>
<a href = "../../f_src/spaeth2/spaeth2.html">
SPAETH2</a>,
a FORTRAN90 library which
can cluster data according to various principles.
</p>
<p>
<a href = "../../datasets/spaeth2/spaeth2.html">
SPAETH2</a>,
a dataset directory which
contains datasets for cluster analysis;
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Helmuth Spaeth,<br>
Cluster Dissection and Analysis,<br>
Theory, FORTRAN Programs, Examples,<br>
Ellis Horwood, 1985,<br>
QA278 S68213.
</li>
<li>
Helmuth Spaeth,<br>
Cluster Analysis Algorithms
for Data Reduction and Classification of Objects,<br>
Ellis Horwood, 1980,<br>
QA278 S6813.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "spaeth.f90">spaeth.f90</a>, the source code.
</li>
<li>
<a href = "spaeth.sh">spaeth.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "spaeth_prb.f90">spaeth_prb.f90</a>, a sample problem.
</li>
<li>
<a href = "spaeth_prb.sh">spaeth_prb.sh</a>,
commands to compile, link and run the sample problem.
</li>
<li>
<a href = "spaeth_prb_output.txt">spaeth_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>BVPEXM</b> implements the exchange algorithm on binary data for the L1 criterion.
</li>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>CH_EQI</b> is a case insensitive comparison of two characters for equality.
</li>
<li>
<b>CH_TO_DIGIT</b> returns the integer value of a base 10 digit.
</li>
<li>
<b>CLREXM</b> implements the exchange algorithm for clusterwise linear regression.
</li>
<li>
<b>CLUSTER_D_SHOW</b> makes a typewriter plot of points with associated labels.
</li>
<li>
<b>CLUSTER_D_PRINT</b> prints out the cluster information.
</li>
<li>
<b>DATA_D_READ</b> reads a real data set stored in a file.
</li>
<li>
<b>DATA_D_SHOW</b> makes a typewriter plot of a real data set.
</li>
<li>
<b>DATA_D_WRITE</b> writes a real data set into a file.
</li>
<li>
<b>DATA_D2_READ</b> reads a data set of pairs of real numbers stored in a file.
</li>
<li>
<b>DATA_D2_WRITE</b> writes a data set of pairs of real numbers into a file.
</li>
<li>
<b>DATA_I_PRINT</b> prints an integer matrix.
</li>
<li>
<b>DATA_I_READ</b> reads an integer data set stored in a file.
</li>
<li>
<b>DATA_I_SHOW</b> makes a typewriter plot of an integer data set.
</li>
<li>
<b>DATA_SIZE</b> counts the size of a data set stored in a file.
</li>
<li>
<b>DETEXM</b> implements the exchange algorithm for the determinant criterion.
</li>
<li>
<b>DISTW</b> computes the squared generalized distance of points from centers.
</li>
<li>
<b>DWBEXM</b> implements the exchange method for the adaptive distance criterion.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>I4_TO_A</b> returns the I-th alphabetic character.
</li>
<li>
<b>INEXCL</b> computes auxilliary arrays F, T and R used to control exchanges.
</li>
<li>
<b>LDLT</b> computes a Cholesky decomposition of the matrix A.
</li>
<li>
<b>MEANS</b> computes the mean vectors for a given partition.
</li>
<li>
<b>MEDIAN</b> computes quantities needed for the OVPEXM objective function.
</li>
<li>
<b>OVPEXM</b> implements the exchange algorithm for the L1 criterion.
</li>
<li>
<b>OVREXM</b> implements the exchange algorithm for the L1 criterion.
</li>
<li>
<b>OVSEXM</b> implements the exchange algorithm for the L1 criterion.
</li>
<li>
<b>R8MAT_PRINT</b> prints an R8MAT.
</li>
<li>
<b>RMAT_PRINT_SOME</b> prints some of an R8MAT.
</li>
<li>
<b>RANDP</b> randomly partitions a set of M items into N clusters.
</li>
<li>
<b>S_TO_I4</b> reads an integer value from a string.
</li>
<li>
<b>S_TO_R8</b> reads a real number from a string.
</li>
<li>
<b>S_WORD_COUNT</b> counts the number of "words" in a string.
</li>
<li>
<b>TIHEXM</b> implements the exchange algorithm for center-free critera.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>TRACES</b> computes the per-cluster and total variances.
</li>
<li>
<b>TRAFOR</b> standardizes a data matrix.
</li>
<li>
<b>TRWEXM</b> implements the exchange method for the variance criterion.
</li>
<li>
<b>TRWMDM</b> implements the minimal distance method for the variance criterion.
</li>
<li>
<b>UPDATE</b> updates the Cholesky decomposition of a matrix.
</li>
<li>
<b>URAND</b> returns a pseudo-random number uniformly distributed in [0,1].
</li>
<li>
<b>WJSCAT</b> calculates the scatter matrix for a given cluster.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 27 November 2006.
</i>
</body>
<!-- Initial html skeleton created by HTMLINDEX. -->
</html>