Package gnu.trove

Examples of gnu.trove.TIntArrayList

100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
      idxs[i] = ptl.indexAtLocation (i);
      vals[i] = ptl.logValue (i);
    }

    RankedFeatureVector rfv = new RankedFeatureVector (new Alphabet(), idxs, vals);
    TIntArrayList idxList = new TIntArrayList ();
    TDoubleArrayList valList = new TDoubleArrayList ();

    double mass = Double.NEGATIVE_INFINITY;
    double logAlpha = Math.log (alpha);
    for (int rank = 0; rank < rfv.numLocations (); rank++) {
      int idx = rfv.getIndexAtRank (rank);
      double val = rfv.value (idx);
      mass = Maths.sumLogProb (mass, val);
      idxList.add (idx);
      valList.add (val);
      if (mass > logAlpha) {
        break;
      }
    }

    int[] szs = computeSizes (ptl);
    SparseMatrixn m = new SparseMatrixn (szs, idxList.toNativeArray (), valList.toNativeArray ());

    TableFactor result = new TableFactor (computeVars (ptl));
    result.setValues (m);

    return result;
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
  transient private TIntArrayList included;

  public ListVarSet (Universe universe, Collection included)
  {
    this.universe = universe;
    this.included = new TIntArrayList (included.size ());

    java.util.Iterator it = included.iterator();
    while (it.hasNext()) {
      this.included.add (universe.getIndex ((Variable) it.next ()));
    }
View Full Code Here
208
209
210
211
212
213
214
  {
    in.defaultReadObject ();
    int version = in.readInt ();
    universe = (Universe) in.readObject ();
    int[] vals = (int[]) in.readObject ();
    included = new TIntArrayList (vals);
  }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
  }

  private SparseMatrixn make3dMatrix ()
  {
    int[] sizes = new int[]{2, 3, 4};
    TIntArrayList idxs = new TIntArrayList ();
    TDoubleArrayList vals = new TDoubleArrayList ();

    for (int i = 0; i < 24; i++) {
      if (i % 3 != 0) {
        idxs.add (i);
        vals.add (2.0 * i);
      }
    }

    SparseMatrixn a = new SparseMatrixn (sizes, idxs.toNativeArray (), vals.toNativeArray ());
    return a;
  }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
    instanceBeingClustered = (unclusteredInstances.size() == 0) ? -1 :
                             unclusteredInstances.remove(0);   
  }

  private void fillUnclusteredInstances (int size) {
    unclusteredInstances = new TIntArrayList(size);
    for (int i = 0; i < size; i++)
      unclusteredInstances.add(i);
    unclusteredInstances.shuffle(random);
  }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
    return (Variable[]) vars.toArray (new Variable [vars.size ()]);
  }

  private int[] toValueArray ()
  {
    TIntArrayList vals = new TIntArrayList (maxTime () * numSlices ());
    for (int t = 0; t < lblseq.size (); t++) {
      Labels lbls = lblseq.getLabels (t);
      for (int j = 0; j < lbls.size (); j++) {
        Label lbl = lbls.get (j);
        vals.add (lbl.getIndex ());
      }
    }
    return vals.toNativeArray ();
  }
View Full Code Here
513
514
515
516
517
518
519
520
521
522
523
    {
      LabelsAssignment lblseq = (LabelsAssignment) inst.getTarget ();
      factors = new TIntArrayList [lblseq.numSlices ()];
      for (int i = 0; i < lblseq.numSlices (); i++) {
        LabelAlphabet dict = lblseq.getOutputAlphabet (i);
        factors[i] = new TIntArrayList (dict.size ());
        for (int j = 0; j < dict.size (); j++) {
          int idx = alphabet.lookupIndex (dict.lookupObject (j));
          factors[i].add (idx);
        }
      }
View Full Code Here
50
51
52
53
54
55
56
57
    this.numFeatures = numFeatures;
    this.numLabels = numLabels;
    this.useValues = useValues;
    this.normalize = normalize;
    this.constraints = new TIntObjectHashMap<MaxEntL2IndGEConstraint>();
    this.indexCache = new TIntArrayList();
    this.valueCache = new TDoubleArrayList();
  }
View Full Code Here
40
41
42
43
44
45
46
47
  public MaxEntFLGEConstraints(int numFeatures, int numLabels, boolean useValues) {
    this.numFeatures = numFeatures;
    this.numLabels = numLabels;
    this.useValues = useValues;
    this.constraints = new TIntObjectHashMap<MaxEntFLGEConstraint>();
    this.indexCache = new TIntArrayList();
    this.valueCache = new TDoubleArrayList();
  }
View Full Code Here
39
40
41
42
43
44
45
46
  public MaxEntFLPRConstraints(int numFeatures, int numLabels, boolean useValues) {
    this.useValues = useValues;
    this.numFeatures = numFeatures;
    this.numLabels = numLabels;
    this.constraints = new TIntObjectHashMap<MaxEntFLPRConstraint>();
    this.indexCache = new TIntArrayList();
    this.valueCache = new TDoubleArrayList();
  }
View Full Code Here
TOP

Related Classes of gnu.trove.TIntArrayList

  • cc.mallet.classify.constraints.ge.MaxEntFLGEConstraints
  • cc.mallet.classify.constraints.ge.MaxEntRangeL2FLGEConstraints
  • cc.mallet.classify.constraints.pr.MaxEntFLPRConstraints
  • cc.mallet.cluster.GreedyAgglomerativeByDensity
  • cc.mallet.cluster.tui.Text2Clusterings
  • cc.mallet.fst.semi_supervised.constraints.OneLabelGEConstraints
  • cc.mallet.fst.semi_supervised.constraints.OneLabelL2RangeGEConstraints
  • cc.mallet.fst.semi_supervised.constraints.TwoLabelGEConstraints
  • cc.mallet.fst.semi_supervised.pr.constraints.OneLabelL2IndPRConstraints
  • cc.mallet.fst.semi_supervised.pr.constraints.OneLabelL2PRConstraints
    • 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.