Class

de.hpi.kdd.rar.RaRSearch

RaRParamsFixed

Related Doc: package RaRSearch

Permalink

case class RaRParamsFixed(k: Int, numberOfMonteCarlosFixed: Int, parallelismFactor: Int = 1) extends RaRParams with Product with Serializable

Use a static set of parameters

Linear Supertypes
Serializable, Serializable, Product, Equals, RaRParams, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RaRParamsFixed
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. RaRParams
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RaRParamsFixed(k: Int, numberOfMonteCarlosFixed: Int, parallelismFactor: Int = 1)

    Permalink

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 finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  8. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  9. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  10. val k: Int

    Permalink

    Maximum size of the subset to select in each random trial.

    Maximum size of the subset to select in each random trial. This inherently defines the maximal size of the cluster that can be detected. Because the algorithm always only evaluates a subset of the features, it will never find correlated clusters of a size bigger than k. Nevertheless, setting k to high leads to a low specificity of the contrast measure.

    Definition Classes
    RaRParamsFixedRaRParams
  11. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  13. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. def numberOfMonteCarlos(numFeatures: Int): Int

    Permalink

    Defines how many random trials are used to fill the tables.

    Defines how many random trials are used to fill the tables. The more tries we allow the more accurate the results will be and the smaller correlations we will find. Can be static or dependent on the number of features.

    numFeatures

    number of features in the dataset

    Definition Classes
    RaRParamsFixedRaRParams
  15. val numberOfMonteCarlosFixed: Int

    Permalink
  16. val parallelismFactor: Int

    Permalink

    Defines how many operations are allowed to be performed in parallel

    Defines how many operations are allowed to be performed in parallel

    Definition Classes
    RaRParamsFixedRaRParams
  17. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  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 Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from RaRParams

Inherited from AnyRef

Inherited from Any

Ungrouped