001/** 002 * Copyright (c) 2011, The University of Southampton and the individual contributors. 003 * All rights reserved. 004 * 005 * Redistribution and use in source and binary forms, with or without modification, 006 * are permitted provided that the following conditions are met: 007 * 008 * * Redistributions of source code must retain the above copyright notice, 009 * this list of conditions and the following disclaimer. 010 * 011 * * Redistributions in binary form must reproduce the above copyright notice, 012 * this list of conditions and the following disclaimer in the documentation 013 * and/or other materials provided with the distribution. 014 * 015 * * Neither the name of the University of Southampton nor the names of its 016 * contributors may be used to endorse or promote products derived from this 017 * software without specific prior written permission. 018 * 019 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND 020 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 021 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 022 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR 023 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 024 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 025 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 026 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 027 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 028 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 029 */ 030package org.openimaj.demos; 031 032import gnu.trove.map.hash.TIntIntHashMap; 033 034import java.io.File; 035import java.util.ArrayList; 036import java.util.List; 037 038import org.openimaj.ml.clustering.FloatCentroidsResult; 039import org.openimaj.ml.clustering.kmeans.FloatKMeans; 040import org.openimaj.util.array.ArrayUtils; 041import org.openimaj.util.iterator.TextLineIterable; 042 043import cern.colt.Arrays; 044 045public class ClusterTest { 046 public static void main(String[] args) { 047 final File f = new File("/Users/jsh2/sed/histograms-uploaded.txt"); 048 049 System.out.println("Loading data"); 050 final List<float[]> vectors = new ArrayList<float[]>(); 051 float[] mean = null; 052 for (final String line : new TextLineIterable(f)) { 053 final String[] parts = line.split(" "); 054 final float[] vector = new float[parts.length]; 055 for (int i = 0; i < vector.length; i++) { 056 vector[i] = Float.parseFloat(parts[i]); 057 } 058 vectors.add(vector); 059 060 if (mean == null) { 061 mean = vector.clone(); 062 } else { 063 ArrayUtils.sum(mean, vector); 064 } 065 } 066 067 System.out.println("Done"); 068 069 final boolean cluster = true; 070 071 ArrayUtils.divide(mean, vectors.size()); 072 // System.out.println(Arrays.toString(mean)); 073 074 if (cluster) { 075 final FloatKMeans km = FloatKMeans.createExact(50); 076 final FloatCentroidsResult result = km.cluster(vectors.toArray(new float[vectors.size()][])); 077 078 final TIntIntHashMap map = new TIntIntHashMap(); 079 for (final float[] vector : vectors) { 080 final int clustid = result.defaultHardAssigner().assign(vector); 081 map.adjustOrPutValue(clustid, 1, 1); 082 } 083 084 for (int i = 0; i < result.centroids.length; i++) { 085 float[] r = result.centroids[i]; 086 087 r = ArrayUtils.divide(r, ArrayUtils.maxValue(r)); 088 089 System.out.println(Arrays.toString(r).replace("[", "").replace("]", "")); 090 } 091 } 092 } 093}