connectedlinedistance.cpp

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

/*
  
  Context       : Fuzzy Clustering Algorithms

  Author        : Frank Hoeppner, see also AUTHORS file 

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

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



// necessary includes
#include "ConnectedLineDistance.hpp"

// data


// implementation
template < class ANALYSIS >
ConnectedLineDistance< ANALYSIS >::ConnectedLineDistance
  (
  bool a_normalize,
  Algorithm<ANALYSIS>* ap_alg
  )
  : mp_succ_alg(ap_alg)
  , m_normalize(a_normalize)
  
  {
  
  }
template < class ANALYSIS >
ConnectedLineDistance< ANALYSIS >::~ConnectedLineDistance
  (
  )
  {
  FUNCLOG("~ConnectedLineDistance");
  
  delete mp_succ_alg;
  }
template < class ANALYSIS >
void
ConnectedLineDistance< ANALYSIS >::operator()
  (
  ANALYSIS& a_analysis
  )
  {
  FUNCLOG("ConnectedLineDistance");
  
  const int c(a_analysis.option().number_prototypes());
  typename ANALYSIS::link_iter i_link(a_analysis.links().begin());

  for (
      typename ANALYSIS::data_iter i_data(a_analysis.data().begin());
      i_data != a_analysis.data().end();
      ++i_data
      )
    {
    bool line_type( (*i_data).datum().rows()==0 );

    int i(0);
    for (
        typename ANALYSIS::prot_iter i_prot(a_analysis.prototypes().begin());
        i_prot != a_analysis.prototypes().end();
        ++i_prot
        )
      {

      if ((*i_prot).type() == CLUSTER_PROTOTYPE)
        {
        const real_type  kx( (*i_prot).start()[AXIS_X] );
        const real_type  ky( (*i_prot).start()[AXIS_Y] );
              real_type dkx( (*i_prot).delta()[AXIS_X] );
              real_type dky( (*i_prot).delta()[AXIS_Y] );
        real_type x,y,dx,dy,u;

  if (line_type)
    {
    x = max(kx,(*i_data).start()[AXIS_X]);
    dx = min(kx+dkx,(*i_data).start()[AXIS_X]+(*i_data).delta()[AXIS_X])-x;
    y = (*i_data).start()[AXIS_Y]+(*i_data).delta()[AXIS_Y]*(x-(*i_data).start()[AXIS_X])/(*i_data).delta()[AXIS_X];
    dy = (*i_data).delta()[AXIS_Y]/(*i_data).delta()[AXIS_X]*dx;
    u = ( (dx>0.0) ? 1.0 : 0.0 );
    }
  else
    {
    x = (*i_data).datum()[AXIS_X];
    y = (*i_data).datum()[AXIS_Y];

    bool fit;
    if (i==0)   { fit = (x<kx+dkx); } else
    if (i==c-1) { fit = (kx<=x); } else
                { fit = ((kx<=x) && (x<kx+dkx)); }
    u = (fit) ? 1.0 : 0.0;
    }

          (*i_link).membership() = u;
          (*i_link).pow_membxweight() = (*i_data).weight()*u;
          // calculate squared distance 
          // (only in case u!=0 (<=> u=1), otherwise not defined)
          real_type sqdist(POS_IMPOSSIBLE_RANGE);
          if (u==1.0)
            {

          if (m_normalize) 
            { 
            sqdist = matrix_square_norm((*i_prot).delta());
            if (sqdist!=0.0) { dkx/=sqdist; dky/=sqdist; } 
            }

          const real_type B = (y-ky)*dkx-(x-kx)*dky;

          if (line_type)
            { // line type
            real_type A = dy*dkx-dx*dky;
            sqdist = A*A/3.0 + A*B + B*B;
            }
          else
            { // point type
            sqdist = B*B;
            }
            } // if (u==1)
          (*i_link).squared_distance() = sqdist;
          }

        ++i_link; ++i;
        }

      }
    invariant(i_link==a_analysis.links().end(),"link size");

    (*mp_succ_alg)(a_analysis);
  
  }

// template instantiation



#endif // ConnectedLineDistance_SOURCE