| Modifier and Type | Interface and Description |
|---|---|
interface |
ClassifierFactory<A extends Classifier>
Factory interface for building new classifiers, majorly used in
crossvalidation to generate new classifiers when needed.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractClassifier
Abstract base class for classifiers.
|
class |
UntrainableClassifier |
| Modifier and Type | Method and Description |
|---|---|
default Classifier |
Predictor.asClassifier()
Backward compatibility method to make online-ml project's predictors work
with almost everything in this library.
|
| Modifier and Type | Class and Description |
|---|---|
class |
MultinomialNaiveBayes
Multinomial naive bayes classifier.
|
| Modifier and Type | Class and Description |
|---|---|
class |
EvaluationListener<A extends Classifier>
The evaluation listener is majorly used to track the overfitting of a
classifier while training.
|
class |
TestSetIterationCallback<T extends Classifier>
This callback is used to evaluate the performance on a held-out test set.
|
interface |
WeightMapper<A extends Classifier>
This interface helps to map minimizable weights of a
CostFunction to
a Classifier implementation. |
| Modifier and Type | Method and Description |
|---|---|
static <A extends Classifier> |
Evaluator.crossValidateClassifier(ClassifierFactory<A> classifierFactory,
de.jungblut.math.DoubleVector[] features,
de.jungblut.math.DoubleVector[] outcome,
int numLabels,
int folds,
Double threshold,
boolean verbose)
Does a k-fold crossvalidation on the given classifiers with features and
outcomes.
|
static <A extends Classifier> |
Evaluator.crossValidateClassifier(ClassifierFactory<A> classifierFactory,
de.jungblut.math.DoubleVector[] features,
de.jungblut.math.DoubleVector[] outcome,
int numLabels,
int folds,
Double threshold,
int numThreads,
boolean verbose)
Does a k-fold crossvalidation on the given classifiers with features and
outcomes.
|
static <A extends Classifier> |
Evaluator.tenFoldCrossValidation(ClassifierFactory<A> classifierFactory,
de.jungblut.math.DoubleVector[] features,
de.jungblut.math.DoubleVector[] outcome,
int numLabels,
Double threshold,
boolean verbose)
Does a 10 fold crossvalidation.
|
static <A extends Classifier> |
Evaluator.tenFoldCrossValidation(ClassifierFactory<A> classifierFactory,
de.jungblut.math.DoubleVector[] features,
de.jungblut.math.DoubleVector[] outcome,
int numLabels,
Double threshold,
int numThreads,
boolean verbose)
Does a 10 fold crossvalidation.
|
| Modifier and Type | Method and Description |
|---|---|
static Evaluator.EvaluationResult |
Evaluator.evaluateClassifier(Classifier classifier,
de.jungblut.math.DoubleVector[] features,
de.jungblut.math.DoubleVector[] outcome,
float splitFraction,
boolean random)
Trains and evaluates the given classifier with a test split.
|
static Evaluator.EvaluationResult |
Evaluator.evaluateClassifier(Classifier classifier,
de.jungblut.math.DoubleVector[] features,
de.jungblut.math.DoubleVector[] outcome,
float splitFraction,
boolean random,
Double threshold)
Trains and evaluates the given classifier with a test split.
|
static Evaluator.EvaluationResult |
Evaluator.evaluateSplit(Classifier classifier,
de.jungblut.math.DoubleVector[] trainFeatures,
de.jungblut.math.DoubleVector[] trainOutcome,
de.jungblut.math.DoubleVector[] testFeatures,
de.jungblut.math.DoubleVector[] testOutcome,
Double threshold)
Evaluates a given train/test split with the given classifier.
|
static Evaluator.EvaluationResult |
Evaluator.evaluateSplit(Classifier classifier,
EvaluationSplit split)
Evaluates a given train/test split with the given classifier.
|
static Evaluator.EvaluationResult |
Evaluator.evaluateSplit(Classifier classifier,
EvaluationSplit split,
Double threshold)
Evaluates a given train/test split with the given classifier.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractKNearestNeighbours
K nearest neighbour classification algorithm that is seeded with a "database"
of known examples and predicts based on the k-nearest neighbours majority
vote for a class.
|
class |
KNearestNeighbours
K nearest neighbour classification algorithm that is seeded with a "database"
of known examples and predicts based on the k-nearest neighbours majority
vote for a class.
|
class |
SparseKNearestNeighbours
K nearest neighbour classification algorithm that is seeded with a "database"
of known examples and predicts based on the k-nearest neighbours majority
vote for a class.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Voter<A extends Classifier>
Implementation of vote ensembling.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Voter<A extends Classifier>
Implementation of vote ensembling.
|
| Modifier and Type | Method and Description |
|---|---|
static <K extends Classifier> |
Voter.create(int numClassifiers,
Voter.CombiningType type,
ClassifierFactory<K> classifierFactory)
Creates a new voting classificator.
|
static <K extends Classifier> |
Voter.fromTrainedModels(List<K> classifier)
Creates a voter from the given trained models for prediction purposes.
|
| Modifier and Type | Method and Description |
|---|---|
Classifier[] |
Voter.getClassifier() |
| Modifier and Type | Class and Description |
|---|---|
class |
MultilayerPerceptron
Multilayer perceptron implementation that works on GPU via JCuda and CPU.
|
| Modifier and Type | Class and Description |
|---|---|
class |
LogisticRegression |
| Modifier and Type | Class and Description |
|---|---|
class |
DecisionTree
A decision tree that can be used for classification with numerical or
categorical features.
|
class |
RandomForest
A decision tree forest, using bagging.
|
| Modifier and Type | Class and Description |
|---|---|
class |
MaxEntMarkovModel
Maximum entropy markov model for named entity recognition (classifying labels
in sequence learning).
|
| Modifier and Type | Class and Description |
|---|---|
class |
HMM
Hidden Markov Model implementation for multiple observations for all three
types of problems HMM aims to solve (Decoding, likelihood estimation,
unsupervised/supervised learning).
|
Copyright © 2016. All rights reserved.