Package gnu.trove.iterator

Examples of gnu.trove.iterator.TIntFloatIterator

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
  }

  @Override
  public void addThruPipe(Instance inst) {
    HashSparseVector data = (HashSparseVector) inst.getData();
    TIntFloatIterator it = data.data.iterator();
    while (it.hasNext()) {
      it.advance();
      int id = it.key();
      if (idf[id] > 0) {
        float value = (float) (it.value()*Math.log(docNum / idf[id]));
        data.put(id, value);
      }
    }

  }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
  public void noFeatureSelection(){
    Arrays.fill(isUseful, true);
  }
  public HashSparseVector select(HashSparseVector vec){
    HashSparseVector sv=new HashSparseVector();   
    TIntFloatIterator it=vec.data.iterator();
    while(it.hasNext()){
      it.advance();
      if(isUseful[it.key()])
        sv.put(it.key(), it.value());
    }
    return sv;
  }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
  }

  @Override
  public void addThruPipe(Instance inst) {
    HashSparseVector data = (HashSparseVector) inst.getData();
    TIntFloatIterator it = data.data.iterator();
    while (it.hasNext()) {
      it.advance();
      idf[it.key()]++;
    }
  }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
    else{
      return false;
    }
   
    HashSparseVector data = (HashSparseVector) inst.getData();
    TIntFloatIterator it = data.data.iterator();
    while (it.hasNext()) {
      it.advance();
      int feature=it.key();
      for(int i=0;i<type.length;i++){
        addItemFrequency(feature, type[i], (int)it.value());
      }
    }
   
    return true;
  }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
   * @return 数组下标
   */
  public static int[] sort(TIntFloatHashMap tmap) {
    HashMap<Integer, Float> map = new HashMap<Integer, Float>();

    TIntFloatIterator it = tmap.iterator();
    while (it.hasNext()) {
      it.advance();
      int id = it.key();
      float val = it.value();
      map.put(id, Math.abs(val));
    }
    it = null;

    List<Entry> list = sort(map);
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
  /**
   * 一次性统计概率，节约时间
   */
  private void statisticProb() {
    System.out.println("统计概率");
    TIntFloatIterator it = wordProb.iterator();
    while(it.hasNext()){
      it.advance();
      float v = it.value()/totalword;
      it.setValue(v);
      int key = it.key();
      if(key<0)
        continue;
      Cluster cluster = new Cluster(key,v,alpahbet.lookupString(key));
      clusters.put(key, cluster);
    }

    TIntObjectIterator<TIntFloatHashMap> it1 = pcc.iterator();
    while(it1.hasNext()){
      it1.advance();
      TIntFloatHashMap map = it1.value();
      TIntFloatIterator it2 = map.iterator();
      while(it2.hasNext()){
        it2.advance();
        it2.setValue(it2.value()/totalword);
      }
    }

  }
View Full Code Here
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
    slots.remove(c2);
    slots.add(newid);
    pcc.put(newid, newpcc);
    pcc.remove(c1);
    pcc.remove(c2);
    TIntFloatIterator it2 = inewpcc.iterator();
    while(it2.hasNext()){
      it2.advance();
      TIntFloatHashMap pmap = pcc.get(it2.key());
      //            if(pmap==null){
      //              pmap = new TIntFloatHashMap();
      //              pcc.put(it2.key(), pmap);
      //            }
      pmap.put(newid, it2.value());
      pmap.remove(c1);
      pmap.remove(c2);
    }


    //
    //newid 永远大于 it3.key;
    wcc.put(newid, new TIntFloatHashMap());
    wcc.remove(c1);
    wcc.remove(c2);
    TIntFloatIterator it3 = newwcc.iterator();
    while(it3.hasNext()){
      it3.advance();
      TIntFloatHashMap pmap = wcc.get(it3.key());
      pmap.put(newid, it3.value());
      pmap.remove(c1);
      pmap.remove(c2);
    }

    wordProb.remove(c1);
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
   * v + sv
   * @param sv
   */
  public void plus(ISparseVector sv) {
    if(sv instanceof HashSparseVector){
      TIntFloatIterator it = ((HashSparseVector) sv).data.iterator();
      while(it.hasNext()){
        it.advance();
        data.adjustOrPutValue(it.key(), it.value(),it.value());
      }
    }else if(sv instanceof BinarySparseVector){
      TIntIterator it = ((BinarySparseVector) sv).data.iterator();
      while(it.hasNext()){
        int i = it.next();
        data.adjustOrPutValue(i,DefaultValue,DefaultValue);
      }
    }

  }
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
   * @param sv
   * @param w
   */
  public void plus(ISparseVector sv, float w) {
    if(sv instanceof HashSparseVector){
      TIntFloatIterator it = ((HashSparseVector) sv).data.iterator();
      while(it.hasNext()){
        it.advance();
        float v = it.value()*w;
        data.adjustOrPutValue(it.key(), v,v);
      }
    }else if(sv instanceof BinarySparseVector){
      TIntIterator it = ((BinarySparseVector) sv).data.iterator();
      while(it.hasNext()){
        int i = it.next();
        data.adjustOrPutValue(i,w,w);
      }
    }
  }
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
   * @return
   */
  public float cos(HashSparseVector sv) {
    float v =0f;
    if(sv.size() < data.size()){
      TIntFloatIterator it = sv.data.iterator();     
      while(it.hasNext()){
        it.advance();
        v += data.get(it.key())*it.value();
      }
    }else{
      TIntFloatIterator it = data.iterator();     
      while(it.hasNext()){
        it.advance();
        v += sv.data.get(it.key())*it.value();
      }
    }
    TIntFloatIterator it = sv.data.iterator();
    float sum=0.0f;
    while (it.hasNext()) {
      it.advance();
      if(it.key()==0)
        continue;
      sum+=it.value()*it.value();
    }
    v/=Math.abs(sum)<0.00001?1:Math.sqrt(sum);
    it = data.iterator();
    sum=0.0f;
    while (it.hasNext()) {
      it.advance();
      if(it.key()==0)
        continue;
      sum+=it.value()*it.value();
    }
    v/=Math.abs(sum)<0.00001?1:Math.sqrt(sum);
    return v;
  }
View Full Code Here
TOP

Related Classes of gnu.trove.iterator.TIntFloatIterator

  • de.lmu.ifi.dbs.elki.data.SparseFloatVector
  • org.fnlp.ml.classifier.bayes.BayesClassifier
  • org.fnlp.ml.classifier.bayes.ItemFrequency
  • org.fnlp.ml.classifier.hier.ModelAnalysis
  • org.fnlp.ml.feature.FeatureSelect
  • org.fnlp.ml.types.sv.HashSparseVector
  • org.fnlp.nlp.pipe.TF2IDF
  • org.fnlp.nlp.pipe.TFIDF
  • org.fnlp.nlp.similarity.train.KMeansWordCluster
  • org.fnlp.nlp.similarity.train.WordCluster
    • 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.