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.ml.clustering.spectral;
031
032import java.util.List;
033
034import org.openimaj.util.pair.IndependentPair;
035
036/**
037 * The stopping condition for a multiview spectral clustering algorithm
038 * @author Sina Samangooei (ss@ecs.soton.ac.uk)
039 *
040 */
041public interface StoppingCondition {
042        /**
043         * Called once at the beggining of each full iteration
044         * 
045         * @param answers the list of current eigen vectors 
046         * @return true if this iteration should not happen
047         */
048        public boolean stop(List<IndependentPair<double[], double[][]>> answers);
049        
050        /**
051         * Counts the iterations 
052         * @author Sina Samangooei (ss@ecs.soton.ac.uk)
053         *
054         */
055        public static final class HardCoded implements StoppingCondition{
056                int count = 0;
057                private int max;
058                /**
059                 * @param iters
060                 */
061                public HardCoded(int iters) {
062                        this.max = iters;
063                }
064                @Override
065                public boolean stop(List<IndependentPair<double[], double[][]>> answers) {                      
066                        return count ++ < this.max;
067                }
068                
069        }
070}
071