org.deeplearning4j.models.sequencevectors.graph.walkers.impl

Class PopularityWalker<T extends SequenceElement>

java.lang.Object

org.deeplearning4j.models.sequencevectors.graph.walkers.impl.RandomWalker<T>

org.deeplearning4j.models.sequencevectors.graph.walkers.impl.PopularityWalker<T>

All Implemented Interfaces:

GraphWalker<T>

public class PopularityWalker<T extends SequenceElement>
extends RandomWalker<T>
implements GraphWalker<T>

This is vertex popularity-based walker for SequenceVectors-based DeepWalk implementation. Instead of rand walks, this walker produces walks based on number of edges coming into each node. This allows you to build walks filtering too rare nodes, or too popular nodes, depending on your demands. Original DeepWalk paper: http://arxiv.org/pdf/1403.6652v2

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	PopularityWalker.Builder<T extends SequenceElement>

Field Summary

Fields

Modifier and Type	Field and Description
protected PopularityMode	popularityMode
protected SpreadSpectrum	spectrum
protected int	spread

Fields inherited from class org.deeplearning4j.models.sequencevectors.graph.walkers.impl.RandomWalker

alpha, noEdgeHandling, order, position, rng, seed, sourceGraph, walkDirection, walkLength

Constructor Summary

Constructors

Constructor and Description
PopularityWalker()

Method Summary

Modifier and Type	Method and Description
boolean	hasNext() This method checks, if walker has any more sequences left in queue
boolean	isLabelEnabled()
Sequence<T>	next() This method returns next walk sequence from this graph
void	reset(boolean shuffle) This method resets walker

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface org.deeplearning4j.models.sequencevectors.graph.walkers.GraphWalker

getSourceGraph

Field Detail

popularityMode

protected PopularityMode popularityMode

spread

protected int spread

spectrum

protected SpreadSpectrum spectrum

Constructor Detail

PopularityWalker

public PopularityWalker()

Method Detail

hasNext

public boolean hasNext()

This method checks, if walker has any more sequences left in queue

Specified by:

hasNext in interface GraphWalker<T extends SequenceElement>

Overrides:

hasNext in class RandomWalker<T extends SequenceElement>

Returns:

isLabelEnabled

public boolean isLabelEnabled()

Specified by:

isLabelEnabled in interface GraphWalker<T extends SequenceElement>

Overrides:

isLabelEnabled in class RandomWalker<T extends SequenceElement>

next

public Sequence<T> next()

This method returns next walk sequence from this graph

Specified by:

next in interface GraphWalker<T extends SequenceElement>

Overrides:

next in class RandomWalker<T extends SequenceElement>

Returns:

reset

public void reset(boolean shuffle)

Description copied from class: RandomWalker

This method resets walker

Specified by:

reset in interface GraphWalker<T extends SequenceElement>

Overrides:

reset in class RandomWalker<T extends SequenceElement>

Parameters:

shuffle - if TRUE, order of walks will be shuffled