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.experiment.evaluation.cluster.analyser; 031 032import java.util.Map; 033 034import org.openimaj.util.pair.IntIntPair; 035 036/** 037 * Create a measure of purity 038 * @author Sina Samangooei (ss@ecs.soton.ac.uk) 039 */ 040public class PurityClusterAnalyser implements ClusterAnalyser<PurityAnalysis>{ 041 042 @Override 043 public PurityAnalysis analyse(int[][] correct, int[][] estimated) { 044 Map<Integer,Integer> invCor = ClusterAnalyserUtils.invert(correct); 045 Map<Integer,Integer> invEst = ClusterAnalyserUtils.invert(estimated); 046 PurityAnalysis ret = new PurityAnalysis(); 047 double sumPurity = 0; 048 for (int k = 0; k < estimated.length; k++) { 049 IntIntPair maxClassCount = ClusterAnalyserUtils.findMaxClassCount(estimated[k],invCor); 050 sumPurity+=maxClassCount.second; 051 } 052 ret.purity = sumPurity/invEst.size(); 053 return ret; 054 } 055 056 057 058}