forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathasa113.html
256 lines (215 loc) · 6.46 KB
/
asa113.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
<html>
<head>
<title>
ASA113 - A Transfer Algorithm for Non-hierarchical Classification
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
ASA113 <br> A Transfer Algorithm for Non-hierarchical Classification
</h1>
<hr>
<p>
<b>ASA113</b>
is a C++ library which
divides M points in N dimensions into K clusters
seeking the division which minimizes a user-defined criterion,
by Banfield and Bassill.
</p>
<p>
<b>ASA113</b> is in some sense a generalization of the K-means algorithm,
because the user is allowed to choose the criterion function to be
minimized, and because the algorithm considers both all possible transfers
of an object from one class to another, and all possible exchanges that
swap two objects.
</p>
<p>
However, because it is <i>not</i> a K-means algorithm,
there is a significant amount of work off-loaded onto the user, and
the task of evaluating the change in the criterion function can be far
more expensive than in the K-means setting, and the consideration of
all possible exchanges can result in an explosion in the running time
for large data sets.
</p>
<p>
Thus, the algorithm should not be the first choice if a K-means
calculation is really what is desired, and it may be far too expensive
to use if the size of the data set is significant.
</p>
<p>
<b>ASA113</b> is Applied Statistics Algorithm 113. Source code for many
Applied Statistics Algorithms is available through
<a href = "http://lib.stat.cmu.edu/apstat">STATLIB</a>.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>ASA113</b> is available in
<a href = "../../c_src/asa113/asa113.html">a C version</a> and
<a href = "../../cpp_src/asa113/asa113.html">a C++ version</a> and
<a href = "../../f77_src/asa113/asa113.html">a FORTRAN77 version</a> and
<a href = "../../f_src/asa113/asa113.html">a FORTRAN90 version</a> and
<a href = "../../m_src/asa113/asa113/html">a MATLAB version.</a>
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/asa058/asa058.html">
ASA058</a>,
a C++ library which
carries out the K-means algorithm for clustering data.
</p>
<p>
<a href = "../../cpp_src/asa136/asa136.html">
ASA136</a>,
a C++ library which
carries out the K-means algorithm for clustering data.
</p>
<p>
<a href = "../../cpp_src/cities/cities.html">
CITIES</a>,
a C++ library which
handles various problems associated
with a set of "cities" on a map.
</p>
<p>
<a href = "../../datasets/cities/cities.html">
CITIES</a>,
a dataset directory which
contains a number of city distance datasets.
</p>
<p>
<a href = "../../cpp_src/kmeans/kmeans.html">
KMEANS</a>,
a C++ library which
contains several implementations of the H-Means and K-Means clustering algorithms.
</p>
<p>
<a href = "../../f_src/lau_np/lau_np.html">
LAU_NP</a>,
a FORTRAN90 library which
contains heuristic algorithms for the K-center and K-median problems.
</p>
<p>
<a href = "../../f_src/spaeth/spaeth.html">
SPAETH</a>,
a FORTRAN90 library which
clusters data according to various principles.
</p>
<p>
<a href = "../../datasets/spaeth/spaeth.html">
SPAETH</a>,
a dataset directory which
contains test data for clustering.
</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 test data for clustering.
</p>
<h3 align = "center">
Author:
</h3>
<p>
Original FORTRAN77 version by Banfield and Bassill;
C++ version by John Burkardt.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Colin Banfield, LC Bassill,<br>
Algorithm AS 113:
A transfer for non-hierarchichal classification,<br>
Applied Statistics,<br>
Volume 26, Number 2, 1977, pages 206-210.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "asa113.cpp">asa113.cpp</a>, the source code.
</li>
<li>
<a href = "asa113.hpp">asa113.hpp</a>, the include file.
</li>
<li>
<a href = "asa113.sh">asa113.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "asa113_prb.cpp">asa113_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "asa113_prb.sh">asa113_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "points_100.txt">points_100.txt</a>,
a sample dataset of 100 points in 2D, to be arranged into 5 classes.
</li>
<li>
<a href = "asa113_prb_output.txt">asa113_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>SWAP</b> interchanges objects between different classes to improve a criterion.
</li>
<li>
<b>TIMESTAMP</b> prints out the current YMDHMS date as a timestamp.
</li>
<li>
<b>TRNSFR</b> transfers objects between classes to improve a criterion.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 17 February 2008.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>