psmo_solver.h

支持向量分类算法在linux操作系统下的是实现

// D. Brugger, december 2006
// $Id: psmo_solver.h 7 2006-12-16 16:45:32Z beeblbrox $ 
//
// Copyright (C) 2006 Dominik Brugger
//
// 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.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

#ifndef __PSMO__SOLVER__H__
#define __PSMO__SOLVER__H__

#include "util.h"

class Solver_Parallel_SMO : public Solver
{
public:
  Solver_Parallel_SMO(int n, int q, MPI_Comm comm);
  void Solve(int l, const QMatrix& Q, const double *b, const schar *y,
	     double *alpha, double Cp, double Cn, double eps,
	     SolutionInfo* si, int shrinking);
protected:
  unsigned int NEXT_RAND;
  // Local storage for subproblems
  Qfloat *Q_bb, *QD_b;
  double *alpha_b, *c;
  schar *a;
  // Max size of working set, etc.
  int n, q, n_old, lmn, iter;
  // Working set status and statistics used by select_working_set
  char *work_status;
  int *work_count;
  int *old_idx;
  enum { WORK_B, WORK_N };
  enum { CACHED, NOT_CACHED };
  static const double TOL_ZERO = 1e-09; // tolerance for zero entries
  SolutionInfo *si;
  virtual int select_working_set(int *work_set, int *not_work_set);
  virtual void init_working_set(int *work_set, int *not_work_set);
  virtual void solve_inner();
  unsigned int next_rand_pos();
private:
  void sync_gradient(int *work_set, int *not_work_set);
  void determine_cached(int *work_set);
  void setup_range(int *range_low, int *range_up, int total_sz);
  // MPI communicator, rank and group size
  MPI_Comm comm;
  int rank, size, ierr;
  // Local ranges of all processors
  int *l_low, *l_up;
  int *n_low, *n_up;
  int *lmn_low, *lmn_up;
  // Local ranges
  int l_low_loc, l_up_loc;
  int n_low_loc, n_up_loc;
  int lmn_low_loc, lmn_up_loc;
  // Local buffer for gradient
  double *G_n;
  // Parallel cache status
  char *p_cache_status;
  int *idx_cached, *idx_not_cached, *nz;
  int count_cached, count_not_cached;
};

class Solver_Parallel_SMO_NU : public Solver_Parallel_SMO
{
public:
  Solver_Parallel_SMO_NU(int n, int q, MPI_Comm comm);
protected:
  void solve_inner();
  int select_working_set(int *work_set, int *not_work_set);
  double calculate_rho();
};

#endif