1 /* =============================================================================
5 * =============================================================================
9 * Takes as input a file:
10 * ascii file: containing 1 data point per line
11 * binary file: first int is the number of objects
12 * 2nd int is the no. of features of each object
14 * This example performs a fuzzy c-means clustering on the data. Fuzzy clustering
15 * is performed using min to max clusters and the clustering that gets the best
16 * score according to a compactness and separation criterion are returned.
22 * ECE Department Northwestern University
23 * email: wkliao@ece.northwestern.edu
29 * Northwestern University
34 * Port to Java version
36 * University of California, Irvine
38 * =============================================================================
40 * ------------------------------------------------------------------------
42 * For the license of kmeans, please see kmeans/LICENSE.kmeans
44 * ------------------------------------------------------------------------
46 * Unless otherwise noted, the following license applies to STAMP files:
48 * Copyright (c) 2007, Stanford University
49 * All rights reserved.
51 * Redistribution and use in source and binary forms, with or without
52 * modification, are permitted provided that the following conditions are
55 * * Redistributions of source code must retain the above copyright
56 * notice, this list of conditions and the following disclaimer.
58 * * Redistributions in binary form must reproduce the above copyright
59 * notice, this list of conditions and the following disclaimer in
60 * the documentation and/or other materials provided with the
63 * * Neither the name of Stanford University nor the names of its
64 * contributors may be used to endorse or promote products derived
65 * from this software without specific prior written permission.
67 * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
68 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
69 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
70 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
71 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
72 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
73 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
74 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
75 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
76 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
77 * THE POSSIBILITY OF SUCH DAMAGE.
79 * =============================================================================
82 public class KMeans extends Thread {
84 * User input for max clusters
89 * User input for min clusters
94 * Check for Binary file
99 * Using zscore transformation for cluster center
100 * deviating from distribution's mean
102 int use_zscore_transform;
105 * Input file name used for clustering
110 * Total number of threads
115 * threshold until which kmeans cluster continues
125 * Global arguments for threads
130 * Output: Number of best clusters
135 * Output: Cluster centers
137 float[][] cluster_centres;
142 float[][] attributes;
152 use_zscore_transform = 1;
153 threshold = (float) 0.001;
158 public KMeans(int threadid, GlobalArgs g_args) {
159 this.threadid = threadid;
160 this.g_args = g_args;
164 public KMeans(int threadid, GlobalArgs g_args, int nthreads, int use_zscore_transform,
165 int max_nclusters, int min_nclusters, float threshold,
166 float[][] attributes, int numObjects, int numAttributes) {
167 this.threadid = threadid;
168 this.g_args = g_args;
169 //this.nthreads = nthreads;
170 //this.use_zscore_transform = use_zscore_transform;
171 //this.max_nclusters = max_nclusters;
172 //this.min_nclusters = min_nclusters;
173 //this.threshold = threshold;
174 //this.attributes = attributes;
175 //this.numObjects = numObjects;
176 //this.numAttributes = numAttributes;
180 Barrier barr = new Barrier("128.195.136.162");
182 Barrier.enterBarrier(barr);
184 Normal.work(threadid, g_args);
186 Barrier.enterBarrier(barr);
190 /* =============================================================================
192 * =============================================================================
194 public static void main(String[] args) {
196 int MAX_LINE_LENGTH = 1000000; /* max input is 400000 one digit input + spaces */
197 int[] mid = new int[8];
198 mid[0] = (128<<24)|(195<<16)|(136<<8)|162; //dc-1.calit2
199 mid[1] = (128<<24)|(195<<16)|(136<<8)|163; //dc-2.calit2
200 mid[2] = (128<<24)|(195<<16)|(136<<8)|164; //dc-3.calit2
201 mid[3] = (128<<24)|(195<<16)|(136<<8)|165; //dc-4.calit2
202 mid[4] = (128<<24)|(195<<16)|(136<<8)|166; //dc-5.calit2
203 mid[5] = (128<<24)|(195<<16)|(136<<8)|167; //dc-6.calit2
204 mid[6] = (128<<24)|(195<<16)|(136<<8)|168; //dc-7.calit2
205 mid[7] = (128<<24)|(195<<16)|(136<<8)|169; //dc-8.calit2
209 * Read options fron the command prompt
213 KMeans.parseCmdLine(args, kms);
214 nthreads = kms.nthreads;
215 System.out.println("nthreads= " + kms.nthreads);
217 /* Initiate Barriers */
218 BarrierServer mybarr;
221 mybarr = global new BarrierServer(nthreads);
223 mybarr.start(mid[0]);
226 if (kms.max_nclusters < kms.min_nclusters) {
227 System.out.println("Error: max_clusters must be >= min_clusters\n");
232 float[][] attributes;
233 int numAttributes = 0;
237 * From the input file, get the numAttributes (columns in txt file) and numObjects (rows in txt file)
239 if (kms.isBinaryFile == 1) {
240 System.out.println("TODO: Unimplemented Binary file option\n");
244 FileInputStream inputFile = new FileInputStream(kms.filename);
245 byte b[] = new byte[MAX_LINE_LENGTH];
247 while ((n = inputFile.read(b)) != 0) {
248 for (int i = 0; i < n; i++) {
254 inputFile = new FileInputStream(kms.filename);
256 if((line = inputFile.readLine()) != null) {
258 boolean prevWhiteSpace = true;
259 while(index < line.length()) {
260 char c = line.charAt(index++);
261 boolean currWhiteSpace = Character.isWhitespace(c);
262 if(prevWhiteSpace && !currWhiteSpace){
265 prevWhiteSpace = currWhiteSpace;
270 /* Ignore the first attribute: numAttributes = 1; */
271 numAttributes = numAttributes - 1;
273 /* Allocate new shared objects and read attributes of all objects */
276 buf = global new float[numObjects][numAttributes];
277 attributes = global new float[numObjects][numAttributes];
280 KMeans.readFromFile(inputFile, kms.filename, tmp_buf, MAX_LINE_LENGTH);
281 System.out.println("Finished Reading from file ......");
284 * The core of the clustering
287 int len = kms.max_nclusters - kms.min_nclusters + 1;
294 km = global new KMeans[nthreads];
295 g_args = global new GlobalArgs();
296 g_args.nthreads = nthreads;
297 for(int x = 0; x < numObjects; x++) {
298 for(int y = 0; y < numAttributes; y++) {
299 attributes[x][y] = buf[x][y];
305 /* Create and Start Threads */
306 for(int i = 1; i<nthreads; i++) {
307 km[i] = global new KMeans(i, g_args, nthreads, kms.use_zscore_transform,
308 kms.max_nclusters, kms.min_nclusters, kms.threshold, attributes, numObjects, numAttributes);
314 boolean waitfordone=true;
322 for(int i = 1; i<nthreads; i++) {
329 System.out.println("Finished Starting threads......");
331 for (int i = 0; i < nloops; i++) {
333 // Since zscore transform may perform in cluster() which modifies the
334 // contents of attributes[][], we need to re-store the originals
336 float[][] tmp_attributes;
337 GlobalArgs tmp_g_args;
339 for(int x = 0; x < numObjects; x++) {
340 for(int y = 0; y < numAttributes; y++) {
341 attributes[x][y] = buf[x][y];
344 tmp_attributes = attributes;
349 Cluster.cluster_exec(nthreads,
352 tmp_attributes, // [numObjects][numAttributes]
353 kms, //main class that holds users inputs from command prompt and output arrays that need to be filled
354 tmp_g_args); // Global arguments common to all threads
357 System.out.println("Printing output......");
358 System.out.println("Best_nclusters= " + kms.best_nclusters);
360 /* Output: the coordinates of the cluster centres */
364 for (int i = 0; i < kms.best_nclusters; i++) {
365 System.out.print(i + " ");
366 for (int j = 0; j < numAttributes; j++) {
367 System.out.print(kms.cluster_centres[i][j] + " ");
369 System.out.println("\n");
374 System.out.println("Finished......\n");
378 public static void parseCmdLine(String args[], KMeans km) {
381 while (i < args.length && args[i].startsWith("-")) {
384 if(arg.equals("-m")) {
385 if(i < args.length) {
386 km.max_nclusters = new Integer(args[i++]).intValue();
388 } else if(arg.equals("-n")) {
389 if(i < args.length) {
390 km.min_nclusters = new Integer(args[i++]).intValue();
392 } else if(arg.equals("-t")) {
393 if(i < args.length) {
394 km.threshold = new Integer(args[i++]).intValue();
396 } else if(arg.equals("-i")) {
397 if(i < args.length) {
398 km.filename = args[i++];
400 } else if(arg.equals("-b")) {
401 if(i < args.length) {
402 km.isBinaryFile = new Integer(args[i++]).intValue();
404 } else if(arg.equals("-z")) {
405 if(i < args.length) {
408 } else if(arg.equals("-nthreads")) {
409 if(i < args.length) {
410 km.nthreads = new Integer(args[i++]).intValue();
412 } else if(arg.equals("-h")) {
416 if(km.nthreads == 0 || km.filename == null) {
422 * The usage routine which describes the program options.
424 public void usage() {
425 System.out.println("usage: ./kmeans -m <max_clusters> -n <min_clusters> -t <threshold> -i <filename> -nthreads <threads>\n");
426 System.out.println( " -i filename: file containing data to be clustered\n");
427 System.out.println( " -b input file is in binary format\n");
428 System.out.println( " -m max_clusters: maximum number of clusters allowed\n");
429 System.out.println( " -n min_clusters: minimum number of clusters allowed\n");
430 System.out.println( " -z : don't zscore transform data\n");
431 System.out.println( " -t threshold : threshold value\n");
432 System.out.println( " -nthreads : number of threads\n");
437 * Read attributes from the input file into an array
439 public static void readFromFile(FileInputStream inputFile, String filename, float[][] buf, int MAX_LINE_LENGTH) {
440 inputFile = new FileInputStream(filename);
444 byte b[] = new byte[MAX_LINE_LENGTH];
446 byte oldbytes[]=null;
449 atomic { //FIXME: temporary fix Note that this
450 // transaction will never abort because it is only executed
451 // on master machine and therefore the fileread native call is
452 //allowed as a warning
453 while ((n = inputFile.read(b)) != 0) {
457 if (oldbytes!=null) {
463 byte newbytes[]= new byte[x+oldbytes.length];
464 for(int ii=0;ii<oldbytes.length;ii++)
465 newbytes[ii]=oldbytes[ii];
466 for(int ii=0;ii<x;ii++)
467 newbytes[ii+oldbytes.length]=b[ii];
468 x++; //skip past space
470 buf[i][j]=(float)Double.parseDouble(new String(newbytes, 0, newbytes.length));
484 x=y;//push end to current character
488 //need to continue for another read
489 oldbytes=new byte[y-x];
490 for(int ii=0;ii<(y-x);ii++)
491 oldbytes[ii]=b[ii+x];
495 //otherwise x is beginning of character string, y is end
497 buf[i][j]=(float)Double.parseDouble(new String(b,x,y-x));
499 x=y;//skip to end of number
500 x++;//skip past space
509 /* =============================================================================
513 * =============================================================================