Package org.apache.mahout.math.list

Examples of org.apache.mahout.math.list.LongArrayList

291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
   */
  public Pair<FPTree, FPTree> splitSinglePrefix() {
    if (root.numChildren() != 1) {
      return new Pair<FPTree, FPTree>(null, this);
    }
    LongArrayList pAttrCountList = new LongArrayList();
    LongArrayList qAttrCountList = attrCountList.copy();

    FPNode currNode = root;
    while (currNode.numChildren() == 1) {
      currNode = currNode.children().iterator().next();
      if (pAttrCountList.size() <= currNode.attribute()) {
        pAttrCountList.setSize(currNode.attribute() + 1);
      }
      pAttrCountList.set(currNode.attribute(), currNode.count());
      qAttrCountList.set(currNode.attribute(), 0);
    }

    FPTree pTree = new FPTree(pAttrCountList, minSupport);
    FPTree qTree = new FPTree(qAttrCountList, minSupport);
    recursivelyAddPrefixPats(pTree, qTree, root, null);
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
   * Note that the counts in attrCounts are assumed to be complete;
   * they are not updated as the tree is modified.
   */
  public FPTree(long[] attrCounts, long minSupport) {
    this.root = new FPNode(null, -1, 0);
    this.attrCountList = new LongArrayList();
    for (int i = 0; i < attrCounts.length; i++)
      if (attrCounts[i] > 0) {
        if (attrCountList.size() < (i + 1)) {
          attrCountList.setSize(i + 1);
        }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
  /**
   * Returns a conditional FP tree based on the targetAttr, containing
   * only items that are more frequent.
   */
  public FPTree createMoreFreqConditionalTree(int targetAttr) {
    LongArrayList counts = new LongArrayList();
    List<FPNode> nodeList = (List<FPNode>) attrNodeLists.get(targetAttr);

    for (FPNode currNode : nodeList) {
      long pathCount = currNode.count();
      while (currNode != root) {
        int currAttr = currNode.attribute();
        if (counts.size() <= currAttr) {
          counts.setSize(currAttr + 1);
        }
        long count = counts.get(currAttr);
        counts.set(currNode.attribute(), count + pathCount);
        currNode = currNode.parent();
      }
    }
    if (counts.get(targetAttr) != attrCountList.get(targetAttr))
      throw new IllegalStateException("mismatched counts for targetAttr="
                                      + targetAttr + ", (" + counts.get(targetAttr)
                                      + " != " + attrCountList.get(targetAttr) + "); "
                                      + "thisTree=" + this + "\n");
    counts.set(targetAttr, 0L);

    FPTree toRet = new FPTree(counts, minSupport);
    IntArrayList attrLst = new IntArrayList();
    for (FPNode currNode : (List<FPNode>) attrNodeLists.get(targetAttr)) {
      long count = currNode.count();
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
   */
  public Pair<FPTree, FPTree> splitSinglePrefix() {
    if (root.numChildren() != 1) {
      return new Pair<FPTree, FPTree>(null, this);
    }
    LongArrayList pAttrCountList = new LongArrayList();
    LongArrayList qAttrCountList = attrCountList.copy();

    FPNode currNode = root;
    while (currNode.numChildren() == 1) {
      currNode = currNode.children().iterator().next();
      if (pAttrCountList.size() <= currNode.attribute())
        pAttrCountList.setSize(currNode.attribute() + 1);
      pAttrCountList.set(currNode.attribute(), currNode.count());
      qAttrCountList.set(currNode.attribute(), 0);
    }

    FPTree pTree = new FPTree(pAttrCountList, minSupport);
    FPTree qTree = new FPTree(qAttrCountList, minSupport);
    recursivelyAddPrefixPats(pTree, qTree, root, null);
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.list.LongArrayList

  • org.apache.mahout.fpm.pfpgrowth.fpgrowth2.FPTree
  • org.apache.mahout.math.map.AbstractByteLongMap
  • org.apache.mahout.math.map.AbstractCharLongMap
  • org.apache.mahout.math.map.AbstractDoubleLongMap
  • org.apache.mahout.math.map.AbstractFloatLongMap
  • org.apache.mahout.math.map.AbstractIntLongMap
  • org.apache.mahout.math.map.AbstractLongByteMap
  • org.apache.mahout.math.map.AbstractLongCharMap
  • org.apache.mahout.math.map.AbstractLongDoubleMap
  • org.apache.mahout.math.map.AbstractLongFloatMap
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.