Examples of svm_node

Examples of ca.uwo.csd.ai.nlp.libsvm.svm_node

21
22
23
24
25
26
27
        array = instances.toArray(array);
        return predict(array, model, displayResult);
    }

    public static double predict(Instance instance, svm_model model, boolean displayResult) {
        return svm.svm_predict(model, new svm_node(instance.getData()));
    }
View Full Code Here

Examples of ca.uwo.csd.ai.nlp.libsvm.svm_node

25
26
27
28
29
30
31
    public static double predict(Instance instance, svm_model model, boolean displayResult) {
        return svm.svm_predict(model, new svm_node(instance.getData()));
    }
   
    public static double predictProbability(Instance instance, svm_model model, double[] probabilities) {
        return svm.svm_predict_probability(model, new svm_node(instance.getData()), probabilities);
    }   
View Full Code Here

Examples of ca.uwo.csd.ai.nlp.libsvm.svm_node

41
42
43
44
45
46
47
48
49
50
51
        double[] predictions = new double[instances.length];
        int count = 0;

        for (Instance instance : instances) {
            double target = instance.getLabel();
            double p = svm.svm_predict(model, new svm_node(instance.getData()));
            predictions[count++] = p;

            ++total;
            if (p == target) {
                correct++;
View Full Code Here

Examples of ca.uwo.csd.ai.nlp.libsvm.svm_node

32
33
34
35
36
37
38
39
40
        prob.y = new double[prob.l];
        prob.x = new svm_node[prob.l];
       
        for (int i = begin; i <= end; i++) {
            prob.y[i-begin] = instances[i].getLabel();
            prob.x[i-begin] = new svm_node(instances[i].getData());
        }
        return prob;
    }
View Full Code Here

Examples of libsvm.svm_node

211
212
213
214
215
216
217
218
219
220
221
          problem.y[i] = y;
          problem.x[i] = new svm_node[featureList.size()];
          int p = 0;
              for (int k=0; k < featureList.size(); k++) {
                MaltFeatureNode x = featureList.get(k);
            problem.x[i][p] = new svm_node();
            problem.x[i][p].value = x.getValue();
            problem.x[i][p].index = x.getIndex();         
            p++;
          }
          i++;
View Full Code Here

Examples of libsvm.svm_node

632
633
634
635
636
637
638
639
640
641
642
          for(j = 1; j < columns.length; j++) {
            final String[] items = pipePattern.split(columns[j]); 
            for (int k = 0; k < items.length; k++) {
              try {
                if (Integer.parseInt(items[k]) != -1) {
                  xlist.add(p, new svm_node());
                  xlist.get(p).value = 1;
                  xlist.get(p).index = Integer.parseInt(items[k])+offset;
                  p++;
                }
              } catch (NumberFormatException e) {
View Full Code Here

Examples of libsvm.svm_node

67
68
69
70
71
72
73
74
75
76
77
            int m = trainingSample.size();
            svm_node[] x = new svm_node[m];
            Entry<Integer, Double> currentEntry;
            for (int j = 0; j < m; j++) {
                currentEntry = it.next();
                x[j] = new svm_node();
                x[j].index = currentEntry.getKey();
                x[j].value = currentEntry.getValue();
            }
            return svm.svm_predict(currentModel, x);
        } catch (IOException ex) {
View Full Code Here

Examples of libsvm.svm_node

122
123
124
125
126
127
128
129
130
131
132
            it = currentFeatures.entrySet().iterator();
            m = currentFeatures.size();
            x = new svm_node[m];
            for (int j = 0; j < m; j++) {
                currentEntry = it.next();
                x[j] = new svm_node();
                x[j].index = currentEntry.getKey();
                x[j].value = currentEntry.getValue();
            }
            if (m > 0) {
                max_index = Math.max(max_index, x[m - 1].index);
View Full Code Here

Examples of libsvm.svm_node

65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
        Object val = aac.getClass().getMethod("calcm"+feats[i]).invoke(aac);
        if (val instanceof String) {
          String s = (String) val;
          if (s.equals("yes") || s.equals("Y") || s.equals("C") || s.equals("P")) {
//            vec += " " + (i+1) + ":1";
            svm_node node = new svm_node();
            node.index = i+1;
            node.value = 1;
            nodeList.add(node);
          } else if (s.equals("S")) {
//            vec += " " + (i+1) + ":0.5";
            svm_node node = new svm_node();
            node.index = i+1;
            node.value = 0.5;
            nodeList.add(node);
          } else if (!s.equals("U") && !s.equals("N") && !s.equals("no") && !s.equals("I")){ //TODO: cleanup
            int ii = Integer.parseInt(s);
            if (ii>=0 && ii<=6){
//              vec += " " + (i+1) + ":" + (ii/6.0);
              svm_node node = new svm_node();
              node.index = i+1;
              node.value = ii/6.0;
              nodeList.add(node);
            }
           
View Full Code Here

Examples of libsvm.svm_node

124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
    for (int i = 0; i < feats.length; i++, ind++) {
      try {
        if (feats[i].equals("Anaph")) {
          double anaph_prob = needsAnaph ? calcAnaphoricity(aJCas, anaphor) : 1.0;
//          vec += " " + (ind+1) + ":" + anaph_prob;
          svm_node n = new svm_node();
          n.index = ind+1;
          n.value = anaph_prob;
          nodes.add(n);
          continue;
        }
        if (feats[i].contains(":")){
          String[] catFeat = feats[i].split(":");
          String featType = catFeat[0];
          String featName = catFeat[1];
          // if catFeat[0].equalsIgnoreCase("cat"){}   // Not necessary, no other feature namespaces used yet.
          String methodName = "num" + featName;
          //          Class<String> strClass = new Class<String>();
          int num = (Integer) sac.getClass().getMethod(methodName, Markable.class).invoke(sac, anaphor);
          methodName = "calc" + featType + featName;
          Method method = sac.getClass().getMethod(methodName, Integer.class, Markable.class);
          for(int j = 0; j < num; j++, ind++){
            String val = (String) method.invoke(sac, j, anaphor);
            if(val.equalsIgnoreCase("Y")){
              svm_node n = new svm_node();
              n.index = ind+1;
              n.value = 1;
              nodes.add(n);
//              vec += " " + (ind+1) + ":1";
            }
          }
          continue;
        }else{
          Object val = sac.getClass().getMethod("calc"+feats[i]).invoke(sac);
          if (val instanceof String) {
            String s = (String) val;
            if (s.equals("yes") || s.equals("Y") || s.equals("C")) {
              //            vec += " " + (ind+1) + ":1";
              svm_node n = new svm_node();
              n.index = ind+1;
              n.value = 1;
              nodes.add(n);
            }
          }
          else if (val instanceof Integer) {
            int v = ((Integer)val).intValue();
            if (v!=0) {
              //            vec += " " + (ind+1) + ":" + ((double)v/(i==0?600:10));
              svm_node n = new svm_node();
              n.index = ind+1;
              n.value = (double) v; // ((double)v/(i==0?600:10));
              nodes.add(n);
            }
          }
          else if (val instanceof Double) {
            //          vec += " " + (ind+1) + ":" + val;
            if((Double)val != 0.0){
              svm_node n = new svm_node();
              n.index = ind+1;
              n.value = (Double) val;
              nodes.add(n);
            }
          }
        }
      } catch (Exception e) { e.printStackTrace(); }
    }
   
    if(frags != null && frags.size() > 0){
      SimpleTree tn = TreeExtractor.extractPathTree(MarkableTreeUtils.markableNode(aJCas, antecedent.getBegin(), antecedent.getEnd()),
          MarkableTreeUtils.markableNode(aJCas, anaphor.getBegin(), anaphor.getEnd()));
//      SimpleTree tn = TreeExtractor.extractPathEnclosedTree(MarkableTreeUtils.markableNode(aJCas, antecedent.getBegin(), antecedent.getEnd()),
//          MarkableTreeUtils.markableNode(aJCas, anaphor.getBegin(), anaphor.getEnd()),
//          aJCas);
      // now go over the tree fragment features:
      for(SimpleTree frag : frags){
        if(TreeUtils.contains(tn, frag)){
          svm_node n = new svm_node();
          n.index = ind+1;
          n.value = 1.0;
          nodes.add(n);
        }
        ind++;
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.