RoughSet

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def dependency(indecability: GenIterable[Array[Long]], indDecisionClasses: Iterable[Array[Long]]): Int

Compute dependency

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def fit[O, T, V[A] <: GSimpleVector[A, V[A]], Sz[B, C <: GVector[C]] <: Supervizable[B, C, Sz]](data: GenSeq[Sz[O, V[T]]])(implicit di: DummyImplicit): GenSeq[Array[Int]]

Rought Set feature selection classical algorithm

final def fit(data: GenSeq[(Array[Int], Int)]): GenSeq[Array[Int]]

Rought Set feature selection classical algorithm

final def generateIndecidabilityDecisionClasses[O, T, S[X] <: Seq[X], V[A] <: GSimpleVector[A, V[A]], Sz[B, C <: GVector[C]] <: Supervizable[B, C, Sz]](data: GenSeq[Sz[O, V[T]]]): Iterable[Array[Long]]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def keyValueExtract[T](f: Array[Int], vector: Array[T]): IndexedSeq[T]

Define KeyValueExtract function

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def obtainEveryFeaturesCombinations(n: Int): ParArray[Array[Int]]

Generate every combinations of features

final def obtainIndecability[O, T, V[A] <: GSimpleVector[A, V[A]], Sz[B, C <: GVector[C]] <: Supervizable[B, C, Sz]](f: Array[Int], data: GenSeq[Sz[O, V[T]]]): GenIterable[Array[Long]]

Define a function to calculate the Indecability of each element in the list indDecisionClasses

final def roughSet[O, T, V[A] <: GSimpleVector[A, V[A]], Sz[B, C <: GVector[C]] <: Supervizable[B, C, Sz]](data: GenSeq[Sz[O, V[T]]]): GenSeq[Array[Int]]

Rought Set feature selection classical algorithm

final def roughSetPerBucketOfFeatures[O, T, V[A] <: GSimpleVector[A, V[A]], Sz[B, C <: GVector[C]] <: Supervizable[B, C, Sz]](data: GenSeq[Sz[O, V[T]]], columnsOfFeats: Seq[Seq[Int]], columnToCompute: Option[GenSeq[Int]] = None): GenSeq[Int]

Pure scala functions to apply on each node locally

final def runHeuristic[O, T, V[A] <: GSimpleVector[A, V[A]], Sz[B, C <: GVector[C]] <: Supervizable[B, C, Sz]](data: GenSeq[Sz[O, V[T]]], columnsOfFeats: Seq[Seq[Int]], columnToCompute: Option[GenSeq[Int]] = None): GenSeq[Int]

final def selectAmongReductSets1(reductSets: ParArray[Array[Int]], k: Int): Array[Int]

final def selectAmongReductSets2(reductSets: ParArray[Array[Int]], p: Double): ParSeq[Int]

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit