gr.demokritos.iit.jinsect.documentModel.representations
Class DocumentNGramSymWinDistroGraph

java.lang.Object
  extended by gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGraph
      extended by gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramDistroGraph
          extended by gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramSymWinDistroGraph
All Implemented Interfaces:
java.io.Serializable, java.lang.Cloneable

public class DocumentNGramSymWinDistroGraph
extends DocumentNGramDistroGraph

See Also:
Serialized Form

Field Summary
 
Fields inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramDistroGraph
EdgeDistros
 
Fields inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGraph
CorrelationWindow, DataString, DegradedEdges, MaxSize, MinSize, NGramGraphArray, Normalizer, TextPreprocessor, WordEvaluator
 
Constructor Summary
DocumentNGramSymWinDistroGraph()
          Creates a new instance of DocumentNGramSymWinDistroGraph
DocumentNGramSymWinDistroGraph(int iMinSize, int iMaxSize, int iCorrelationWindow)
           
 
Method Summary
 void createGraphs()
          Creates the graph of n-grams, for all the levels specified in the MinSize, MaxSize range.
 void createSymEdgesConnecting(Graph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram)
          Creates an edge in [gGraph] connecting [sStartNode] to each node in the [lOtherNodes] list of nodes, as well as other nodes to [sBaseNode].
static void main(java.lang.String[] sArgs)
           
 
Methods inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramDistroGraph
clone, createEdgesConnecting, getEdgesToDistros, InitGraphs, intersectAndDeltaDistroGraph, intersectDistroGraph, inverseIntersectDistroGraph, mergeDistroGraph
 
Methods inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGraph
calcCoexistenceImportance, calcCoexistenceImportance, createWeightedEdgesConnecting, degrade, degredationDegree, deleteItem, getAllNodes, getDataString, getGraphLevel, getGraphLevelByNGramSize, getMaxSize, getMinSize, getWindowSize, intersectGraph, inverseIntersectGraph, isEmpty, length, loadDataStringFromFile, mergeGraph, nullify, prune, setDataString, toCooccurenceText
 
Methods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

DocumentNGramSymWinDistroGraph

public DocumentNGramSymWinDistroGraph()
Creates a new instance of DocumentNGramSymWinDistroGraph


DocumentNGramSymWinDistroGraph

public DocumentNGramSymWinDistroGraph(int iMinSize,
                                      int iMaxSize,
                                      int iCorrelationWindow)
Method Detail

createGraphs

public void createGraphs()
Description copied from class: DocumentNGramGraph
Creates the graph of n-grams, for all the levels specified in the MinSize, MaxSize range.

Overrides:
createGraphs in class DocumentNGramGraph

createSymEdgesConnecting

public void createSymEdgesConnecting(Graph gGraph,
                                     java.lang.String sStartNode,
                                     java.util.List lOtherNodes,
                                     java.util.HashMap hAppearenceHistogram)
Creates an edge in [gGraph] connecting [sStartNode] to each node in the [lOtherNodes] list of nodes, as well as other nodes to [sBaseNode]. If an edge exists, its weight is increased by [iIncreaseWeight], else its weight is set to [iStartWeight]

Parameters:
gGraph - The graph to use
sStartNode - The node from which all edges begin
lOtherNodes - The list of nodes to which sBaseNode is connected. The list MUST BE ORDERED ASCENDINGLY based on distance from the sStartNode.
hAppearenceHistogram - The histogram of appearences of the terms

main

public static void main(java.lang.String[] sArgs)