object GCN extends Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- GCN
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- 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]]]]]
- def gcnAggregation[S](nodeFeatures: Variable, degrees: Variable, a: Variable)(implicit arg0: Sc[S]): Variable
-
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
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- implicit def load[M <: Module](implicit arg0: Load[M]): Load[GCN[M]]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def precomputeSparseAdjacency[S](valueOpt: STenOptions, edgeList: Variable, numNodes: Long)(implicit arg0: Sc[S]): (Constant, Constant)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- implicit def trainingMode[M <: Module](implicit arg0: TrainingMode[M]): TrainingMode[GCN[M]]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()