Packages

object GCN extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GCN
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def gcn[S](in: Int, out: Int, tOpt: STenOptions, dropout: Double = 0d, nonLinearity: Boolean = true)(implicit arg0: Sc[S]): GCN[ResidualModule[EitherModule[Variable, Variable, Seq4[Variable, Variable, Variable, Variable, Variable, Linear with GenericModule[Variable, Variable], BatchNorm with GenericModule[Variable, Variable], Fun with GenericModule[Variable, Variable], Dropout with GenericModule[Variable, Variable]], Seq2[Variable, Variable, Variable, Linear with GenericModule[Variable, Variable], BatchNorm with GenericModule[Variable, Variable]]]]]
  10. def gcnAggregation[S](nodeFeatures: Variable, degrees: Variable, a: Variable)(implicit arg0: Sc[S]): Variable
  11. def gcnAggregation[S](nodeFeatures: Variable, edgeList: Variable)(implicit arg0: Sc[S]): Variable

    Performs D-0.5 (A+A'+I) D-0.5 W where are node features (N x D) A is the asymmetric adjacency matrix without self loops, elements in {0,1} I is identity D is degree(A+I)

    Performs D-0.5 (A+A'+I) D-0.5 W where are node features (N x D) A is the asymmetric adjacency matrix without self loops, elements in {0,1} I is identity D is degree(A+I)

    nodeFeatures

    N x D node features

    edgeList

    N x 2 long tensor the edges in A (asymmetric, no diagonal)

    returns

    N x D aggregated features

  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. implicit def load[M <: Module](implicit arg0: Load[M]): Load[GCN[M]]
  16. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. def precomputeSparseAdjacency[S](valueOpt: STenOptions, edgeList: Variable, numNodes: Long)(implicit arg0: Sc[S]): (Constant, Constant)
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. implicit def trainingMode[M <: Module](implicit arg0: TrainingMode[M]): TrainingMode[GCN[M]]
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped