Package gnu.trove

Examples of gnu.trove.TObjectDoubleIterator.key()

381
382
383
384
385
386
387
388
389
390
391
    TObjectDoubleIterator nIter = neighbors_.iterator();
    while (nIter.hasNext()) {
      nIter.advance();
      totalNeighWeight += this.GetContinuationProbability() * nIter.value();
     
      Vertex2 neigh = g._vertices.get(nIter.key());
      totalNeighWeight += neigh.GetContinuationProbability() *
        neigh.GetNeighborWeight(this.GetName());
    }
   
    // mu1 x p^{inj} + 0.5 * mu2 x \sum_j (p_{i}^{cont} W_{ij} + p_{j}^{cont} W_{ji}) + mu3
View Full Code Here
400
401
402
403
404
405
406
407
408
409
410
    // sum_{u} W_uv^{2}, where u is the neighbor
    double totalNeighWeightSq = 0;
    TObjectDoubleIterator nIter = neighbors_.iterator();
    while (nIter.hasNext()) {
      nIter.advance();
      Vertex2 neigh = g._vertices.get(nIter.key());
      totalNeighWeightSq += neigh.GetNeighborWeight(this.GetName()) *
        neigh.GetNeighborWeight(this.GetName());
    }
   
    double denom = mu1 * (IsSeedNode() ? 1 : 0) +
View Full Code Here
25
26
27
28
29
30
31
32
33
34
35
    ArrayList<ObjectDoublePair> lsps = new ArrayList<ObjectDoublePair>();

    TObjectDoubleIterator mi = m.iterator();
    while (mi.hasNext()) {
      mi.advance();
      lsps.add(new ObjectDoublePair(mi.key(), mi.value()));
    }

    ObjectDoublePairComparator lspComparator = new ObjectDoublePairComparator();
    Collections.sort(lsps, lspComparator);
View Full Code Here
244
245
246
247
248
249
250
251
252
253
254
      if (v.IsTestNode()) {
        TObjectDoubleIterator labelIter =
            this._labelManager.getLabelScores(v.GetGoldLabel()).iterator();
        while (labelIter.hasNext()) {
          labelIter.advance();
          testLabels.adjustOrPutValue((String) labelIter.key(), 1, 1);
        }
      }
     
      if (v.IsSeedNode()) {
        Object[] injLabels= this._labelManager.getLabelScores(v.GetInjectedLabelScores()).keys();
View Full Code Here
504
505
506
507
508
509
510
511
512
513
514
    for (String vName : this._vertices.keySet()) {
      Vertex2 v = this._vertices.get(vName);
      TObjectDoubleIterator nIter = v.GetNeighbors().iterator();
      while (nIter.hasNext()) {
        nIter.advance();
        String nName = (String) nIter.key();

        // we assume that the currently set distances are distance squares
        double currWeight = v.GetNeighborWeight(nName);
        double sigmaSquarred = Math.pow(sigmaFactor * avgEdgeWeight, 2);
        double newWeight = Math.exp((-1.0 * currWeight) / (2 * sigmaSquarred));
 
View Full Code Here
531
532
533
534
535
536
537
538
539
540
541
        nIter.advance();
        ++totalEdges;

        // we assume that the currently set distances are distance squares,
        // so we need to take sqrt before averaging.
        totalDistance += Math.sqrt(v.GetNeighborWeight((String) nIter.key()));
      } 
    }

    return ((1.0 * totalDistance) / totalEdges);
  }
View Full Code Here
560
561
562
563
564
565
566
567
568
569
570
      if (v.IsSeedNode()) {
        TObjectDoubleIterator injLabIter =
            this._labelManager.getLabelScores(v.GetInjectedLabelScores()).iterator();
        while (injLabIter.hasNext()) {
          injLabIter.advance();
          double currVal = classSeedSum.containsKey(injLabIter.key()) ?
            classSeedSum.get(injLabIter.key()) : 0;
          classSeedSum.put(injLabIter.key(), currVal + injLabIter.value());
         
          // add the label to the list of labels
          if (!labels.containsKey(injLabIter.key())) {
View Full Code Here
561
562
563
564
565
566
567
568
569
570
571
        TObjectDoubleIterator injLabIter =
            this._labelManager.getLabelScores(v.GetInjectedLabelScores()).iterator();
        while (injLabIter.hasNext()) {
          injLabIter.advance();
          double currVal = classSeedSum.containsKey(injLabIter.key()) ?
            classSeedSum.get(injLabIter.key()) : 0;
          classSeedSum.put(injLabIter.key(), currVal + injLabIter.value());
         
          // add the label to the list of labels
          if (!labels.containsKey(injLabIter.key())) {
            labels.put(injLabIter.key(), 1.0);
View Full Code Here
562
563
564
565
566
567
568
569
570
571
572
            this._labelManager.getLabelScores(v.GetInjectedLabelScores()).iterator();
        while (injLabIter.hasNext()) {
          injLabIter.advance();
          double currVal = classSeedSum.containsKey(injLabIter.key()) ?
            classSeedSum.get(injLabIter.key()) : 0;
          classSeedSum.put(injLabIter.key(), currVal + injLabIter.value());
         
          // add the label to the list of labels
          if (!labels.containsKey(injLabIter.key())) {
            labels.put(injLabIter.key(), 1.0);
          }
View Full Code Here
565
566
567
568
569
570
571
572
573
574
575
          double currVal = classSeedSum.containsKey(injLabIter.key()) ?
            classSeedSum.get(injLabIter.key()) : 0;
          classSeedSum.put(injLabIter.key(), currVal + injLabIter.value());
         
          // add the label to the list of labels
          if (!labels.containsKey(injLabIter.key())) {
            labels.put(injLabIter.key(), 1.0);
          }
        }
      }
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.