regproblem.java

一个数据挖掘软件ALPHAMINERR的整个过程的JAVA版源代码

/*
 *    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., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

/**
 * Title: XELOPES Data Mining Library
 * Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
 * Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
 * Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
 * @author Michael Thess
 * @author Victor Borichev
 * @author Valentine Stepanenko ([e-mail])
 * @version 1.0
 */

package com.prudsys.pdm.Models.Regression.SVM.Algorithms.RegularizationNetworks;


/**
 * Data of regularization problem.
 */
public class RegProblem {

        /** Number of nodes. */
        public int l;

        /** Maximum column index => number of features. */
        public int max_c;

        /** Number of missing values. */
        public int n_missing;

        /** Class values. */
        public double[] y;

        /** Data matrix in sparse format. */
        public RegNode[][] x;

        /**
         * String representation of complete problem.
         * Becomes large for large data sets!
         *
         * @return string representation of problem
         */
        public String toString() {

          String text = "Number of nodes = " + l +
                        " Number of features = " + max_c +
                        " Number of missing values = " + n_missing + "\n";
          for (int i = 0; i < l; i++)
            text = text + " y[" + i + "]=" + y[i];
          text        = text + "\n";
          for (int i = 0; i < l; i++) {
            RegNode[] vec = x[i];
            for (int j = 0; j < vec.length; j++)
              text = text + " x[" + i + "][" + j + "] = " + vec[j].index+","+vec[j].value;
            text        = text + "\n";
          };

          return text;
        }
}