Object

com.enriquegrodrigo.spark.crowd.methods

PM

Related Doc: package methods

Permalink

object PM

Provides functions for transforming an annotation dataset into a standard label dataset using the PM algorithm.

This algorithm only works with continuous target variables. Thus you need an annotation dataset of types.RealAnnotation:

The algorithm returns a PM.PMModel, with information about the class true label estimation and the annotators weight

Example: 

  1. import com.enriquegrodrigo.spark.crowd.methods.PM
import com.enriquegrodrigo.spark.crowd.types._
sc.setCheckpointDir("checkpoint")
val annFile = "data/real-ann.parquet"
val annData = spark.read.parquet(annFile)
//Applying the learning algorithm
val mode = PM(annData)
//Get MulticlassLabel with the class predictions
val pred = mode.getMu()
//Annotator weights
val annweights = mode.getAnnotatorWeights()
Version

0.2.0

See also

Q. Li, Y. Li, J. Gao, B. Zhao, W. Fan, and J. Han. Resolving conflicts in heterogeneous data by truth discovery and source reliability estimation. In SIGMOD, pages 1187–1198, 2014.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PM
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class PMModel extends AnyRef

    Permalink

    Model returned by the learning algorithm.

    Model returned by the learning algorithm.

    Version

    0.2.0

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. def apply(dataset: Dataset[RealAnnotation], iterations: Int = 5, threshold: Double = 0.1): PMModel

    Permalink

    Apply the IBCC Algorithm.

    Apply the IBCC Algorithm.

    dataset

    The dataset (spark dataset of types.RealAnnotation)

    iterations

    Iterations of the learning algorithm

    threshold

    Minimum MSE for the algorithm to continue iterating

    Version

    0.2.0

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  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 AnyRef

Inherited from Any

Ungrouped