Type Members
-
class
Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
-
-
class
WithFilter extends FilterMonadic[A, Repr]
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++[B >: LabeledClassification[L], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
-
def
++:[B >: LabeledClassification[L], That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
++:[B >: LabeledClassification[L], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
++=(labels: Iterable[L]): Trial.this.type
-
-
-
def
+:[B >: LabeledClassification[L], That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
def
+=(label: L): Unit
-
-
-
-
-
def
:+[B >: LabeledClassification[L], That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
accuracy: Double
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, LabeledClassification[L]) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[C](k: (LabeledClassification[L]) ⇒ C): PartialFunction[Int, C]
-
-
def
applyOrElse[A1 <: Int, B1 >: LabeledClassification[L]](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[LabeledClassification[L], B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
collectFirst[B](pf: PartialFunction[LabeledClassification[L], B]): Option[B]
-
def
combinations(n: Int): Iterator[IndexedSeq[LabeledClassification[L]]]
-
def
companion: GenericCompanion[IndexedSeq]
-
-
def
contains(elem: Any): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: LabeledClassification[L]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: LabeledClassification[L]](xs: Array[B]): Unit
-
def
copyToArray[B >: LabeledClassification[L]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: LabeledClassification[L]](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenSeq[B])(p: (LabeledClassification[L], B) ⇒ Boolean): Boolean
-
-
def
count: Int
-
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
evalString: String
-
def
evalString(labelIndex: Int): String
-
-
def
f1: Double
-
def
f1(labelValue: DiscreteValue): Double
-
def
f1(labelIndex: Int): Double
-
-
-
def
finalize(): Unit
-
-
def
flatMap[B, That](f: (LabeledClassification[L]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
flatten[B](implicit asTraversable: (LabeledClassification[L]) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
-
def
fn: Int
-
-
def
fn(labelIndex: Int): Int
-
def
fold[A1 >: LabeledClassification[L]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
-
def
foldRight[B](z: B)(op: (LabeledClassification[L], B) ⇒ B): B
-
-
-
def
fp: Int
-
-
def
fp(labelIndex: Int): Int
-
def
genericBuilder[B]: Builder[B, IndexedSeq[B]]
-
final
def
getClass(): Class[_]
-
-
def
grouped(size: Int): Iterator[IndexedSeq[LabeledClassification[L]]]
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
def
indexOf[B >: LabeledClassification[L]](elem: B, from: Int): Int
-
-
def
indexOfSlice[B >: LabeledClassification[L]](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: LabeledClassification[L]](that: GenSeq[B]): Int
-
def
indexWhere(p: (LabeledClassification[L]) ⇒ Boolean, from: Int): Int
-
-
def
indices: Range
-
-
-
-
def
isDefinedAt(idx: Int): Boolean
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
-
def
lastIndexOf[B >: LabeledClassification[L]](elem: B, end: Int): Int
-
-
def
lastIndexOfSlice[B >: LabeledClassification[L]](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: LabeledClassification[L]](that: GenSeq[B]): Int
-
def
lastIndexWhere(p: (LabeledClassification[L]) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere(p: (LabeledClassification[L]) ⇒ Boolean): Int
-
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
def
map[B, That](f: (LabeledClassification[L]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
-
-
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[A1 <: Int, B1 >: LabeledClassification[L]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
overallEvalString: String
-
def
padTo[B >: LabeledClassification[L], That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
-
-
def
patch[B >: LabeledClassification[L], That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
permutations: Iterator[IndexedSeq[LabeledClassification[L]]]
-
def
precision: Double
-
def
precision(labelValue: DiscreteValue): Double
-
def
precision(labelIndex: Int): Double
-
-
-
def
recall: Double
-
def
recall(labelValue: DiscreteValue): Double
-
def
recall(labelIndex: Int): Double
-
def
reduce[A1 >: LabeledClassification[L]](op: (A1, A1) ⇒ A1): A1
-
-
-
def
reduceOption[A1 >: LabeledClassification[L]](op: (A1, A1) ⇒ A1): Option[A1]
-
-
-
-
-
-
def
reverseMap[B, That](f: (LabeledClassification[L]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
def
runWith[U](action: (LabeledClassification[L]) ⇒ U): (Int) ⇒ Boolean
-
def
sameElements[B >: LabeledClassification[L]](that: GenIterable[B]): Boolean
-
def
scan[B >: LabeledClassification[L], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, LabeledClassification[L]) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
scanRight[B, That](z: B)(op: (LabeledClassification[L], B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
segmentLength(p: (LabeledClassification[L]) ⇒ Boolean, from: Int): Int
-
-
def
size: Int
-
def
slice(from: Int, until: Int): IndexedSeq[LabeledClassification[L]]
-
def
sliding(size: Int, step: Int): Iterator[IndexedSeq[LabeledClassification[L]]]
-
def
sliding(size: Int): Iterator[IndexedSeq[LabeledClassification[L]]]
-
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
def
tn: Int
-
-
def
tn(labelIndex: Int): Int
-
-
def
toArray[B >: LabeledClassification[L]](implicit arg0: ClassTag[B]): Array[B]
-
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[LabeledClassification[L], (T, U)]): Map[T, U]
-
-
-
-
def
toString(): String
-
-
-
def
tp: Int
-
-
def
tp(labelIndex: Int): Int
-
def
transpose[B](implicit asTraversable: (LabeledClassification[L]) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
-
def
union[B >: LabeledClassification[L], That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
def
unzip[A1, A2](implicit asPair: (LabeledClassification[L]) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (LabeledClassification[L]) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
-
def
updated[B >: LabeledClassification[L], That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], B, That]): That
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: LabeledClassification[L], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], (A1, B), That]): That
-
def
zipAll[B, A1 >: LabeledClassification[L], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], (A1, B), That]): That
-
def
zipWithIndex[A1 >: LabeledClassification[L], That](implicit bf: CanBuildFrom[IndexedSeq[LabeledClassification[L]], (A1, Int), That]): That
Inherited from Equals
Inherited from Any
A collection of Classification results, along with methods for calculating several evaluation measures. You can subclass Trial to add new evaluation measures.