timestat.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 Valentine Stepanenko ([e-mail])
 * @author Victor Borichev
 * @version 1.0
 */

package com.prudsys.pdm.Models.Statistics;

import java.util.Calendar;
import java.util.Enumeration;
import java.util.GregorianCalendar;

public class TimeStat {
  static Integer dummy = new Integer(0);
  static GregorianCalendar calendar = new GregorianCalendar();
  static int[] fields = {Calendar.SECOND,
                         Calendar.MINUTE,
                         Calendar.HOUR_OF_DAY,
                         Calendar.DAY_OF_MONTH,
                         Calendar.WEEK_OF_MONTH,
                         Calendar.MONTH,
                         Calendar.YEAR};
  java.util.Hashtable[] hashes;
  int bestUnit = -1;

  public TimeStat() {
    hashes = new java.util.Hashtable[fields.length];
    for(int i=0;i<fields.length;i++) hashes[i] = new java.util.Hashtable();
  }

  public void addTime(double time) {
    calendar.setTime(new java.util.Date((long)time));
    for(int i=0;i<fields.length;i++)
    {
      Integer field = new Integer(calendar.get(fields[i]));
      hashes[i].put(field,dummy);
    }
  }

  public int getGroupUnit(int maxGroups) {
    int[] nums = new int[fields.length];
    for(int i=0;i<fields.length;i++)
      nums[i] = hashes[i].size();
    int max = 0, unit = -1;
    for(int i=0;i<nums.length;i++)
      if(nums[i]<=maxGroups&&nums[i]>max) {max = nums[i]; unit = i;}
    if(unit==-1)
    {
      int min = Integer.MAX_VALUE;
        for(int i=0;i<nums.length;i++)
          if(nums[i]<min) {min = nums[i]; unit = i;}
    }
    bestUnit = unit;
    return fields[unit];
  }

  public int[] getUnitValues(int unit) {
    if(bestUnit==-1) getGroupUnit(-1);
    int[] vals = new int[hashes[bestUnit].size()];
    int i = 0;
    Enumeration em = hashes[bestUnit].keys();
    while(em.hasMoreElements())
    {
      vals[i++] = ((Integer)em.nextElement()).intValue();
    }
    return vals;
  }
}