dynamicstrategy.h

Go to the documentation of this file.

/* This software and supporting documentation are distributed by
 *     Institut Federatif de Recherche 49
 *     CEA/NeuroSpin, Batiment 145,
 *     91191 Gif-sur-Yvette cedex
 *     France
 *
 * This software is governed by the CeCILL-B license under
 * French law and abiding by the rules of distribution of free software.
 * You can  use, modify and/or redistribute the software under the
 * terms of the CeCILL-B license as circulated by CEA, CNRS
 * and INRIA at the following URL "http://www.cecill.info".
 *
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 *
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 *
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL-B license and that you accept its terms.
 */
 
 
 
#ifndef DYNAMICSTRATEGY_H
#define DYNAMICSTRATEGY_H
 
#include <aims/classification/kmeansstrategy.h>
#include <aims/classification/individuals.h>
#include <aims/classification/distance_d.h>
#include <aims/vector/vector.h>
#include <vector>
#include <list>
 
namespace aims{
  template<class T>
    class DynamicStrategy : public KmeansStrategy<T>{
    public:
    
    DynamicStrategy( const DynamicStrategy<T>& dynamicStrat ) ;
    DynamicStrategy( int nbIterations = 50, 
                     DistanceType distanceType = NORM2SQR, 
                     int beginIndex = 0, int endIndex = -1,
                     const std::vector< aims::Individuals<T> >& codeVector = std::vector< Individuals<T> >() ) ;
    virtual ~DynamicStrategy() ;
    virtual ClassifStrategy<T> * clone() const ;
    
    virtual double iterate( int& nbOfIterations, 
                            std::vector< std::list< Individuals<T> > >& classes ) ;
/*     void centerComputation( int c, unsigned int card,  */
/*                          bool add, const Individuals<T>& ind ) ; */
    void centerComputation( int cNew, int cOld, unsigned int cardNew, 
                            unsigned int cardOld, const Individuals<T>& ind ) ;
//    void classAnalyse( int c, const std::vector< std::list< Individuals<T> > >& classes ) ;
 
  } ;
}
 
#endif