globalunsupclus.cpp

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

/*
  
  Context       : Fuzzy Clustering Algorithms

  Author        : Frank Hoeppner, see also AUTHORS file 

  Description   : implementation of class module GlobalUnsupClus
                  
  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 GlobalUnsupClus_SOURCE
#define GlobalUnsupClus_SOURCE

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



// necessary includes
#include "GlobalUnsupClus.hpp"

// data


// implementation
template < class ANALYSIS >
GlobalUnsupClus< ANALYSIS >::GlobalUnsupClus
  (
  Algorithm<ANALYSIS>* ap_icv_alg, /* init, clustering, validity measure */
  Algorithm<ANALYSIS>* ap_itrm_alg, /* called for interim solutions */
  char_cpc ap_name, /* algorithm's name */
  Algorithm<ANALYSIS>* ap_alg /* successor */
  )
  : mp_succ_alg(ap_alg)
  , mp_icv_alg(ap_icv_alg)
  , mp_itrm_alg(ap_itrm_alg)
  , mp_name(ap_name)
  
  {
  
  }
template < class ANALYSIS >
GlobalUnsupClus< ANALYSIS >::~GlobalUnsupClus
  (
  )
  {
  FUNCLOG("~GlobalUnsupClus");
  delete mp_icv_alg;
  delete mp_succ_alg;
  }
template < class ANALYSIS >
void
GlobalUnsupClus< ANALYSIS >::operator()
  (
  ANALYSIS& a_analysis
  )
  {
  FUNCLOG("GlobalUnsupClus");
  
  // copy analysis (initial state)
  ANALYSIS analysis(&m_option,&a_analysis.data(),&m_prototypes,&m_links);
  m_prototypes.clear();
  m_links.clear();
  m_option = a_analysis.option();

  int c( m_option.number_prototypes() );
  int cmin( m_option.min_no_of_clusters() );
  int cmax( m_option.max_no_of_clusters() );
  real_type best_validity(POS_IMPOSSIBLE_RANGE);

  if ((!m_option.unsupervised()) ||
      (cmin<0) || (cmin>cmax))
    { cmin=cmax=c; }

  for (c=cmin;c<=cmax;++c)
    {
    trace("c=",c);

    m_option.number_prototypes() = c;
    m_option.init() = FC_INIT_AUTO;
    (*mp_icv_alg)(analysis);

    if (m_option.validity_measure() < best_validity)
      {
      best_validity = m_option.validity_measure();
      a_analysis.option() = m_option;
      a_analysis.prototypes() = m_prototypes;
      a_analysis.links() = m_links;
      }
    if (m_option.interim_output()!=DEFAULT_OPTION_NOINTERIMOUT)
      (*mp_itrm_alg)(analysis);
    trace("(c,validity)",make_pair(c,m_option.validity_measure()));
    }
  trace("final c",m_option.number_prototypes());

  call_successor(mp_succ_alg,a_analysis,mp_name);
  
  }

// template instantiation



#endif // GlobalUnsupClus_SOURCE