Uses of Interface
nz.ac.waikato.mcennis.rat.graph.algorithm.Algorithm

Packages that use Algorithm

nz.ac.waikato.bibliography.algorithm
nz.ac.waikato.mcennis.rat.graph.algorithm
nz.ac.waikato.mcennis.rat.graph.algorithm.aggregators
nz.ac.waikato.mcennis.rat.graph.algorithm.clustering
nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering
nz.ac.waikato.mcennis.rat.graph.algorithm.evaluation
nz.ac.waikato.mcennis.rat.graph.algorithm.machinelearning
nz.ac.waikato.mcennis.rat.graph.algorithm.prestige
nz.ac.waikato.mcennis.rat.graph.algorithm.similarity
nz.ac.waikato.mcennis.rat.graph.algorithm.transformToArray
nz.ac.waikato.mcennis.rat.graph.algorithm.visual
nz.ac.waikato.mcennis.rat.gui
nz.ac.waikato.mcennis.rat.scheduler

Uses of Algorithm in nz.ac.waikato.bibliography.algorithm

Classes in nz.ac.waikato.bibliography.algorithm that implement Algorithm

class	OutputBibliographyXML Class for outputting into an XML format the pagerank of each file.
class	OutputBridgesByCluster
class	OutputDifference Class for outputting into an XML format the pagerank of each file.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm that implement Algorithm

class	AddBasicGeodesicPaths Class for calculating all geodesic paths over a set of links and set of actors using a variation of Djikstra's algorithm.
class	AddBasicInterestLink Creates an interest link using exponential similarity to take bag-of-words from a property list to create a link between actors represetning the degree of which their interest overlaps.
class	AddDegreeGraphProperties Add basic degree-based properties for actors and graphs.
class	AddGeodesicProperties Calculates properties of a node: (In/Out) Eccentricity - Wasserman and Faust p111 - modified for directional links Diameter - Wasserman and Faust p111.
class	AddMusicLinks Takes set of artist links and creates music userlinks between users based on the degree of similarity in musical tastes.
class	AddMusicRecommendations Creates derived user->artist links from knows, interest, and music links.
class	AddMusicReferences Class that takes interest links, determines which are artists, then creates an artist actor and links the user to this artist.
class	Difference Algorithm for calculating the difference across properties of an actor
class	ExtractMusicCoverage Class that enumerates all artists that are present in the given dataset.
class	IdentifyBridges Algorithm for calculating the difference across properties of an actor
class	OptimizedPathBase Class that calculates geodesic paths using Djikstra's spanning tree algorithm Hooks are provided for subclasses to use each spanning tree for one actor so that the algorithms can become linear in space rather than O(n2).
class	PrincipalComponentsAnalysis Performs principal component analysis on a colt 2D matrix describing a distance matrix.
class	RankingProperties Reads a Double property and creates a new property reflecting the index of the actor ordered by this property.
class	TrimEdgeUsers Class for removing all actors of a given type (mode) that have no outgoing links

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm that return Algorithm

Algorithm

AlgorithmFactory.create(java.util.Properties props) Creates an algorithm Algorithm is chosen via the 'algorithm' property.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.aggregators

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.aggregators that implement Algorithm

class	AggregateByGraph Class for taking a property of a given ID across actors of a given mode and aggregating these properties into a single property on the enclosing graph.
class	AggregateByLinkProperty Aggregates a single property across links.
class	AggregateLinks Aggregates a single property across links.
class	AggregateOnActor Class for Aggregating the properties of an actor into a single Instance object.
class	CombineProperty
class	FromGraphToActor Class aggregates all the properties of a graph and propogates them to each actor in the graph.
class	PropertyToLink

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.clustering

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.clustering that implement Algorithm

class	BicomponentClusterer Finds all biconnected components (bicomponents) of an undirected graph.
class	EnumerateMaximalCliques Maximal cliques are defined as a fully connected subgraph such that any additional node added to the subgraph is not fully connected.
class	FindStronglyConnectedComponents Algorithm for finding all strongly connected components in a graph.
class	FindWeaklyConnectedComponents Create subgraphs from all weakly connected components.
class	NaiveImplementClique Implements the traditional naive implementation of finidng cliques.
class	NormanGirvanEdgeBetweenessClustering Class implementing NormanGirvan edge betweeness clustering.
class	TraditionalEdgeBetweenessClustering Creates clusters by removing each edge sequentially by order of link betweeness.
class	WekaClassifierClusterer Utilize an arbitrary classifier-clusterer (clusterer that assigns an unknown cluster to exactly one category).
class	WekaProbablisticClusterer Utilize an arbitrary probabilistic-clusterer (vector of probable membership in a cluster).

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering that implement Algorithm

class	AssociativeMining Class that performs collaborative filtering on a set of actors via their links to another mode of actors.
class	Item2Item Performs classic Item to Item collaborative filtering.
class	User2User Performs User to user collaborative filtering where similar users' links to destination actors (items) are used to suggest items for the given user.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.evaluation

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.evaluation that implement Algorithm

class	HalfLife Uses Given(user->artist) as valued ground truth.
class	KendallTau This compares all ordered pairs of recommendations.
class	MeanErrorEvaluation Utilizes Given(user->artist) as ground truth and Derived(user->artist) as predicted values.
class	PearsonCorrelation Utilizes Given(user->artist) as ground truth and Derived(user->artist) as predictions.
class	PrecisionRecallFMeasure Class for calculating a variety of evaluation metrics between Given(user->artist) (ground truth) and a Derived(user->artist) (predicted) set of links.
class	RecommendationError Takes Given(user->artist) links as ground truth and then calculates error using Derived(user->artist) as the predicted values.
class	ROCAreaEvaluation Calculates the integral of the average percent of ground truth present in a ranked list iterating over the list.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.machinelearning

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.machinelearning that implement Algorithm

class	MultiInstanceSVM Derive globally using the same data as the AddMusicRecommendation algorithm.
class	SVM
class	WekaClassifierMultiAttribute
class	WekaClassifierOneAttribute Class for utilizing Weka Machine-Learning non-probabilistic Classifiers.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.prestige

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.prestige that implement Algorithm

class	AddBasicBetweenessCentrality Class for calculating Betweeness as described in Freeman 79 except that multiple geodesic paths between two actors are treated as if they are unique paths.
class	AddBetweenessCentrality Class that provides a betweeness metric that matches Freeman79.
class	AddClosenessCentrality Algorithm that implements closeness as in Freeman79.
class	AddCombinedCloseness Optimized version of Closeness as defined by Freeman79.
class	AddDegreeCentrality Calculates centrality and prestige based on actor degree.
class	AddPageRankPrestige Calcuates the PageRank of an actor using the PageRank algorithm as defined in Langeville and Meyer Langeville, A., and C.
class	HITSPrestige Class implementing a naive implementation of Kelinberg's HITS algorithm (Kleinberg99) Kleinberg, J.
class	OptimizedBetweeness Class built upon OptimizedPathBase that claculates Betweeness.
class	OptimizedCloseness Class that calculates Closeness in O(n) space using OptimizedPathBase.
class	OptimizedLinkBetweeness Class built upon OptimizedPathBase that calculates Betweeness for links.
class	ScalableHitsPrestige Class Implementing the HITS algoerithm by a variation of the power metric as defined in Kleinberg99.
class	ScalablePageRankPrestige Class for calculating the PageRank of an algorithm using the Power method.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.similarity

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.similarity that implement Algorithm

class	GraphSimilarityByProperty Calculates the similarity between two graphs by a given property.
class	HierarchyByCooccurance Initial algorithm for creating an ontology from a folksonomy.
class	SimilarityByLink Determine the similarity between two actors by the data vector implied by the given relation.
class	SimilarityByProperty Calculates similarity between actors via a double[] describing a vector property

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.transformToArray

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.transformToArray that implement Algorithm

class	ActorDistanceMatrix Class for creating a matrix representing the distances between graph nodes.
class	DirectedTriplesHistogram Transforms a graph object (one mode and relation) into a 20 dimensional double array describing a histogram of all triples of actors in the graph.
class	UndirectedTriplesHistogram Transforms a graph object (one mode and relation) into a 4 dimensional double array describing a histogram of all triples of actors in the graph.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.graph.algorithm.visual

Classes in nz.ac.waikato.mcennis.rat.graph.algorithm.visual that implement Algorithm

class	BasicDisplayGraph Class for mapping one mode and one relation into a prefuse display demo.
class	ColoredByPropertyGraph Class for mapping one mode and one relation into a prefuse display demo.
class	DisplayAll Class that displays an entire graph inside a Prefuse display window.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.gui

Methods in nz.ac.waikato.mcennis.rat.gui that return Algorithm

Algorithm[]

ApplicationTableModel.getAlgorithms() Return the algorithms of this application in an ordered array.

Methods in nz.ac.waikato.mcennis.rat.gui with parameters of type Algorithm

void	ApplicationTableModel.addAlgorithm(Algorithm algorithm, int row) If the row is valid, add the algorithm at the given row.

Uses of Algorithm in nz.ac.waikato.mcennis.rat.scheduler

Methods in nz.ac.waikato.mcennis.rat.scheduler with parameters of type Algorithm

void	BasicScheduler.load(Algorithm algorithms, java.util.regex.Pattern pattern)
void	Scheduler.load(Algorithm algorithm, java.util.regex.Pattern graphIDPattern) set an algorithm to be executed.