Object

ml.sparkling.graph.operators.algorithms.link

BasicLinkPredictor

Related Doc: package link

Permalink

object BasicLinkPredictor extends MeasureBasedLnkPredictor

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io).

Linear Supertypes
MeasureBasedLnkPredictor, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BasicLinkPredictor
  2. MeasureBasedLnkPredictor
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. def predictLinks[V, E, EV, EO](graph: Graph[V, E], edgeMeasure: EdgeMeasure[EO, EV], threshold: EO, treatAsUndirected: Boolean = false)(implicit arg0: ClassTag[V], arg1: ClassTag[E], arg2: ClassTag[EV], arg3: ClassTag[EO], num: Numeric[EO]): RDD[(VertexId, VertexId)]

    Permalink

    Implementation should predict new links in given graph using suplied vertex similarity measure.

    Implementation should predict new links in given graph using suplied vertex similarity measure.

    graph

    - input graph

    edgeMeasure

    - similarity measure

    threshold

    - minimal similarity measure value

    treatAsUndirected

    - true if graph should be treated as undirected

    num

    - numeric of similarity measure

    Definition Classes
    BasicLinkPredictor → MeasureBasedLnkPredictor

  16. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  17. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  18. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  19. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  20. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MeasureBasedLnkPredictor

Inherited from AnyRef

Inherited from Any

Ungrouped