Package ivory.cascade.model

Examples of ivory.cascade.model.CascadeClique

82
83
84
85
86
87
88
89
90
91
92
        cliqueNodes.add(termNode);

        // Get the potential function.
        PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

        c = new CascadeClique(cliqueNodes, potential, parameter, cascadeStage, pruner_and_params);

        cliques.add(c);
      }

      // Update last term node.
View Full Code Here
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
        }

        // Get the potential function.
        PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

        c = new CascadeClique(cliqueNodes, potential, parameter, cascadeStage, pruner_and_params);
        cliques.add(c);
      } else if (!ordered && !singleTerm && !contiguous) {
        cliqueNodes = Lists.newArrayList();
        if (docDependent) {
          cliqueNodes.add(docNode);
        }
        for (int j = 0; j < binary.length(); j++) {
          if (binary.charAt(j) == '1') {
            TermNode termNode = new TermNode(queryTerms[j]);
            cliqueNodes.add(termNode);
          }
        }

        // Get the potential function.
        PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

        c = new CascadeClique(cliqueNodes, potential, parameter, cascadeStage, pruner_and_params);
        cliques.add(c);
      }
    }

    return cliques;
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
301
    }

    int totalCnt = mMRF.getCliques().size();
    Map<Integer, Set<CascadeClique>> cascadeStages = Maps.newHashMap();
    for (Clique c : mMRF.getCliques()) {
      CascadeClique cc = (CascadeClique) c;
      int stage = cc.getCascadeStage();
      if ( cascadeStages.containsKey(stage)) {
        cascadeStages.get(stage).add(cc);
      } else {
        cascadeStages.put(stage, Sets.newHashSet(cc));
      }
View Full Code Here
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
      int[][] termPositions = new int[cliques.size()][];
      int doclen = -1;

      for (int i = 0; i < cliques.size(); i++) {
        // Current clique that we're scoring.
        CascadeClique c = (CascadeClique) cliques.get(i);

        if (firstTime) {
          termToCliqueNumber.put(c.getConcept().trim().toLowerCase(), i);
          cf.put(c.getConcept().trim().toLowerCase(), c.termCollectionCF());
          df.put(c.getConcept().trim().toLowerCase(), c.termCollectionDF());
        }

        if (score + docMaxScore <= scoreThreshold) {
          // Advance postings readers (but don't score).
          for (int j = i; j < cliques.size(); j++) {
            cliques.get(j).setNextCandidate(docno + 1);
          }
          skipped = true;

          break;
        }

        // Document independent cliques do not affect the ranking.
        if (!c.isDocDependent()) {
          continue;
        }

        // Update document score.
        float cliqueScore = c.getPotential();
        score += c.getWeight() * cliqueScore;

        // Update the max score for the rest of the cliques.
        docMaxScore -= c.getMaxScore();

        // stuff needed for document evaluation in the next stage
        int[] p = c.getPositions();

        if (p != null) {
          termPositions[i] = Arrays.copyOf(p, p.length);
          doclen = c.getDocLen();
        }
      }

      firstTime = false;

View Full Code Here
77
78
79
80
81
82
83
84
85
      cliqueNodes.add(termNode);

      // Get the potential function.
      PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

      Clique c = new CascadeClique(cliqueNodes, potential, termParameter, cascadeStage, pruner_and_params);
      addClique(c);
    }
  }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
        cliqueNodes.add(termNode);

        // Get the potential function.
        PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

        c = new CascadeClique(cliqueNodes, potential, parameter, cascadeStage, pruner_and_params);

        cliques.add(c);
      }

      // Update last term node.
View Full Code Here
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
        }

        // Get the potential function.
        PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

        c = new CascadeClique(cliqueNodes, potential, parameter, cascadeStage, pruner_and_params);
        cliques.add(c);
      } else if (!ordered && !singleTerm && !contiguous) {
        cliqueNodes = Lists.newArrayList();
        if (docDependent) {
          cliqueNodes.add(docNode);
        }
        for (int j = 0; j < binary.length(); j++) {
          if (binary.charAt(j) == '1') {
            TermNode termNode = new TermNode(queryTerms[j]);
            cliqueNodes.add(termNode);
          }
        }

        // Get the potential function.
        PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

        c = new CascadeClique(cliqueNodes, potential, parameter, cascadeStage, pruner_and_params);
        cliques.add(c);
      }
    }

    return cliques;
View Full Code Here
77
78
79
80
81
82
83
84
85
      cliqueNodes.add(termNode);

      // Get the potential function.
      PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

      Clique c = new CascadeClique(cliqueNodes, potential, termParameter, cascadeStage, pruner_and_params);
      addClique(c);
    }
  }
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
301
    }

    int totalCnt = mMRF.getCliques().size();
    Map<Integer, Set<CascadeClique>> cascadeStages = Maps.newHashMap();
    for (Clique c : mMRF.getCliques()) {
      CascadeClique cc = (CascadeClique) c;
      int stage = cc.getCascadeStage();
      if ( cascadeStages.containsKey(stage)) {
        cascadeStages.get(stage).add(cc);
      } else {
        cascadeStages.put(stage, Sets.newHashSet(cc));
      }
View Full Code Here
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
      int[][] termPositions = new int[cliques.size()][];
      int doclen = -1;

      for (int i = 0; i < cliques.size(); i++) {
        // Current clique that we're scoring.
        CascadeClique c = (CascadeClique) cliques.get(i);

        if (firstTime) {
          termToCliqueNumber.put(c.getConcept().trim().toLowerCase(), i);
          cf.put(c.getConcept().trim().toLowerCase(), c.termCollectionCF());
          df.put(c.getConcept().trim().toLowerCase(), c.termCollectionDF());
        }

        if (score + docMaxScore <= scoreThreshold) {
          // Advance postings readers (but don't score).
          for (int j = i; j < cliques.size(); j++) {
            cliques.get(j).setNextCandidate(docno + 1);
          }
          skipped = true;

          break;
        }

        // Document independent cliques do not affect the ranking.
        if (!c.isDocDependent()) {
          continue;
        }

        // Update document score.
        float cliqueScore = c.getPotential();
        score += c.getWeight() * cliqueScore;

        // Update the max score for the rest of the cliques.
        docMaxScore -= c.getMaxScore();

        // stuff needed for document evaluation in the next stage
        int[] p = c.getPositions();

        if (p != null) {
          termPositions[i] = Arrays.copyOf(p, p.length);
          doclen = c.getDocLen();
        }
      }

      firstTime = false;

View Full Code Here
TOP

Related Classes of ivory.cascade.model.CascadeClique

  • ivory.cascade.model.builder.CascadeCliqueFactory
  • ivory.cascade.model.builder.CascadeTermCliqueSet
  • ivory.cascade.retrieval.CascadeEval
  • ivory.smrf.model.potential.PotentialFunction
    • 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.