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

java.lang.Object
  gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGraph
      gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGaussNormGraph
          gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGaussNormSymWinGraph

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable

public class DocumentNGramGaussNormSymWinGraph
extends DocumentNGramGaussNormGraph

See Also:

Serialized Form

Field Summary

Fields inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGaussNormGraph

eclLocator

Fields inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGraph

CorrelationWindow, DataString, DegradedEdges, MaxSize, MinSize, NGramGraphArray, Normalizer, TextPreprocessor, WordEvaluator

Constructor Summary

DocumentNGramGaussNormSymWinGraph()
Creates a new instance of INSECTDocumentGraph

DocumentNGramGaussNormSymWinGraph(int iMinSize, int iMaxSize, int iCorrelationWindow)
Creates a new instance of INSECTDocumentGraph

Method Summary

void	createEdgesConnecting(Graph gGraph, java.lang.String sStartNode, java.util.List lOtherNodes, java.util.HashMap hAppearenceHistogram) Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes.
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[] args)

Methods inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGaussNormGraph

InitGraphs, ScalingFunction

Methods inherited from class gr.demokritos.iit.jinsect.documentModel.representations.DocumentNGramGraph

calcCoexistenceImportance, calcCoexistenceImportance, clone, 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

DocumentNGramGaussNormSymWinGraph

public DocumentNGramGaussNormSymWinGraph()

Creates a new instance of INSECTDocumentGraph

DocumentNGramGaussNormSymWinGraph

public DocumentNGramGaussNormSymWinGraph(int iMinSize,
                                         int iMaxSize,
                                         int iCorrelationWindow)

Creates a new instance of INSECTDocumentGraph

Parameters:

iMinSize - The minimum n-gram size

iMaxSize - The maximum n-gram size

iCorrelationWindow - The standard deviation of the Gaussian scaling function to use when determining neighbouring weights.

Method Detail

createGraphs

public void createGraphs()

Description copied from class: DocumentNGramGaussNormGraph

Creates the graph of n-grams, for all the levels specified in the MinSize, MaxSize range. The whole document is taken into account for neighbouring, even though the distance affects neighbouring importance, by scaling the neighbouring weight by a Gaussian function of distance.

Overrides:

createGraphs in class DocumentNGramGaussNormGraph

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

createEdgesConnecting

public void createEdgesConnecting(Graph gGraph,
                                  java.lang.String sStartNode,
                                  java.util.List lOtherNodes,
                                  java.util.HashMap hAppearenceHistogram)

Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes. If an edge exists, its weight is increased by [iIncreaseWeight], else its weight is set to [iStartWeight]

Overrides:

createEdgesConnecting in class DocumentNGramGaussNormGraph

Parameters:

gGraph - The graph to use

sStartNode - The node from which all edges begin

lOtherNodes - The list of nodes to which sBaseNode is connected

hAppearenceHistogram - The histogram of appearences of the terms

main

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