Package org.apache.commons.lang.mutable

Examples of org.apache.commons.lang.mutable.MutableLong

94
95
96
97
98
99
100
101
102
103
104
      for (A attribute : transaction.getFirst()) {
        if (attributeSupport.containsKey(attribute)) {
          attributeSupport.get(attribute).add(transaction.getSecond().longValue());
          // count++;
        } else {
          attributeSupport.put(attribute, new MutableLong(transaction.getSecond()));
        }
      }
    }
    List<Pair<A,Long>> fList = new ArrayList<Pair<A,Long>>();
    for (Entry<A,MutableLong> e : attributeSupport.entrySet()) {
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
    FPTreeDepthCache treeCache = new FPTreeDepthCache();
    for (int i = tree.getHeaderTableCount() - 1; i >= 0; i--) {
      int attribute = tree.getAttributeAtIndex(i);
      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,
                                                         treeCache, 0, attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);

        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);
        log.info("Found {} Patterns with Least Support {}", patterns.get(
            attribute).count(), patterns.get(attribute).leastSupport());
      }
    }
    log.info("Tree Cache: First Level: Cache hits={} Cache Misses={}",
View Full Code Here
304
305
306
307
308
309
310
311
312
313
314
    for (int i = 0; i < featureSetSize; i++) {
      tree.addHeaderCount(i, attributeFrequency[i]);
    }

    // Constructing initial FPTree from the list of transactions
    MutableLong minSupportMutable = new MutableLong(minSupport);
    int nodecount = 0;
    // int attribcount = 0;
    int i = 0;
    while (transactions.hasNext()) {
      Pair<int[],Long> transaction = transactions.next();
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
      Pair<List<A>,Long> transaction = transactions.next();
      for (A attribute : transaction.getFirst()) {
        if (attributeSupport.containsKey(attribute)) {
          attributeSupport.get(attribute).add(transaction.getSecond().longValue());
        } else {
          attributeSupport.put(attribute, new MutableLong(transaction.getSecond()));
        }
      }
    }
    List<Pair<A,Long>> fList = Lists.newArrayList();
    for (Entry<A,MutableLong> e : attributeSupport.entrySet()) {
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
    FPTreeDepthCache treeCache = new FPTreeDepthCache();
    for (int i = tree.getHeaderTableCount() - 1; i >= 0; i--) {
      int attribute = tree.getAttributeAtIndex(i);
      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,
                                                         treeCache, 0, attribute, updater);
        patterns.put(attribute, frequentPatterns);
        outputCollector.collect(attribute, frequentPatterns);

        minSupportValue = Math.max(minSupportValue, minSupport.longValue() / 2);
        log.info("Found {} Patterns with Least Support {}", patterns.get(
            attribute).count(), patterns.get(attribute).leastSupport());
      }
    }
    log.info("Tree Cache: First Level: Cache hits={} Cache Misses={}",
View Full Code Here
221
222
223
224
225
226
227
228
229
230
231
232
233
    public void addValue(T val) {
        addValue(val,1);
    }

    private void updateValueCount(T actualValue, int sampleCount) {
        MutableLong count = valuesMap.get(actualValue);
        if (count != null) {
            count.add(sampleCount);
        } else {
            // insert new value
            valuesMap.put(actualValue, new MutableLong(sampleCount));
        }
    }
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
    //int count = 0;
    while (transactions.hasNext()) {
      List<A> transaction = transactions.next();
      for (A attribute : transaction) {
        if (AttributeSupport.containsKey(attribute) == false)
          AttributeSupport.put(attribute, new MutableLong(1));
        else
          AttributeSupport.get(attribute).increment();
        //count++;
      }
    }
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
    for (int i = tree.getHeaderTableCount() - 1; i >= 0; i--) {
      int attribute = tree.getAttributeAtIndex(i);
      if (requiredFeatures.contains(attribute) == false)
        continue;
      log.info("Mining FTree Tree for all patterns with {}", attribute);
      MutableLong minSupport = new MutableLong(minSupportValue);
      FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, K,
          treeCache, 0, attribute);
      Patterns.put(attribute, frequentPatterns);
      outputCollector.collect(attribute, frequentPatterns);

      minSupportValue = Math.max(minSupportValue, minSupport.intValue() / 2);
      log.info("Found {} Patterns with Least Support {}", Patterns.get(
          attribute).count(), Patterns.get(attribute).leastSupport());
    }
    log.info("Tree Cache: First Level: Cache hits={} Cache Misses={}",
        treeCache.getHits(), treeCache.getMisses());
View Full Code Here
280
281
282
283
284
285
286
287
288
289
290
    for (int i = 0; i < featureSetSize; i++) {
      tree.addHeaderCount(i, attributeFrequency[i]);
    }

    // Constructing initial FPTree from the list of transactions
    MutableLong minSupportMutable = new MutableLong(minSupport);
    int nodecount = 0;
    //int attribcount = 0;
    int i = 0;
    while (transactions.hasNext()) {
      int[] transaction = transactions.next();
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
      Pair<List<A>,Long> transaction = transactions.next();
      for (A attribute : transaction.getFirst()) {
        if (attributeSupport.containsKey(attribute)) {
          attributeSupport.get(attribute).add(transaction.getSecond().longValue());
        } else {
          attributeSupport.put(attribute, new MutableLong(transaction.getSecond()));
        }
      }
    }
    List<Pair<A,Long>> fList = new ArrayList<Pair<A,Long>>();
    for (Entry<A,MutableLong> e : attributeSupport.entrySet()) {
View Full Code Here
TOP

Related Classes of org.apache.commons.lang.mutable.MutableLong

  • com.ebay.erl.mobius.core.mapred.CounterUpdateThread
  • org.apache.accumulo.core.client.impl.ConditionalWriterImpl
  • org.apache.accumulo.core.file.rfile.RFile$LocalityGroupMetadata
  • org.apache.accumulo.core.util.PartitionerTest
  • org.apache.accumulo.tserver.InMemoryMap$LocalityGroupMap
  • org.apache.jorphan.math.StatCalculator
  • org.apache.mahout.common.cache.LFUCache
  • org.apache.mahout.common.DummyReporter
  • org.apache.mahout.fpm.pfpgrowth.fpgrowth.FPGrowth
  • org.apache.mahout.fpm.pfpgrowth.fpgrowth2.FPGrowthIds
    • 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.