aboutsummaryrefslogtreecommitdiff
path: root/core/src/main/scala/spark/partial/GroupedCountEvaluator.scala
blob: 01fbb8a11b5c731b6701443258180431b2a46215 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package spark.partial

import java.util.{HashMap => JHashMap}
import java.util.{Map => JMap}

import scala.collection.Map
import scala.collection.mutable.HashMap
import scala.collection.JavaConversions.mapAsScalaMap

import cern.jet.stat.Probability

import it.unimi.dsi.fastutil.objects.{Object2LongOpenHashMap => OLMap}

/**
 * An ApproximateEvaluator for counts by key. Returns a map of key to confidence interval.
 */
private[spark] class GroupedCountEvaluator[T](totalOutputs: Int, confidence: Double)
  extends ApproximateEvaluator[OLMap[T], Map[T, BoundedDouble]] {

  var outputsMerged = 0
  var sums = new OLMap[T]   // Sum of counts for each key

  override def merge(outputId: Int, taskResult: OLMap[T]) {
    outputsMerged += 1
    val iter = taskResult.object2LongEntrySet.fastIterator()
    while (iter.hasNext) {
      val entry = iter.next()
      sums.put(entry.getKey, sums.getLong(entry.getKey) + entry.getLongValue)
    }
  }

  override def currentResult(): Map[T, BoundedDouble] = {
    if (outputsMerged == totalOutputs) {
      val result = new JHashMap[T, BoundedDouble](sums.size)
      val iter = sums.object2LongEntrySet.fastIterator()
      while (iter.hasNext) {
        val entry = iter.next()
        val sum = entry.getLongValue()
        result(entry.getKey) = new BoundedDouble(sum, 1.0, sum, sum)
      }
      result
    } else if (outputsMerged == 0) {
      new HashMap[T, BoundedDouble]
    } else {
      val p = outputsMerged.toDouble / totalOutputs
      val confFactor = Probability.normalInverse(1 - (1 - confidence) / 2)
      val result = new JHashMap[T, BoundedDouble](sums.size)
      val iter = sums.object2LongEntrySet.fastIterator()
      while (iter.hasNext) {
        val entry = iter.next()
        val sum = entry.getLongValue
        val mean = (sum + 1 - p) / p
        val variance = (sum + 1) * (1 - p) / (p * p)
        val stdev = math.sqrt(variance)
        val low = mean - confFactor * stdev
        val high = mean + confFactor * stdev
        result(entry.getKey) = new BoundedDouble(mean, confidence, low, high)
      }
      result
    }
  }
}