Package gnu.trove

Examples of gnu.trove.TIntDoubleHashMap$EqProcedure

73
74
75
76
77
78
79
80
81
82
83
   *        of the result file to evaluate.
   */
  public void evaluate(String resultFilename) {
  //  //logger.info("Result file: "+resultFilename);
    queryNumbers = new TIntHashSet();
    recipRank = new TIntDoubleHashMap();
    //initialise the arr
    arr = 0.0d;
    inTop50 = 0;
    inTop20 = 0;
    inTop10 = 0;
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
236
    this.averagePrecisionOfEachQuery = new double[effQueryCounter];
   
    TIntDoubleHashMap[] precisionAtRankByQuery = new TIntDoubleHashMap[effQueryCounter];
    TIntDoubleHashMap[] precisionAtRecallByQuery = new TIntDoubleHashMap[effQueryCounter];
    for (int i = 0; i < effQueryCounter; i++) {
      precisionAtRankByQuery[i] = new TIntDoubleHashMap();
      precisionAtRecallByQuery[i] = new TIntDoubleHashMap();
    }
   
    double[] ExactPrecision = new double[effQueryCounter];
    double[] RPrecision = new double[effQueryCounter];
    Arrays.fill(ExactPrecision, 0.0d);
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
   */
  public AccumulatorResultSet(int numberOfDocuments)
  {
    lock = new ReentrantLock();
   
    scoresMap = new TIntDoubleHashMap();
    occurrencesMap = new TIntShortHashMap();

    resultSize = numberOfDocuments;
    exactResultSize = numberOfDocuments;
  }
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
192
   
    this.averagePrecisionOfEachQuery = new double[effQueryCounter];
    TIntDoubleHashMap[] precisionAtRankByQuery = new TIntDoubleHashMap[effQueryCounter];
    TIntDoubleHashMap[] precisionAtRecallByQuery = new TIntDoubleHashMap[effQueryCounter];
    for (int i = 0; i < effQueryCounter; i++) {
      precisionAtRankByQuery[i] = new TIntDoubleHashMap();
      precisionAtRecallByQuery[i] = new TIntDoubleHashMap();
    }
   
//    int[] PrecisionAt1 = new int[effQueryCounter];
//    //Modified by G.AMATI 7th May 2002
//    int[] PrecisionAt2 = new int[effQueryCounter];
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
  private double calculateDenom(SparseVector a, SparseVector b) {

    double result = 0;

    TIntDoubleHashMap diff = new TIntDoubleHashMap();

    for (int i = 0; i < a.numEntries(); i++) {
      int ind = a.getIndexAt(i);
      double val = a.getValueAt(i);
      if (!diff.containsKey(ind)) {
        diff.put(ind, 0);
      }
      diff.put(ind, diff.get(ind) + val);
    }

    for (int i = 0; i < b.numEntries(); i++) {
      int ind = b.getIndexAt(i);
      double val = b.getValueAt(i);
      if (!diff.containsKey(ind)) {
        diff.put(ind, 0);
      }
      diff.put(ind, diff.get(ind) - val);
    }

    for (TIntDoubleIterator iterator = diff.iterator(); iterator.hasNext();) {
      iterator.advance();
      result += Math.pow(iterator.value(), 2);
    }

    return result;
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
  private double calculateDenom(SparseVector a, SparseVector b) {

    double result = 0;

    TIntDoubleHashMap diff = new TIntDoubleHashMap();

    for (int i = 0; i < a.numEntries(); i++) {
      int ind = a.getIndexAt(i);
      double val = a.getValueAt(i);
      if (!diff.containsKey(ind)) {
        diff.put(ind, 0);
      }
      diff.put(ind, diff.get(ind) + val);
    }

    for (int i = 0; i < b.numEntries(); i++) {
      int ind = b.getIndexAt(i);
      double val = b.getValueAt(i);
      if (!diff.containsKey(ind)) {
        diff.put(ind, 0);
      }
      diff.put(ind, diff.get(ind) - val);
    }

    for (TIntDoubleIterator iterator = diff.iterator(); iterator.hasNext();) {
      iterator.advance();
      result += Math.pow(iterator.value(), 2);
    }

    return result;
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
    res.next();
    limitID = res.getInt(1);
   
   
    // read inlink counts 
    inlinkMap = new TIntDoubleHashMap(limitID);
   
    int targetID, numInlinks;
    res = stmtLink.executeQuery(strAllInlinks);
    while(res.next()){
      targetID = res.getInt(1);
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
    res.next();
    limitID = res.getInt(1);
   
   
    // read inlink counts 
    inlinkMap = new TIntDoubleHashMap(limitID);
   
    int targetID, numInlinks;
    res = stmtLink.executeQuery(strAllInlinks);
    while(res.next()){
      targetID = res.getInt(1);
View Full Code Here
16
17
18
19
20
21
22
  private TIntDoubleHashMap valueMap;
  private int size;
 
  public TroveConceptVector(int size ) {
    this.size = size;
    valueMap = new TIntDoubleHashMap(size);   
  }
View Full Code Here
TOP

Related Classes of gnu.trove.TIntDoubleHashMap$EqProcedure

  • classification.Mira
  • edu.wiki.concept.TroveConceptVector
  • edu.wiki.modify.IndexModifier
  • edu.wiki.modify.MemIndexModifier
  • org.terrier.evaluation.AdhocEvaluation
  • org.terrier.evaluation.AdhocFullQueryEvaluation
  • org.terrier.evaluation.NamedPageEvaluation
  • org.terrier.matching.AccumulatorResultSet
  • sequence.Mira
    • 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.