Package ivory.smrf.model

Examples of ivory.smrf.model.Clique$MaxScoreComparator

63
64
65
66
67
68
69
70
71
72
73
      throw new ConfigurationException("A potential attribute must be specified in order to generate a clique set!");
    }

    // If there is more than one term, then add appropriate cliques.
    List<GraphNode> cliqueNodes = null;
    Clique c = null;
    TermNode lastTermNode = null;

    for (String element : queryTerms) {
      // Term node.
      TermNode termNode = new TermNode(element);
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
    if (potentialType == null) {
      throw new ConfigurationException("A potential attribute must be specified in order to generate a clique set!");
    }
    // If there is more than one term, then add appropriate cliques.
    ArrayList<GraphNode> cliqueNodes = null;
    Clique c = null;

    for (int i = 1; i < Math.pow(2, queryTerms.length); i++) {
      String binary = Integer.toBinaryString(i);
      int padding = queryTerms.length - binary.length();
      for (int j = 0; j < padding; j++) {
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
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
      // Document-at-a-time scoring.
      float docMaxScore = mrfMaxScore;
      boolean skipped = false;
      for (int i = 0; i < cliques.size(); i++) {
        // Current clique that we're scoring.
        Clique c = cliques.get(i);

        // If there's no way that this document can enter the result set
        // then exit.
        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.
        score += c.getWeight() * c.getPotential();

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

      // Keep track of mNumResults best accumulators.
      if (!skipped && score > scoreThreshold) {
        a.docno = docno;
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    String potentialType = XMLTools.getAttributeValueOrThrowException(domNode, "potential",
        "A potential attribute must be specified in order to generate a clique set!");

    // If there is more than one term, then add appropriate cliques.
    List<GraphNode> cliqueNodes = null;
    Clique c = null;
    TermNode lastTermNode = null;

    for (String element : queryTerms) {
      // Term node.
      TermNode termNode = new TermNode(element);

      // Add sequential cliques.
      if (lastTermNode != null) {
        cliqueNodes = Lists.newArrayList();
        if (docDependent) {
          cliqueNodes.add(docNode);
        }
        cliqueNodes.add(lastTermNode);
        cliqueNodes.add(termNode);

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

        c = new Clique(cliqueNodes, potential, parameter);
        cliques.add(c);
      }

      // Update last term node.
      lastTermNode = termNode;
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
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
    String potentialType = XMLTools.getAttributeValueOrThrowException(domNode, "potential",
        "A potential attribute must be specified in order to generate a clique set!");

    // If there is more than one term, then add appropriate cliques.
    ArrayList<GraphNode> cliqueNodes = null;
    Clique c = null;

    for (int i = 1; i < Math.pow(2, queryTerms.length); i++) {
      String binary = Integer.toBinaryString(i);
      int padding = queryTerms.length - binary.length();
      for (int j = 0; j < padding; j++) {
        binary = "0" + binary;
      }

      boolean singleTerm = false;
      boolean contiguous = true;

      int firstOne = binary.indexOf('1');
      int lastOne = binary.lastIndexOf('1');
      if (lastOne == firstOne) {
        singleTerm = true;
      }

      for (int j = binary.indexOf('1') + 1; j <= binary.lastIndexOf('1') - 1; j++) {
        if (binary.charAt(j) == '0') {
          contiguous = false;
          break;
        }
      }

      if (ordered && !singleTerm && contiguous) {
        cliqueNodes = Lists.newArrayList();
        if (docDependent) {
          cliqueNodes.add(docNode);
        }
        for (int j = firstOne; j <= lastOne; j++) {
          TermNode termNode = new TermNode(queryTerms[j]);
          cliqueNodes.add(termNode);
        }

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

        c = new Clique(cliqueNodes, potential, parameter);
        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 Clique(cliqueNodes, potential, parameter);
        cliques.add(c);
      }
    }

    return cliques;
View Full Code Here
72
73
74
75
76
77
78
79
80
      cliqueNodes.add(termNode);

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

      Clique c = new Clique(cliqueNodes, potential, termParameter);
      addClique(c);
    }
  }
View Full Code Here
57
58
59
60
61
62
63
64
    String potentialType = XMLTools.getAttributeValueOrThrowException(domNode, "potential",
        "Error: A potential type must be specified!");

    PotentialFunction potential = PotentialFunction.create(env, potentialType, domNode);

    Clique c = new Clique(cliqueNodes, potential, parameter, 1.0f, getType(), true);
    addClique(c);
  }
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
        TermNode termNode = new TermNode(concept);
        cliqueNodes.add(termNode);

        PotentialFunction potential = new QueryPotential(env, generator, fn);

        Clique c = new Clique(cliqueNodes, potential, parameter);
        c.setType(Clique.Type.Term);

        // Scale importance values by LCE likelihood.
        float normalizedScore = expanderWeight * (a.score / totalWt);
        if (importanceModel != null) {
          c.setImportance(normalizedScore * importanceModel.getCliqueWeight(c));
        } else {
          c.setImportance(normalizedScore);
        }

        expandedMRF.addClique(c);
      }
    }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    String potentialType = XMLTools.getAttributeValueOrThrowException(domNode, "potential",
        "A potential attribute must be specified in order to generate a clique set!");

    // If there is more than one term, then add appropriate cliques.
    List<GraphNode> cliqueNodes = null;
    Clique c = null;
    TermNode lastTermNode = null;

    for (String element : queryTerms) {
      // Term node.
      TermNode termNode = new TermNode(element);

      // Add sequential cliques.
      if (lastTermNode != null) {
        cliqueNodes = Lists.newArrayList();
        if (docDependent) {
          cliqueNodes.add(docNode);
        }
        cliqueNodes.add(lastTermNode);
        cliqueNodes.add(termNode);

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

        c = new Clique(cliqueNodes, potential, parameter);
        cliques.add(c);
      }

      // Update last term node.
      lastTermNode = termNode;
View Full Code Here
TOP

Related Classes of ivory.smrf.model.Clique$MaxScoreComparator

  • ivory.cascade.model.builder.CascadeCliqueFactory
  • ivory.cascade.model.builder.CascadeTermCliqueSet
  • ivory.smrf.model.builder.CliqueFactory
  • ivory.smrf.model.builder.DocumentCliqueSet
  • ivory.smrf.model.builder.TermCliqueSet
  • ivory.smrf.model.expander.UnigramLatentConceptExpander
  • ivory.smrf.retrieval.MRFDocumentRanker
    • 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.