breeze.classify

LiblinearClassifier

class LiblinearClassifier extends AnyRef

A simple wrapper to Liblinear.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LiblinearClassifier
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LiblinearClassifier(model: Model)

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def apply(nodes: Seq[FeatureNode]): Int

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

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

    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  18. lazy val numClasses: Int

  19. def predict(nodes: Seq[FeatureNode]): Int

  20. def predictDense(inputValues: Seq[Double]): Int

  21. def predictValues(nodes: Seq[FeatureNode]): Seq[Double]

  22. def predictValuesBinary(nodes: Seq[FeatureNode]): Double

    This is an alternative to predictValues that assumes binary classification and assumes that the model won't be asked to use an out-of-bounds feature, both of which cut down on overhead.

    This is an alternative to predictValues that assumes binary classification and assumes that the model won't be asked to use an out-of-bounds feature, both of which cut down on overhead. It will give out-of-bounds exceptions if not used appropriately, and will not work at all for polytomous models.

  23. def predictValuesBinarySlow(nodes: Seq[FeatureNode]): Double

    This is how we'd prefer to write predictValuesBinary, but unfortunately, the while loop is faster than the fold (by about a factor of two, it seems).

    This is how we'd prefer to write predictValuesBinary, but unfortunately, the while loop is faster than the fold (by about a factor of two, it seems). :(

  24. def predictValuesDense(inputValues: Seq[Double]): Seq[Double]

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

    Definition Classes
    AnyRef
  26. def toString(): String

    Definition Classes
    AnyRef → Any
  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  29. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  30. lazy val weights: Array[Double]

Inherited from AnyRef

Inherited from Any

Ungrouped