Examples of FrequentPatternMaxHeap

org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap
keeps top K Attributes in a TreeSet

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

    Map<Integer,FrequentPatternMaxHeap> patterns = Maps.newHashMap();
    for (int attribute : tree.attrIterableRev()) {
      if (requiredFeatures.contains(attribute)) {
        log.info("Mining FTree Tree for all patterns with {}", attribute);
        MutableLong minSupport = new MutableLong(minSupportValue);
        FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, k,
                                                         attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);


        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

                                               StatusUpdater updater) {


    long currentAttributeCount = tree.headerCount(currentAttribute);


    if (currentAttributeCount < minSupportMutable.longValue()) {
      return new FrequentPatternMaxHeap(k, true);
    }
 
    FPTree condTree = tree.createMoreFreqConditionalTree(currentAttribute);


    Pair<FPTree, FPTree> pAndQ = condTree.splitSinglePrefix();
    FPTree p = pAndQ.getFirst();
    FPTree q = pAndQ.getSecond();


    FrequentPatternMaxHeap prefixPats = null;
    if (p != null) {
      prefixPats = mineSinglePrefix(p, k);
    }


    FrequentPatternMaxHeap suffixPats = new FrequentPatternMaxHeap(k, true);


    Pattern thisPat = new Pattern();
    thisPat.add(currentAttribute, currentAttributeCount);
    suffixPats.insert(thisPat);


    for (int attr : q.attrIterableRev())  {
      mergeHeap(suffixPats,
                growth(q, minSupportMutable, k, attr, updater),
                currentAttribute,
                currentAttributeCount, true);
    }


    if (prefixPats != null) {
      FrequentPatternMaxHeap toRet = cross(prefixPats, suffixPats, k);
      return toRet;
    }


    return suffixPats;
  }

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

   * in pPats and qPats.  
   */
  private static FrequentPatternMaxHeap cross(FrequentPatternMaxHeap pPats, 
                                              FrequentPatternMaxHeap qPats,
                                              int k) {
    FrequentPatternMaxHeap pats = new FrequentPatternMaxHeap(k, true);


    for (Pattern p : pPats.getHeap()) {
      int[] pints = p.getPattern();
      for (Pattern q : qPats.getHeap()) {
        int[] qints = q.getPattern();
        
        Pattern pq = new Pattern();
        for (int pi = 0; pi < p.length(); pi++) 
          pq.add(pints[pi], p.support());
        for (int qi = 0; qi < q.length(); qi++) 
          pq.add(qints[qi], q.support());
        pats.insert(pq);
      }
    }


    for (Pattern q : qPats.getHeap()) {
      Pattern qq = new Pattern();
      int[] qints = q.getPattern();
      for (int qi = 0; qi < q.length(); qi++) 
        qq.add(qints[qi], q.support());
      pats.insert(qq);
    }


    return pats;
  }

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

  /**
   * Mine all frequent patterns that can be created by following a prefix
   * that is common to all sets in the given tree.
   */
  private static FrequentPatternMaxHeap mineSinglePrefix(FPTree tree, int k) {
    FrequentPatternMaxHeap pats = new FrequentPatternMaxHeap(k, true);
    FPTree.FPNode currNode = tree.root();
    while (currNode.numChildren() == 1) {
      currNode = currNode.children().iterator().next();
      FrequentPatternMaxHeap singlePat = new FrequentPatternMaxHeap(k, true);
      Pattern p = new Pattern();
      p.add(currNode.attribute(), currNode.count());
      singlePat.insert(p);
      pats = cross(singlePat, pats, k);
      pats.insert(p);
    }


    return pats;

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

    requiredFeatures.sort();
    for (int attribute : tree.attrIterableRev()) {
      if (requiredFeatures.binarySearch(attribute) >= 0) {
        log.info("Mining FTree Tree for all patterns with {}", attribute);
        MutableLong minSupport = new MutableLong(minSupportValue);
        FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, k,
                                                         attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);


        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

                                               StatusUpdater updater) {


    long currentAttributeCount = tree.headerCount(currentAttribute);


    if (currentAttributeCount < minSupportMutable.longValue()) {
      return new FrequentPatternMaxHeap(k, true);
    }
 
    FPTree condTree = tree.createMoreFreqConditionalTree(currentAttribute);


    Pair<FPTree, FPTree> pAndQ = condTree.splitSinglePrefix();
    FPTree p = pAndQ.getFirst();
    FPTree q = pAndQ.getSecond();


    FrequentPatternMaxHeap prefixPats = null;
    if (p != null) {
      prefixPats = mineSinglePrefix(p, k);
    }


    FrequentPatternMaxHeap suffixPats = new FrequentPatternMaxHeap(k, true);


    Pattern thisPat = new Pattern();
    thisPat.add(currentAttribute, currentAttributeCount);
    suffixPats.insert(thisPat);


    for (int attr : q.attrIterableRev())  {
      mergeHeap(suffixPats,
                growth(q, minSupportMutable, k, attr, updater),
                currentAttribute,
                currentAttributeCount, true);
    }


    if (prefixPats != null) {
      FrequentPatternMaxHeap toRet = cross(prefixPats, suffixPats, k);
      return toRet;
    }


    return suffixPats;
  }

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

   * in pPats and qPats.  
   */
  private static FrequentPatternMaxHeap cross(FrequentPatternMaxHeap pPats, 
                                              FrequentPatternMaxHeap qPats,
                                              int k) {
    FrequentPatternMaxHeap pats = new FrequentPatternMaxHeap(k, true);


    for (Pattern p : pPats.getHeap()) {
      int[] pints = p.getPattern();
      for (Pattern q : qPats.getHeap()) {
        int[] qints = q.getPattern();
        
        Pattern pq = new Pattern();
        for (int pi = 0; pi < p.length(); pi++) 
          pq.add(pints[pi], p.support());
        for (int qi = 0; qi < q.length(); qi++) 
          pq.add(qints[qi], q.support());
        pats.insert(pq);
      }
    }


    for (Pattern q : qPats.getHeap()) {
      Pattern qq = new Pattern();
      int[] qints = q.getPattern();
      for (int qi = 0; qi < q.length(); qi++) 
        qq.add(qints[qi], q.support());
      pats.insert(qq);
    }


    return pats;
  }

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

  /**
   * Mine all frequent patterns that can be created by following a prefix
   * that is common to all sets in the given tree.
   */
  private static FrequentPatternMaxHeap mineSinglePrefix(FPTree tree, int k) {
    FrequentPatternMaxHeap pats = new FrequentPatternMaxHeap(k, true);
    FPTree.FPNode currNode = tree.root();
    while (currNode.numChildren() == 1) {
      currNode = currNode.children().iterator().next();
      FrequentPatternMaxHeap singlePat = new FrequentPatternMaxHeap(k, true);
      Pattern p = new Pattern();
      p.add(currNode.attribute(), currNode.count());
      singlePat.insert(p);
      pats = cross(singlePat, pats, k);
      pats.insert(p);
    }


    return pats;

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

    requiredFeatures.sort();
    for (int attribute : tree.attrIterableRev()) {
      if (requiredFeatures.binarySearch(attribute) >= 0) {
        log.info("Mining FTree Tree for all patterns with {}", attribute);
        MutableLong minSupport = new MutableLong(minSupportValue);
        FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, k,
                                                         attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);


        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);

View Full Code Here

Examples of org.apache.mahout.fpm.pfpgrowth.fpgrowth.FrequentPatternMaxHeap

                                               StatusUpdater updater) {


    long currentAttributeCount = tree.headerCount(currentAttribute);


    if (currentAttributeCount < minSupportMutable.longValue()) {
      return new FrequentPatternMaxHeap(k, true);
    }
 
    FPTree condTree = tree.createMoreFreqConditionalTree(currentAttribute);


    Pair<FPTree, FPTree> pAndQ = condTree.splitSinglePrefix();
    FPTree p = pAndQ.getFirst();
    FPTree q = pAndQ.getSecond();


    FrequentPatternMaxHeap prefixPats = null;
    if (p != null) {
      prefixPats = mineSinglePrefix(p, k);
    }


    FrequentPatternMaxHeap suffixPats = new FrequentPatternMaxHeap(k, true);


    Pattern thisPat = new Pattern();
    thisPat.add(currentAttribute, currentAttributeCount);
    suffixPats.insert(thisPat);


    for (int attr : q.attrIterableRev())  {
      mergeHeap(suffixPats,
                growth(q, minSupportMutable, k, attr, updater),
                currentAttribute,

View Full Code Here

0 1 2 3

TOP

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.