Uses of Class
oracle.pgx.api.BipartiteGraph

Packages that use BipartiteGraph

Package	Description
oracle.pgx.api	This package contains the main Java APIs.

Uses of BipartiteGraph in oracle.pgx.api

Methods in oracle.pgx.api that return BipartiteGraph

Modifier and Type	Method and Description
BipartiteGraph	PgxGraph.bipartiteSubGraphFromInDegree() Blocking version of PgxGraph.bipartiteSubGraphFromInDegreeAsync().
BipartiteGraph	PgxGraph.bipartiteSubGraphFromInDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromInDegreeAsync(Collection, Collection, String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromInDegree(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace) Blocking version of PgxGraph.bipartiteSubGraphFromInDegreeAsync(Collection, Collection, String, String, boolean).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromInDegree(java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromInDegreeAsync(String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection, Collection, VertexSet, String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(Collection, Collection, VertexSet, String, String).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet).
BipartiteGraph	PgxGraph.bipartiteSubGraphFromLeftSet(VertexSet<?> vertexSet, java.lang.String newGraphName) Blocking version of PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet, String).

Methods in oracle.pgx.api that return types with arguments of type BipartiteGraph

Modifier and Type	Method and Description
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromInDegreeAsync() Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName) Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace) Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.lang.String newGraphName) Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet) Create a bipartite version of this graph with the given vertex set being the left set.
PgxFuture<BipartiteGraph>	PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, java.lang.String newGraphName) Create a bipartite version of this graph with the given vertex set being the left set.

Methods in oracle.pgx.api with parameters of type BipartiteGraph

Modifier and Type	Method and Description
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty) Blocking version of Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty).
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) Blocking version of Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty, double, double, double, int, int).
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features) Blocking version of #matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty, double, double, double, int, int, VertexProperty<ID, PgxVect<Double>>).
<ID> MatrixFactorizationModel<ID>	Analyst.matrixFactorizationGradientDescent(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, VertexProperty<ID,PgxVect<java.lang.Double>> features) Blocking version of #matrixFactorizationGradientDescentAsync(BipartiteGraph, EdgeProperty, VertexProperty<ID, PgxVect<Double>>).
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features) Performs the training step of generating recommendations using matrix factorization.
<ID> PgxFuture<MatrixFactorizationModel<ID>>	Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weightProperty, VertexProperty<ID,PgxVect<java.lang.Double>> features) Performs the training step of generating recommendations using matrix factorization.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff) Convenience wrapper around Analyst.personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal) taking a vertex ID instead of PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, ID v, java.math.BigDecimal d, int maxIterations, java.math.BigDecimal maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Convenience wrapper around #personalizedSalsa(BipartiteGraph, PgxVertex, BigDecimal, int, BigDecimal, VertexProperty<ID, Double>) taking a vertex ID instead of PgxVertex.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v) Blocking version of Analyst.personalizedSalsaAsync(BipartiteGraph, PgxVertex).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff) Blocking version of Analyst.personalizedSalsaAsync(BipartiteGraph, PgxVertex, double, int, double).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Blocking version of #personalizedSalsaAsync(BipartiteGraph, PgxVertex, double, int, double, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank) Blocking version of #personalizedSalsaAsync(BipartiteGraph, PgxVertex, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices) Blocking version of Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff) Blocking version of Analyst.personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Blocking version of #personalizedSalsaAsync(BipartiteGraph, VertexSet, double, int, double, VertexProperty<ID, Double>).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.personalizedSalsa(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank) Blocking version of #personalizedSalsaAsync(BipartiteGraph, VertexSet, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank) Personalized SALSA computes recommendations ith respect to a given vertex v.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices) Personalized SALSA computes recommendations ith respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff) Personalized SALSA computes recommendations ith respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIterations, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) Personalized SALSA computes recommendations ith respect to a given set of vertices.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank) Personalized SALSA computes recommendations ith respect to a given set of vertices.
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph) Blocking version of Analyst.salsaAsync(BipartiteGraph).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter) Blocking version of Analyst.salsaAsync(BipartiteGraph, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank) Blocking version of #salsaAsync(BipartiteGraph, double, int, VertexProperty<ID, Double>).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.salsa(BipartiteGraph graph, int k) Blocking version of Analyst.salsaAsync(BipartiteGraph, int).
<ID> Pair<VertexSequence<ID>,VertexSequence<ID>>	Analyst.salsa(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter) Blocking version of Analyst.salsaAsync(BipartiteGraph, int, double, double, int).
<ID> VertexProperty<ID,java.lang.Double>	Analyst.salsa(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank) Blocking version of #salsaAsync(BipartiteGraph, VertexProperty<ID, Double>).
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter)
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank)
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.salsaAsync(BipartiteGraph graph, int k) Convenience method around Analyst.salsaAsync(BipartiteGraph, int, double, double, int) using maxDiff = 0.01 d = 0.85 maxIter = 1000
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>	Analyst.salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter) SALSA recommendation algorithm.
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>>	Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank)