package de.lmu.ifi.dbs.elki.evaluation.clustering.pairsegments; /* This file is part of ELKI: Environment for Developing KDD-Applications Supported by Index-Structures Copyright (C) 2012 Ludwig-Maximilians-Universität München Lehr- und Forschungseinheit für Datenbanksysteme ELKI Development Team This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more details. You should have received a copy of the GNU Affero General Public License along with this program. If not, see . */ import java.util.List; import de.lmu.ifi.dbs.elki.data.Clustering; import de.lmu.ifi.dbs.elki.evaluation.Evaluator; import de.lmu.ifi.dbs.elki.result.HierarchicalResult; import de.lmu.ifi.dbs.elki.result.Result; import de.lmu.ifi.dbs.elki.result.ResultUtil; /** * Evaluate clustering results by building segments for their pairs: shared * pairs and differences. * * @author Sascha Goldhofer * @author Erich Schubert * * @apiviz.uses Clustering * @apiviz.uses Segments */ public class ClusterPairSegmentAnalysis implements Evaluator { /** * Constructor. */ public ClusterPairSegmentAnalysis() { super(); } /** * Perform clusterings evaluation */ @Override public void processNewResult(HierarchicalResult baseResult, Result result) { // Get all new clusterings // TODO: handle clusterings added later, too. Can we update the result? List> clusterings = ResultUtil.getClusteringResults(result); // Abort if not enough clusterings to compare if(clusterings.size() < 2) { return; } // create segments Segments segments = new Segments(clusterings, baseResult); baseResult.getHierarchy().add(result, segments); } }