1 /**
2 * Copyright (c) 2011, The University of Southampton and the individual contributors.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * * Redistributions of source code must retain the above copyright notice,
9 * this list of conditions and the following disclaimer.
10 *
11 * * Redistributions in binary form must reproduce the above copyright notice,
12 * this list of conditions and the following disclaimer in the documentation
13 * and/or other materials provided with the distribution.
14 *
15 * * Neither the name of the University of Southampton nor the names of its
16 * contributors may be used to endorse or promote products derived from this
17 * software without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
21 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
23 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
24 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
26 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30 package org.openimaj.demos;
31
32 import gnu.trove.map.hash.TIntIntHashMap;
33
34 import java.io.File;
35 import java.util.ArrayList;
36 import java.util.List;
37
38 import org.openimaj.ml.clustering.FloatCentroidsResult;
39 import org.openimaj.ml.clustering.kmeans.FloatKMeans;
40 import org.openimaj.util.array.ArrayUtils;
41 import org.openimaj.util.iterator.TextLineIterable;
42
43 import cern.colt.Arrays;
44
45 public class ClusterTest {
46 public static void main(String[] args) {
47 final File f = new File("/Users/jsh2/sed/histograms-uploaded.txt");
48
49 System.out.println("Loading data");
50 final List<float[]> vectors = new ArrayList<float[]>();
51 float[] mean = null;
52 for (final String line : new TextLineIterable(f)) {
53 final String[] parts = line.split(" ");
54 final float[] vector = new float[parts.length];
55 for (int i = 0; i < vector.length; i++) {
56 vector[i] = Float.parseFloat(parts[i]);
57 }
58 vectors.add(vector);
59
60 if (mean == null) {
61 mean = vector.clone();
62 } else {
63 ArrayUtils.sum(mean, vector);
64 }
65 }
66
67 System.out.println("Done");
68
69 final boolean cluster = true;
70
71 ArrayUtils.divide(mean, vectors.size());
72 // System.out.println(Arrays.toString(mean));
73
74 if (cluster) {
75 final FloatKMeans km = FloatKMeans.createExact(50);
76 final FloatCentroidsResult result = km.cluster(vectors.toArray(new float[vectors.size()][]));
77
78 final TIntIntHashMap map = new TIntIntHashMap();
79 for (final float[] vector : vectors) {
80 final int clustid = result.defaultHardAssigner().assign(vector);
81 map.adjustOrPutValue(clustid, 1, 1);
82 }
83
84 for (int i = 0; i < result.centroids.length; i++) {
85 float[] r = result.centroids[i];
86
87 r = ArrayUtils.divide(r, ArrayUtils.maxValue(r));
88
89 System.out.println(Arrays.toString(r).replace("[", "").replace("]", ""));
90 }
91 }
92 }
93 }