A.I.M.S algorithms


kmeansstrategy.h
Go to the documentation of this file.
1 /* This software and supporting documentation are distributed by
2  * Institut Federatif de Recherche 49
3  * CEA/NeuroSpin, Batiment 145,
4  * 91191 Gif-sur-Yvette cedex
5  * France
6  *
7  * This software is governed by the CeCILL-B license under
8  * French law and abiding by the rules of distribution of free software.
9  * You can use, modify and/or redistribute the software under the
10  * terms of the CeCILL-B license as circulated by CEA, CNRS
11  * and INRIA at the following URL "http://www.cecill.info".
12  *
13  * As a counterpart to the access to the source code and rights to copy,
14  * modify and redistribute granted by the license, users are provided only
15  * with a limited warranty and the software's author, the holder of the
16  * economic rights, and the successive licensors have only limited
17  * liability.
18  *
19  * In this respect, the user's attention is drawn to the risks associated
20  * with loading, using, modifying and/or developing or reproducing the
21  * software by the user in light of its specific status of free software,
22  * that may mean that it is complicated to manipulate, and that also
23  * therefore means that it is reserved for developers and experienced
24  * professionals having in-depth computer knowledge. Users are therefore
25  * encouraged to load and test the software's suitability as regards their
26  * requirements in conditions enabling the security of their systems and/or
27  * data to be ensured and, more generally, to use and operate it in the
28  * same conditions as regards security.
29  *
30  * The fact that you are presently reading this means that you have had
31  * knowledge of the CeCILL-B license and that you accept its terms.
32  */
33 
34 
35 
36 #ifndef KMEANSSTRATEGY_H
37 #define KMEANSSTRATEGY_H
38 
42 #include <aims/vector/vector.h>
43 #include <vector>
44 #include <list>
45 
46 namespace aims{
47  enum DistanceType{
48  NORM1,
49  NORM2,
50  NORM2SQR,
51  INFNORM
52  };
53 
54  template<class T>
55  class KmeansStrategy : public ClassifStrategy<T>{
56  public:
57 
58  KmeansStrategy( const KmeansStrategy<T>& kmeanStrat ) ;
59 
60  // L'initialisation de la classification par des vecteurs code
61  // est prioritaire sur le don de classes initiales.
62  KmeansStrategy( int nbIterations = 50,
63  DistanceType distanceType = NORM2SQR,
64  int beginIndex = 0, int endIndex = -1,
65  const std::vector< Individuals<T> >& codeVector = std::vector< Individuals<T> >() ) ;
66  virtual ~KmeansStrategy() ;
67  virtual ClassifStrategy<T> * clone() const ;
68 
69 /* virtual double iterate ( int & nbOfIterations, */
70 /* std::vector< std::list< Individuals<T> > >* classes ) ; */
71  virtual double iterate ( int& nbOfIterations,
72  std::vector< std::list< Individuals<T> > >& classes ) ;
73  virtual void init( std::string initializationType, int nbOfClasses,
74  std::vector< std::list< Individuals<T> > >& classes ) ;
75  virtual void analyse( const std::vector< std::list< Individuals<T> > >& classes ) ;
76  virtual int aggregate( const Individuals<T>& individual ) ;
77 
78  virtual Individuals<T> getMeanValue( int classe ) { return myMeanVector[classe] ; }
79  virtual std::vector< Individuals<T> > getMeanVector() { return myMeanVector ; }
80 
81  virtual double globInertia( const std::vector< std::list< Individuals<T> > >& classes ) ;
82 
83  protected:
84  virtual float distance( const Individuals<T>& individual, int classe ) ;
85 /* float (Distance<T>:: * myDistance)( const std::vector<T>& ind1, const std::vector<T>& ind2, */
86 /* unsigned int beginIndex, unsigned int endIndex ) ; */
87  float ( * myDistance )( const std::vector<T>& ind1, const std::vector<T>& ind2,
88  unsigned int beginIndex, unsigned int endIndex ) ;
89  std::vector< Individuals<T> > myMeanVector ;
90  std::vector< Individuals<T> > myVarianceVector ;
92  } ;
93 }
94 
95 #endif
virtual double globInertia(const std::vector< std::list< Individuals< T > > > &classes)
KmeansStrategy(const KmeansStrategy< T > &kmeanStrat)
virtual void init(std::string initializationType, int nbOfClasses, std::vector< std::list< Individuals< T > > > &classes)
std::vector< Individuals< T > > myMeanVector
virtual ClassifStrategy< T > * clone() const
virtual std::vector< Individuals< T > > getMeanVector()
virtual Individuals< T > getMeanValue(int classe)
virtual void analyse(const std::vector< std::list< Individuals< T > > > &classes)
virtual float distance(const Individuals< T > &individual, int classe)
std::vector< Individuals< T > > myVarianceVector
virtual int aggregate(const Individuals< T > &individual)
float(* myDistance)(const std::vector< T > &ind1, const std::vector< T > &ind2, unsigned int beginIndex, unsigned int endIndex)
virtual double iterate(int &nbOfIterations, std::vector< std::list< Individuals< T > > > &classes)