membershipinit.cpp

模糊聚類分析源碼。包含教學文件

/*
  
  Context       : Fuzzy Clustering Algorithms

  Author        : Frank Hoeppner, see also AUTHORS file 

  Description   : implementation of class module MembershipInit
                  
  History       :
    

  Comment       : 
    This file was generated automatically. DO NOT EDIT.

  Copyright     : Copyright (C) 1999-2000 Frank Hoeppner

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 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 General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/
/*
  The University of Applied Sciences Oldenburg/Ostfriesland/Wilhelmshaven
  hereby disclaims all copyright interests in the program package `fc' 
  (tool package for fuzzy cluster analysis) written by Frank Hoeppner.
  
  Prof. Haass, President of Vice, 2000-Mar-10
*/

#ifndef MembershipInit_SOURCE
#define MembershipInit_SOURCE

/* configuration include */
#ifdef HAVE_CONFIG_H
/*
//FILETREE_IFDEF HAVE_CONFIG_H
*/
#include "config.h"
/*
//FILETREE_ENDIF
*/
#endif



// necessary includes
#include "MembershipInit.hpp"
#include "ProbMembUpdate.hpp"

// data


// implementation
template < class ANALYSIS >
MembershipInit< ANALYSIS >::MembershipInit
  (
  Algorithm<ANALYSIS>* ap_alg
  )
  : mp_succ_alg(ap_alg)
  
  
  {
  
  }
template < class ANALYSIS >
MembershipInit< ANALYSIS >::~MembershipInit
  (
  )
  {
  FUNCLOG("~MembershipInit");
  
  delete mp_succ_alg;
  }
template < class ANALYSIS >
void
MembershipInit< ANALYSIS >::operator()
  (
  ANALYSIS& a_analysis
  )
  {
  FUNCLOG("MembershipInit");
  
  const int n(a_analysis.option().number_features());
  const int c(a_analysis.option().number_prototypes());
  int i,j;
  typename ANALYSIS::link_iter i_link(a_analysis.links().begin());
  int strategy((int)a_analysis.option().m_constants[0]);
  switch (strategy)
    {
    default : // first strategy is default strategy
    case 0 : 
      {
        int p(0);
        for (j=0;j<n;++j)
          {
          if (j>(real_type)n/c*(p+1)) { ++p; }
          for (i=0;i<c;++i)
            {
            (*i_link).membership() = (p==i) ? 1 : 0;
            ++i_link;
            }
          }
      }
      break;
    case 1 : 
      {
        for (j=0;j<n;++j)
          for (i=0;i<c;++i)
            {
            (*i_link).membership() = ((j%c)==i) ? 1 : 0;
            ++i_link;
            }
      }
      break;
    case 2 :
      {
        for (j=0;j<n;++j)
          {
          for (i=0;i<c;++i)
            {
            real_type random_distance( random() % 999 );
            (*i_link).squared_distance() = random_distance;
            (*i_link).pow_distance() = random_distance;
            ++i_link;
            }
          }

        (*probm(nop(a_analysis)))(a_analysis);
      }
      break;
    }
  invariant(i_link==a_analysis.links().end(),"link size matches",SOURCELOC);

  a_analysis.option().history() += ".mini";
  a_analysis.option().output() = FC_OUTPUT_ALL;
  a_analysis.option().init() = FC_INIT_MEMB;
  call_successor(mp_succ_alg,a_analysis,"mini");
  
  }

// template instantiation



#endif // MembershipInit_SOURCE