Dataset

abstract def +=(datum: Datum[L, F]): Unit

abstract def featuresCounter(datumOffset: Int): Counter[Int]

abstract def keepOnly(featuresToKeep: Set[Int]): Dataset[L, F]

Creates a new dataset keeping only the features in the given set

abstract def mkDatum(row: Int): Datum[L, F]

Returns the Datum for given row

abstract def removeFeaturesByFrequency(threshold: Int): Dataset[L, F]

Removes features that appear less than threshold times in this dataset.

abstract def removeFeaturesByInformationGain(pctToKeep: Double): Dataset[L, F]

Removes features by information gain.

abstract def toCounterDataset: CounterDataset[L, F]

Convert this dataset to a CounterDataset

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: Datum[L, F], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def ++:[B >: Datum[L, F], That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def ++:[B >: Datum[L, F], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def +:[B >: Datum[L, F], That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def /:[B](z: B)(op: (B, Datum[L, F]) ⇒ B): B

def :+[B >: Datum[L, F], That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def :\[B](z: B)(op: (Datum[L, F], B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, Datum[L, F]) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (Datum[L, F]) ⇒ C): PartialFunction[Int, C]

def apply(idx: Int): Datum[L, F]

def applyOrElse[A1 <: Int, B1 >: Datum[L, F]](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Datum[L, F], B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def collectFirst[B](pf: PartialFunction[Datum[L, F], B]): Option[B]

def combinations(n: Int): Iterator[IndexedSeq[Datum[L, F]]]

def companion: GenericCompanion[IndexedSeq]

def compose[A](g: (A) ⇒ Int): (A) ⇒ Datum[L, F]

def contains[A1 >: Datum[L, F]](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

def copyToArray[B >: Datum[L, F]](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Datum[L, F]](xs: Array[B]): Unit

def copyToArray[B >: Datum[L, F]](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Datum[L, F]](dest: Buffer[B]): Unit

def corresponds[B](that: GenSeq[B])(p: (Datum[L, F], B) ⇒ Boolean): Boolean

def count(p: (Datum[L, F]) ⇒ Boolean): Int

def diff[B >: Datum[L, F]](that: GenSeq[B]): IndexedSeq[Datum[L, F]]

def distinct: IndexedSeq[Datum[L, F]]

def drop(n: Int): IndexedSeq[Datum[L, F]]

def dropRight(n: Int): IndexedSeq[Datum[L, F]]

def dropWhile(p: (Datum[L, F]) ⇒ Boolean): IndexedSeq[Datum[L, F]]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (Datum[L, F]) ⇒ Boolean): Boolean

val featureLexicon: Lexicon[F]

def filter(p: (Datum[L, F]) ⇒ Boolean): IndexedSeq[Datum[L, F]]

def filterNot(p: (Datum[L, F]) ⇒ Boolean): IndexedSeq[Datum[L, F]]

def finalize(): Unit

def find(p: (Datum[L, F]) ⇒ Boolean): Option[Datum[L, F]]

def flatMap[B, That](f: (Datum[L, F]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def flatten[B](implicit asTraversable: (Datum[L, F]) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

def fold[A1 >: Datum[L, F]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Datum[L, F]) ⇒ B): B

def foldRight[B](z: B)(op: (Datum[L, F], B) ⇒ B): B

def forall(p: (Datum[L, F]) ⇒ Boolean): Boolean

def foreach[U](f: (Datum[L, F]) ⇒ U): Unit

def genericBuilder[B]: Builder[B, IndexedSeq[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Datum[L, F]) ⇒ K): Map[K, IndexedSeq[Datum[L, F]]]

def grouped(size: Int): Iterator[IndexedSeq[Datum[L, F]]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Datum[L, F]

def headOption: Option[Datum[L, F]]

def indexOf[B >: Datum[L, F]](elem: B, from: Int): Int

def indexOf[B >: Datum[L, F]](elem: B): Int

def indexOfSlice[B >: Datum[L, F]](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: Datum[L, F]](that: GenSeq[B]): Int

def indexWhere(p: (Datum[L, F]) ⇒ Boolean, from: Int): Int

def indexWhere(p: (Datum[L, F]) ⇒ Boolean): Int

def indices: Range

def init: IndexedSeq[Datum[L, F]]

def inits: Iterator[IndexedSeq[Datum[L, F]]]

def intersect[B >: Datum[L, F]](that: GenSeq[B]): IndexedSeq[Datum[L, F]]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Datum[L, F]]

val labelLexicon: Lexicon[L]

val labels: ArrayBuffer[Int]

def last: Datum[L, F]

def lastIndexOf[B >: Datum[L, F]](elem: B, end: Int): Int

def lastIndexOf[B >: Datum[L, F]](elem: B): Int

def lastIndexOfSlice[B >: Datum[L, F]](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: Datum[L, F]](that: GenSeq[B]): Int

def lastIndexWhere(p: (Datum[L, F]) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (Datum[L, F]) ⇒ Boolean): Int

def lastOption: Option[Datum[L, F]]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Datum[L, F]]

def map[B, That](f: (Datum[L, F]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def max[B >: Datum[L, F]](implicit cmp: Ordering[B]): Datum[L, F]

def maxBy[B](f: (Datum[L, F]) ⇒ B)(implicit cmp: Ordering[B]): Datum[L, F]

def min[B >: Datum[L, F]](implicit cmp: Ordering[B]): Datum[L, F]

def minBy[B](f: (Datum[L, F]) ⇒ B)(implicit cmp: Ordering[B]): Datum[L, F]

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Datum[L, F], IndexedSeq[Datum[L, F]]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numFeatures: Int

def numLabels: Int

def orElse[A1 <: Int, B1 >: Datum[L, F]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def padTo[B >: Datum[L, F], That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def par: ParSeq[Datum[L, F]]

def parCombiner: Combiner[Datum[L, F], ParSeq[Datum[L, F]]]

def partition(p: (Datum[L, F]) ⇒ Boolean): (IndexedSeq[Datum[L, F]], IndexedSeq[Datum[L, F]])

def patch[B >: Datum[L, F], That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def permutations: Iterator[IndexedSeq[Datum[L, F]]]

def prefixLength(p: (Datum[L, F]) ⇒ Boolean): Int

def product[B >: Datum[L, F]](implicit num: Numeric[B]): B

def reduce[A1 >: Datum[L, F]](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Datum[L, F]](op: (B, Datum[L, F]) ⇒ B): B

def reduceLeftOption[B >: Datum[L, F]](op: (B, Datum[L, F]) ⇒ B): Option[B]

def reduceOption[A1 >: Datum[L, F]](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Datum[L, F]](op: (Datum[L, F], B) ⇒ B): B

def reduceRightOption[B >: Datum[L, F]](op: (Datum[L, F], B) ⇒ B): Option[B]

def repr: IndexedSeq[Datum[L, F]]

def reverse: IndexedSeq[Datum[L, F]]

def reverseIterator: Iterator[Datum[L, F]]

def reverseMap[B, That](f: (Datum[L, F]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def reversed: List[Datum[L, F]]

def runWith[U](action: (Datum[L, F]) ⇒ U): (Int) ⇒ Boolean

def sameElements[B >: Datum[L, F]](that: GenIterable[B]): Boolean

def scan[B >: Datum[L, F], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Datum[L, F]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def scanRight[B, That](z: B)(op: (Datum[L, F], B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def segmentLength(p: (Datum[L, F]) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[Datum[L, F]]

def size: Int

def slice(from: Int, until: Int): IndexedSeq[Datum[L, F]]

def sliding(size: Int, step: Int): Iterator[IndexedSeq[Datum[L, F]]]

def sliding(size: Int): Iterator[IndexedSeq[Datum[L, F]]]

def sortBy[B](f: (Datum[L, F]) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[Datum[L, F]]

def sortWith(lt: (Datum[L, F], Datum[L, F]) ⇒ Boolean): IndexedSeq[Datum[L, F]]

def sorted[B >: Datum[L, F]](implicit ord: Ordering[B]): IndexedSeq[Datum[L, F]]

def span(p: (Datum[L, F]) ⇒ Boolean): (IndexedSeq[Datum[L, F]], IndexedSeq[Datum[L, F]])

def splitAt(n: Int): (IndexedSeq[Datum[L, F]], IndexedSeq[Datum[L, F]])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

def sum[B >: Datum[L, F]](implicit num: Numeric[B]): B

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

def tail: IndexedSeq[Datum[L, F]]

def tails: Iterator[IndexedSeq[Datum[L, F]]]

def take(n: Int): IndexedSeq[Datum[L, F]]

def takeRight(n: Int): IndexedSeq[Datum[L, F]]

def takeWhile(p: (Datum[L, F]) ⇒ Boolean): IndexedSeq[Datum[L, F]]

def thisCollection: IndexedSeq[Datum[L, F]]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Datum[L, F], Col[Datum[L, F]]]): Col[Datum[L, F]]

def toArray[B >: Datum[L, F]](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[A1 >: Datum[L, F]]: Buffer[A1]

def toCollection(repr: IndexedSeq[Datum[L, F]]): IndexedSeq[Datum[L, F]]

def toIndexedSeq: IndexedSeq[Datum[L, F]]

def toIterable: Iterable[Datum[L, F]]

def toIterator: Iterator[Datum[L, F]]

def toList: List[Datum[L, F]]

def toMap[T, U](implicit ev: <:<[Datum[L, F], (T, U)]): Map[T, U]

def toSeq: Seq[Datum[L, F]]

def toSet[B >: Datum[L, F]]: Set[B]

def toStream: Stream[Datum[L, F]]

def toString(): String

def toTraversable: Traversable[Datum[L, F]]

def toVector: Vector[Datum[L, F]]

def transpose[B](implicit asTraversable: (Datum[L, F]) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def union[B >: Datum[L, F], That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def unzip[A1, A2](implicit asPair: (Datum[L, F]) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Datum[L, F]) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated[B >: Datum[L, F], That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], B, That]): That

def view(from: Int, until: Int): SeqView[Datum[L, F], IndexedSeq[Datum[L, F]]]

def view: SeqView[Datum[L, F], IndexedSeq[Datum[L, F]]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Datum[L, F]) ⇒ Boolean): FilterMonadic[Datum[L, F], IndexedSeq[Datum[L, F]]]

def zip[A1 >: Datum[L, F], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], (A1, B), That]): That

def zipAll[B, A1 >: Datum[L, F], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], (A1, B), That]): That

def zipWithIndex[A1 >: Datum[L, F], That](implicit bf: CanBuildFrom[IndexedSeq[Datum[L, F]], (A1, Int), That]): That