All Downloads are FREE. Search and download functionalities are using the official Maven repository.

gate.plugin.learningframework.mallet.PipeScaleMinMaxAll Maven / Gradle / Ivy

Go to download

A GATE plugin that provides many different machine learning algorithms for a wide range of NLP-related machine learning tasks like text classification, tagging, or chunking.

There is a newer version: 4.2
Show newest version
/*
 * Copyright (c) 2015-2016 The University Of Sheffield.
 *
 * This file is part of gateplugin-LearningFramework 
 * (see https://github.com/GateNLP/gateplugin-LearningFramework).
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 2.1 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this software. If not, see .
 */

package gate.plugin.learningframework.mallet;

import cc.mallet.pipe.Pipe;
import cc.mallet.types.Alphabet;
import cc.mallet.types.FeatureVector;
import cc.mallet.types.Instance;
import gate.plugin.learningframework.mbstats.FVStatsMeanVarAll;
import gate.plugin.learningframework.mbstats.PerFeatureStats;
import gate.util.GateRuntimeException;
import java.io.Serializable;
import java.util.Arrays;
import java.util.List;

/**
 *
 *
 */
public class PipeScaleMinMaxAll extends Pipe implements Serializable {

  protected double min[];
  protected double max[];
  protected boolean normalize[];
  
  /**
   * Constructor from alphabet and feature stats.
   * @param alphabet alphabet
   * @param stats feature stats
   */
  public PipeScaleMinMaxAll(Alphabet alphabet, FVStatsMeanVarAll stats) {
    super(alphabet, null);
    List pfss = stats.getStats();
    int n = pfss.size();
    min = new double[n];
    max = new double[n];
    normalize = new boolean[n];
    for(int i=0; i-->
            
    
            


© 2015 - 2024 Weber Informatics LLC | Privacy Policy