Uses of Interface
nz.ac.waikato.mcennis.rat.graph.actor.Actor

Packages that use Actor

nz.ac.waikato.mcennis.rat.graph
nz.ac.waikato.mcennis.rat.graph.actor
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.machinelearning
nz.ac.waikato.mcennis.rat.graph.algorithm.prestige
nz.ac.waikato.mcennis.rat.graph.algorithm.reusablecores
nz.ac.waikato.mcennis.rat.graph.algorithm.similarity
nz.ac.waikato.mcennis.rat.graph.algorithm.transformToArray
nz.ac.waikato.mcennis.rat.graph.link
nz.ac.waikato.mcennis.rat.graph.path
nz.ac.waikato.mcennis.rat.graphdisplay

Uses of Actor in nz.ac.waikato.mcennis.rat.graph

Methods in nz.ac.waikato.mcennis.rat.graph that return Actor

Actor[]	Clique.getActor()
Actor[]	DerbyGraph.getActor()
Actor[]	Graph.getActor() Retrieve an array of all actors of all types.
Actor[]	MemGraph.getActor()
Actor[]	NullGraph.getActor()
Actor[]	UserIDList.getActor()
Actor[]	UserList.getActor()
Actor[]	Clique.getActor(java.lang.String type)
Actor[]	DerbyGraph.getActor(java.lang.String type)
Actor[]	Graph.getActor(java.lang.String type) Retrieve an array of all actors of a given type.
Actor[]	MemGraph.getActor(java.lang.String type)
Actor[]	NullGraph.getActor(java.lang.String type)
Actor[]	UserIDList.getActor(java.lang.String type)
Actor[]	UserList.getActor(java.lang.String type)
Actor	Clique.getActor(java.lang.String type, java.lang.String ID)
Actor	DerbyGraph.getActor(java.lang.String type, java.lang.String ID)
Actor	Graph.getActor(java.lang.String type, java.lang.String ID) Retrieve the users that has the given ID.
Actor	MemGraph.getActor(java.lang.String type, java.lang.String ID)
Actor	NullGraph.getActor(java.lang.String type, java.lang.String ID)
Actor	UserIDList.getActor(java.lang.String type, java.lang.String ID) Returns only actors that are present in the index of 'good' actors.
Actor	UserList.getActor(java.lang.String type, java.lang.String ID)
Actor[]	Clique.getIntersection() Returns an unsorted array of actors that every member of the clique points to.
Actor	Clique.getMaxActor() Return the largest (by compareTo) actor in this clique.
protected Actor	DerbyGraph.retrieveActor(int id) Retrieve an actor object from the database with its database's numeric id.

Methods in nz.ac.waikato.mcennis.rat.graph that return types with arguments of type Actor

java.util.Iterator<Actor>	Clique.getActorIterator(java.lang.String type) FIXME: actor iterator not implemented yet.
java.util.Iterator<Actor>	DerbyGraph.getActorIterator(java.lang.String type)
java.util.Iterator<Actor>	Graph.getActorIterator(java.lang.String type) Create a read only iterator over all actors.
java.util.Iterator<Actor>	MemGraph.getActorIterator(java.lang.String type)
java.util.Iterator<Actor>	NullGraph.getActorIterator(java.lang.String type)
java.util.Iterator<Actor>	UserIDList.getActorIterator(java.lang.String type)
java.util.Iterator<Actor>	UserList.getActorIterator(java.lang.String type)
java.util.Collection<Actor>	Tree.getRoots() Lists all the roots of this acyclic graph.

Methods in nz.ac.waikato.mcennis.rat.graph with parameters of type Actor

void	Clique.add(Actor u) Adds an actor to the clique if The parent is defined The parent contains the actor The actor is pointed to by all previous actors The actor points to every existing actor in the clique
void	DerbyGraph.add(Actor u)
void	Graph.add(Actor u) Add a user to the graph.
void	MemGraph.add(Actor u)
void	NullGraph.add(Actor u)
void	UserIDList.add(Actor u)
void	UserList.add(Actor u)
void	GraphIndex.addActor(Actor a, Graph g) Add a reference between a graph and an actor.
void	Tree.addRoot(Actor a) Add a root to the list of roots of this tree (forest)
protected boolean	Clique.checkLinks(Actor u) Determines if the actor to be added links to all elements of the clique
Clique	Clique.expand(Actor u) Identical to add(Actor u) except that this Clique is unchanged and a new Clique is returned.
Graph[]	GraphIndex.getGraph(Actor a) Return an array of all graphs that contain the actor or null if no indexed graph contains the actor.
Link[]	Clique.getLink(java.lang.String type, Actor sourceActor, Actor destActor) Null operation - links are implicit, not explicitly defined.
Link[]	DerbyGraph.getLink(java.lang.String type, Actor sourceActor, Actor destActor)
Link[]	Graph.getLink(java.lang.String type, Actor sourceActor, Actor destActor) Returns all links of the given type (relation) type going from actor sourceActor to actor destActor or null.
Link[]	MemGraph.getLink(java.lang.String type, Actor source, Actor dest)
Link[]	NullGraph.getLink(java.lang.String type, Actor sourceActor, Actor destActor)
Link[]	UserIDList.getLink(java.lang.String type, Actor sourceActor, Actor destActor)
Link[]	UserList.getLink(java.lang.String type, Actor sourceActor, Actor destActor)
protected java.util.LinkedList<Link>	MemGraph.getLinkByDestination(Actor a)
Link[]	Clique.getLinkByDestination(java.lang.String type, Actor destActor) Null operation - links are implicit, not explicitly defined.
Link[]	DerbyGraph.getLinkByDestination(java.lang.String type, Actor destActor)
Link[]	Graph.getLinkByDestination(java.lang.String type, Actor destActor) Returns all links (edges, arcs) of type (relation) type that point to the given actor.
Link[]	MemGraph.getLinkByDestination(java.lang.String type, Actor dest)
Link[]	NullGraph.getLinkByDestination(java.lang.String type, Actor destActor)
Link[]	UserIDList.getLinkByDestination(java.lang.String type, Actor destActor)
Link[]	UserList.getLinkByDestination(java.lang.String type, Actor destActor)
protected java.util.LinkedList<Link>	MemGraph.getLinkBySource(Actor a)
Link[]	Clique.getLinkBySource(java.lang.String type, Actor sourceActor) Null operation - links are implicit, not explicitly defined.
Link[]	DerbyGraph.getLinkBySource(java.lang.String type, Actor sourceActor)
Link[]	Graph.getLinkBySource(java.lang.String type, Actor sourceActor) Returns all links (edges, arcs) of type (relation) type that go from the given actor to any destination.
Link[]	MemGraph.getLinkBySource(java.lang.String type, Actor source)
Link[]	NullGraph.getLinkBySource(java.lang.String type, Actor sourceActor)
Link[]	UserIDList.getLinkBySource(java.lang.String type, Actor sourceActor)
Link[]	UserList.getLinkBySource(java.lang.String type, Actor sourceActor)
protected void	Clique.internalExpand(Actor u) Adds a new actor to the graph if the new graph will still be a clique
void	Clique.remove(Actor u) FIXME: remove actor currently does nothing
void	DerbyGraph.remove(Actor u)
void	Graph.remove(Actor u) Identifies the given user and removes it and all links involving it from the graph.
void	MemGraph.remove(Actor u)
void	NullGraph.remove(Actor u)
void	Tree.remove(Actor a)
void	UserIDList.remove(Actor u)
void	UserList.remove(Actor u)
protected void	Clique.start(Actor u) Initializes a clique - add an actor and initialize the intersection HashSet to all destinations this object links to (by keeping a set of all actors that are linked to by all actors in a clique, determining whether a new actor belongs is O(n) with the size of the clique for actors in the set and constant for those not.)

Method parameters in nz.ac.waikato.mcennis.rat.graph with type arguments of type Actor

Graph	Clique.getSubGraph(java.util.Properties props, java.util.Set<Actor> actor) Intentionally null since this graph can have no children.
Graph	DerbyGraph.getSubGraph(java.util.Properties props, java.util.Set<Actor> actor) FIXME: write subgraph code for Derby Graph
Graph	Graph.getSubGraph(java.util.Properties props, java.util.Set<Actor> actor) Creates a new graph from the current graph using the Properties props containing the actors actor and all links that link between actors in actor.
Graph	MemGraph.getSubGraph(java.util.Properties props, java.util.Set<Actor> actorList)
Graph	NullGraph.getSubGraph(java.util.Properties props, java.util.Set<Actor> actor)
Graph	UserIDList.getSubGraph(java.util.Properties props, java.util.Set<Actor> actor)
Graph	UserList.getSubGraph(java.util.Properties props, java.util.Set<Actor> actor)

Uses of Actor in nz.ac.waikato.mcennis.rat.graph.actor

Classes in nz.ac.waikato.mcennis.rat.graph.actor that implement Actor

class	BasicUser
class	DBActor Class that implemnts an actor backed by a DerbyDB database.

Methods in nz.ac.waikato.mcennis.rat.graph.actor that return Actor

Actor	ActorFactory.create(java.util.Properties props) Actors are created using the 'ActorClass' property to determine the class of the actor to use.
Actor	Actor.duplicate() Return a copy of this Actor that is equal by compareTo()
Actor	BasicUser.duplicate()
Actor	DBActor.duplicate()

Methods in nz.ac.waikato.mcennis.rat.graph.actor with parameters of type Actor

protected int	BasicUser.comparePages(Actor right) Compare pages of this actor with the given actor.
protected int	DBActor.comparePages(Actor right) Compare pages of this actor with the given actor.
protected int	BasicUser.compareProperties(Actor right) Compare properties of this actor with the given actor.
protected int	DBActor.compareProperties(Actor right) Compare properties of this actor with the given actor.

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

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

protected Actor[]

AddDegreeGraphProperties.getActor(Graph g)

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

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.aggregators that return types with arguments of type Actor

protected java.util.HashMap<Actor,java.lang.Double>	AggregateByLinkProperty.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)
protected java.util.HashMap<Actor,java.lang.Double>	AggregateLinks.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.aggregators with parameters of type Actor

protected java.util.HashMap<Actor,java.lang.Double>	AggregateByLinkProperty.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)
protected java.util.HashMap<Actor,java.lang.Double>	AggregateLinks.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)

Method parameters in nz.ac.waikato.mcennis.rat.graph.algorithm.aggregators with type arguments of type Actor

protected java.util.HashMap<Actor,java.lang.Double>	AggregateByLinkProperty.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)
protected java.util.HashMap<Actor,java.lang.Double>	AggregateLinks.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)

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

Fields in nz.ac.waikato.mcennis.rat.graph.algorithm.clustering declared as Actor

Actor

NaiveImplementClique.SubGroup.max

Fields in nz.ac.waikato.mcennis.rat.graph.algorithm.clustering with type parameters of type Actor

protected java.util.Map<Actor,java.lang.Number>	BicomponentClusterer.dfs_num
protected java.util.Map<Actor,java.lang.Number>	BicomponentClusterer.high
java.util.HashSet<Actor>	NaiveImplementClique.SubGroup.nodes
protected java.util.Map<Actor,Actor>	BicomponentClusterer.parents
protected java.util.Map<Actor,Actor>	BicomponentClusterer.parents

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

protected Actor

BicomponentClusterer.getOther(Link l, Actor a)

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.clustering with parameters of type Actor

NaiveImplementClique.SubGroup	NaiveImplementClique.SubGroup.expand(Actor a) Generate the next subgroup from this subgroup.
protected void	EnumerateMaximalCliques.extend(Clique seed, Actor[] intersection) create a set of new cliques of size n+1 from a clique of size n.
protected void	BicomponentClusterer.findBiconnectedComponents(Graph g, Actor v, java.util.Set<java.util.Set<Actor>> bicomponents) Stores, in bicomponents, all the biconnected components that are reachable from v.
protected void	FindWeaklyConnectedComponents.getComponent(Actor seed, Graph g)
protected Link[]	BicomponentClusterer.getLinks(Graph g, Actor v)
protected Actor	BicomponentClusterer.getOther(Link l, Actor a)
boolean	NaiveImplementClique.SubGroup.isPresent(Actor a) Does this subgroup contain the actor or not

Method parameters in nz.ac.waikato.mcennis.rat.graph.algorithm.clustering with type arguments of type Actor

protected void

BicomponentClusterer.findBiconnectedComponents(Graph g, Actor v, java.util.Set<java.util.Set<Actor>> bicomponents) Stores, in bicomponents, all the biconnected components that are reachable from v.

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

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

Actor[]

AssociativeMiningItems.getActors() Get the actors in this association backed by this array.

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering that return types with arguments of type Actor

protected java.util.HashSet<Actor>

AssociativeMining.getGiven(Graph g, Actor u)

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering with parameters of type Actor

void	AssociativeMiningItemSetGroup.addNegativeBase(Actor a, AssociativeMiningItems ami) Add to the given base set of associations this actor and associated item describing its (negative) relationship to the source actor.
void	AssociativeMiningItemSetGroup.addPositiveBase(Actor a, AssociativeMiningItems ami) Add to the given base set of associations this actor and associated item describing its (positive) relationship to the source actor.
protected void	Item2Item.createCorrelation(Graph g, Actor u, double strength, Actor a)
protected void	Item2Item.createRecommendation(Graph g, Actor u, double strength, Actor a)
protected void	User2User.doRecommendation(Graph g, Actor left, cern.colt.matrix.DoubleMatrix1D leftArray, Actor right, cern.colt.matrix.DoubleMatrix1D rightArray, double sim)
AssociativeMiningItems	AssociativeMiningItems.expand(Actor newActor) Create a new association that also includes the given new actor.
int	AssociativeMiningItemSetGroup.expandSet(Actor targetActor) Expand the current set of associations with all other actors in either the positive or negaqtive base set.
protected java.util.HashSet<Actor>	AssociativeMining.getGiven(Graph g, Actor u)
protected cern.colt.matrix.DoubleMatrix1D	User2User.getUserVector(Graph g, Actor u, int numArtists)
boolean	AssociativeMiningItems.isGreater(Actor a) Is this actor greater than all actors in this association
int	AssociativeMiningItems.significanceTest(Actor target) Given the set of all actors in this association and the target, is their a significant difference between the population of the destination actor in the set of all references over the relation in the candidate association compared to over the entire relation.

Method parameters in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering with type arguments of type Actor

boolean

AssociativeMiningItems.applies(java.util.HashSet<Actor> data) Are all the given actors present in this association?

Constructors in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering with parameters of type Actor

AssociativeMiningItems(Graph g, java.lang.String relation, Actor value)
Create a new association on this graph, with this relation, using this actor.

Constructor parameters in nz.ac.waikato.mcennis.rat.graph.algorithm.collaborativefiltering with type arguments of type Actor

AssociativeMiningItems(java.util.Collection<Actor> col, java.lang.String relation, double significance)
Create a new association containing all actors in the collection over the given relation declaring its significance level.

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

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.machinelearning with parameters of type Actor

protected void	MultiInstanceSVM.addInstances(Graph g, weka.core.Instances dataSet, Actor artist, int skipCount, int positiveSkipCount)
protected void	SVM.addInstances(Graph g, weka.core.Instances dataSet, Actor artist, int skipCount, int positiveSkipCount)
protected weka.core.Instances	MultiInstanceSVM.createDataSet(Actor[] artists)
protected weka.core.Instances	SVM.createDataSet(Actor[] artists)
protected void	MultiInstanceSVM.evaluateClassifier(weka.classifiers.Classifier classifier, weka.core.Instances dataSet, Graph g, Actor toBePredicted)
protected void	SVM.evaluateClassifier(weka.classifiers.Classifier classifier, weka.core.Instances dataSet, Graph g, Actor toBePredicted)
int	MultiInstanceSVM.totalYes(Graph g, Actor a)

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

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

protected Actor[]

AddDegreeCentrality.getActor(Graph g)

Uses of Actor in nz.ac.waikato.mcennis.rat.graph.algorithm.reusablecores

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.reusablecores with parameters of type Actor

int	ActorDistanceMatrixCore.getColumn(Actor a) Get which column the given actor is stored in.
protected void	FindStronglyConnectedComponentsCore.strongConnect(Actor start, Graph g)

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

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.similarity that return types with arguments of type Actor

protected java.util.HashMap<Actor,java.lang.Double>

SimilarityByLink.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.similarity with parameters of type Actor

protected java.util.HashMap<Actor,java.lang.Double>

SimilarityByLink.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)

Method parameters in nz.ac.waikato.mcennis.rat.graph.algorithm.similarity with type arguments of type Actor

protected java.util.HashMap<Actor,java.lang.Double>

SimilarityByLink.getMap(Actor tag, java.util.HashSet<Actor> total, Graph g)

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

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.transformToArray that return types with arguments of type Actor

protected java.util.TreeSet<Actor>	DirectedTriplesHistogram.getLinks(Graph g, Actor v, Actor comparator)
protected java.util.TreeSet<Actor>	UndirectedTriplesHistogram.getLinks(Graph g, Actor v, Actor comparator)

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.transformToArray with parameters of type Actor

protected java.util.TreeSet<Actor>	DirectedTriplesHistogram.getLinks(Graph g, Actor v, Actor comparator)
protected java.util.TreeSet<Actor>	UndirectedTriplesHistogram.getLinks(Graph g, Actor v, Actor comparator)
protected int	DirectedTriplesHistogram.getLinkType(Graph g, Actor left, Actor right)

Uses of Actor in nz.ac.waikato.mcennis.rat.graph.link

Methods in nz.ac.waikato.mcennis.rat.graph.link that return Actor

Actor	BasicUserLink.getDestination()
Actor	DBLink.getDestination()
Actor	Link.getDestination() Returns the actor where the link (edge, arc) terminates.
Actor	BasicUserLink.getSource()
Actor	DBLink.getSource()
Actor	Link.getSource() Returns the actor from which the link (edge, arc) begins.

Methods in nz.ac.waikato.mcennis.rat.graph.link with parameters of type Actor

protected int	DBLink.getActorID(Actor u) Get thye numerical ID that uniquely describes this Actor in the database
void	BasicUserLink.set(Actor l, double strength, Actor r)
void	DBLink.set(Actor l, double strength, Actor r)
void	Link.set(Actor l, double strength, Actor r) sets all aspects of the link at once
void	BasicUserLink.setDestination(Actor u)
void	DBLink.setDestination(Actor u)
void	Link.setDestination(Actor u) Sets the destination of this link.
void	BasicUserLink.setSource(Actor u)
void	DBLink.setSource(Actor u)
void	Link.setSource(Actor u) Sets the source of this link.

Constructors in nz.ac.waikato.mcennis.rat.graph.link with parameters of type Actor

BasicUserLink(Actor source, double strength, Actor destination)
Creates a new instance of BasicLink in a self-consistent state

Uses of Actor in nz.ac.waikato.mcennis.rat.graph.path

Methods in nz.ac.waikato.mcennis.rat.graph.path that return Actor

Actor	PathNode.getActor() Returns the Actor associated with this PathNode.
Actor	BasicPath.getEnd()
Actor	Path.getEnd() return the last actor in this path
Actor[]	BasicPath.getMiddle()
Actor[]	Path.getMiddle() return all actors that are neither the start or end actors.
Actor[]	BasicPath.getPath()
Actor[]	Path.getPath() Returns the order array of the actors in this object.
Actor	BasicPath.getStart()
Actor	Path.getStart() Return the first actor in the path

Methods in nz.ac.waikato.mcennis.rat.graph.path with parameters of type Actor

Path	BasicPath.addActor(Actor a, double cost)
Path	Path.addActor(Actor a, double cost) Create a new path that contains all the contents of this path plus an additional link to the given actor with the additional cost given.
boolean	BasicPath.contains(Actor node)
boolean	Path.contains(Actor node) returns if the path contains the given actor
void	PathNode.setActor(Actor a) Set the actor that this PathNode represents.
void	BasicPath.setPath(Actor[] participants, double cost, java.lang.String type)
void	Path.setPath(Actor[] participants, double cost, java.lang.String type) Create a path that goes through the following actors in order with a total cost and given id representing this PathSet id.

Uses of Actor in nz.ac.waikato.mcennis.rat.graphdisplay

Methods in nz.ac.waikato.mcennis.rat.graphdisplay with parameters of type Actor

protected void	MainWindow.buildJTree(Actor a)
protected java.lang.String	MainWindow.buildTextPane(Actor a)