necSupport = (int)(m_minSupport * (double)instances.numInstances());
necSupport = (int)(m_minSupport * (double)instances.numInstances()+0.5);
  private void findLargeItemSets(Instances instances) throws Exception {        FastVector kMinusOneSets, kSets;    Hashtable hashtable;    int necSupport, i = 0;        m_instances = instances;        // Find large itemsets    necSupport = (int)(m_minSupport * (double)instances.numInstances());    kSets = ItemSet.singletons(instances);    ItemSet.upDateCounters(kSets, instances);    kSets = ItemSet.deleteItemSets(kSets, necSupport);    if (kSets.size() == 0)      return;    do {      m_Ls.addElement(kSets);      kMinusOneSets = kSets;      kSets = ItemSet.mergeAllItemSets(kMinusOneSets, i);      hashtable = ItemSet.getHashtable(kMinusOneSets, kMinusOneSets.size());      m_hashtables.addElement(hashtable);      kSets = ItemSet.pruneItemSets(kSets, hashtable);      ItemSet.upDateCounters(kSets, instances);      kSets = ItemSet.deleteItemSets(kSets, necSupport);      i++;    } while (kSets.size() > 0);  }  