Uses of Interface
weka.core.TechnicalInformationHandler
Package
Description
-
Uses of TechnicalInformationHandler in weka.associations
-
Uses of TechnicalInformationHandler in weka.attributeSelection
Modifier and TypeClassDescriptionclass
CfsSubsetEval :
Evaluates the worth of a subset of attributes by considering the individual predictive ability of each feature along with the degree of redundancy between them.
Subsets of features that are highly correlated with the class while having low intercorrelation are preferred.
For more information see:
M.class
ReliefFAttributeEval :
Evaluates the worth of an attribute by repeatedly sampling an instance and considering the value of the given attribute for the nearest instance of the same and different class.class
WrapperSubsetEval:
Evaluates attribute sets by using a learning scheme. -
Uses of TechnicalInformationHandler in weka.classifiers
Modifier and TypeClassDescriptionclass
Class for performing a Bias-Variance decomposition on any classifier using the method specified in:
Ron Kohavi, David H.class
This class performs Bias-Variance decomposion on any classifier using the sub-sampled cross-validation procedure as specified in (1).
The Kohavi and Wolpert definition of bias and variance is specified in (2).
The Webb definition of bias and variance is specified in (3).
Geoffrey I. -
Uses of TechnicalInformationHandler in weka.classifiers.bayes
Modifier and TypeClassDescriptionclass
Class for a Naive Bayes classifier using estimator classes.class
Class for building and using a multinomial Naive Bayes classifier.class
Class for building and using an updateable multinomial Naive Bayes classifier.class
Class for a Naive Bayes classifier using estimator classes. -
Uses of TechnicalInformationHandler in weka.classifiers.bayes.net
Modifier and TypeClassDescriptionclass
The ADNode class implements the ADTree datastructure which increases the speed with which sub-contingency tables can be constructed from a data set in an Instances object.class
Builds a description of a Bayes Net classifier stored in XML BIF 0.3 format.
For more details on XML BIF see:
Fabio Cozman, Marek Druzdzel, Daniel Garcia (1998). -
Uses of TechnicalInformationHandler in weka.classifiers.bayes.net.search.global
Modifier and TypeClassDescriptionclass
This Bayes Network learning algorithm uses a hill climbing algorithm restricted by an order on the variables.
For more information see:
G.F.class
This Bayes Network learning algorithm uses the general purpose search method of simulated annealing to find a well scoring network structure.
For more information see:
R.R.class
This Bayes Network learning algorithm uses tabu search for finding a well scoring Bayes network structure.class
This Bayes Network learning algorithm determines the maximum weight spanning tree and returns a Naive Bayes network augmented with a tree.
For more information see:
N. -
Uses of TechnicalInformationHandler in weka.classifiers.bayes.net.search.local
Modifier and TypeClassDescriptionclass
This Bayes Network learning algorithm uses a hill climbing algorithm restricted by an order on the variables.
For more information see:
G.F.class
This Bayes Network learning algorithm uses the general purpose search method of simulated annealing to find a well scoring network structure.
For more information see:
R.R.class
This Bayes Network learning algorithm uses tabu search for finding a well scoring Bayes network structure.class
This Bayes Network learning algorithm determines the maximum weight spanning tree and returns a Naive Bayes network augmented with a tree.
For more information see:
N. -
Uses of TechnicalInformationHandler in weka.classifiers.functions
Modifier and TypeClassDescriptionclass
* Implements Gaussian processes for regression without hyperparameter-tuning.class
Class for building and using a multinomial logistic regression model with a ridge estimator.
There are some modifications, however, compared to the paper of leCessie and van Houwelingen(1992):
If there are k classes for n instances with m attributes, the parameter matrix B to be calculated will be an m*(k-1) matrix.
The probability for class j with the exception of the last class is
Pj(Xi) = exp(XiBj)/((sum[j=1..(k-1)]exp(Xi*Bj))+1)
The last class has probability
1-(sum[j=1..(k-1)]Pj(Xi))
= 1/((sum[j=1..(k-1)]exp(Xi*Bj))+1)
The (negative) multinomial log-likelihood is thus:
L = -sum[i=1..n]{
sum[j=1..(k-1)](Yij * ln(Pj(Xi)))
+(1 - (sum[j=1..(k-1)]Yij))
* ln(1 - sum[j=1..(k-1)]Pj(Xi))
} + ridge * (B^2)
In order to find the matrix B for which L is minimised, a Quasi-Newton Method is used to search for the optimized values of the m*(k-1) variables.class
Classifier for building linear logistic regression models.class
Implements John Platt's sequential minimal optimization algorithm for training a support vector classifier.
This implementation globally replaces all missing values and transforms nominal attributes into binary ones.class
SMOreg implements the support vector machine for regression.class
Implementation of the voted perceptron algorithm by Freund and Schapire. -
Uses of TechnicalInformationHandler in weka.classifiers.functions.supportVector
Modifier and TypeClassDescriptionclass
The Pearson VII function-based universal kernel.
For more information see:
B.class
Implementation of SMO for support vector regression as described in :
A.J.class
Learn SVM for regression using SMO with Shevade, Keerthi, et al.class
Implementation of the subsequence kernel (SSK) as described in [1] and of the subsequence kernel with lambda pruning (SSK-LP) as described in [2].
For more information, see
Huma Lodhi, Craig Saunders, John Shawe-Taylor, Nello Cristianini, Christopher J. -
Uses of TechnicalInformationHandler in weka.classifiers.lazy
Modifier and TypeClassDescriptionclass
K-nearest neighbours classifier.class
K* is an instance-based classifier, that is the class of a test instance is based upon the class of those training instances similar to it, as determined by some similarity function.class
Locally weighted learning. -
Uses of TechnicalInformationHandler in weka.classifiers.meta
Modifier and TypeClassDescriptionclass
Class for boosting a nominal class classifier using the Adaboost M1 method.class
Meta classifier that enhances the performance of a regression base classifier.class
Class for bagging a classifier to reduce variance.class
Class for doing classification using regression methods.class
Class for performing parameter selection by cross-validation for any classifier.
For more information, see:
R.class
Class for performing additive logistic regression.class
This method constructs a decision tree based classifier that maintains highest accuracy on training data and improves on generalization accuracy as it grows in complexity.class
Combines several classifiers using the stacking method.class
Class for combining classifiers. -
Uses of TechnicalInformationHandler in weka.classifiers.rules
Modifier and TypeClassDescriptionclass
Class for building and using a simple decision table majority classifier.
For more information see:
Ron Kohavi: The Power of Decision Tables.class
This class implements a propositional rule learner, Repeated Incremental Pruning to Produce Error Reduction (RIPPER), which was proposed by William W.class
Generates a decision list for regression problems using separate-and-conquer.class
Class for building and using a 1R classifier; in other words, uses the minimum-error attribute for prediction, discretizing numeric attributes.class
Class for generating a PART decision list. -
Uses of TechnicalInformationHandler in weka.classifiers.trees
Modifier and TypeClassDescriptionclass
A Hoeffding tree (VFDT) is an incremental, anytime decision tree induction algorithm that is capable of learning from massive data streams, assuming that the distribution generating examples does not change over time.class
Class for generating a pruned or unpruned C4.5 decision tree.class
Classifier for building 'logistic model trees', which are classification trees with logistic regression functions at the leaves.class
M5Base.class
Class for constructing a forest of random trees.
For more information see:
Leo Breiman (2001). -
Uses of TechnicalInformationHandler in weka.classifiers.trees.m5
-
Uses of TechnicalInformationHandler in weka.clusterers
Modifier and TypeClassDescriptionclass
Cluster data using the capopy clustering algorithm, which requires just one pass over the data.class
Class implementing the Cobweb and Classit clustering algorithms.
Note: the application of node operators (merging, splitting etc.) in terms of ordering and priority differs (and is somewhat ambiguous) between the original Cobweb and Classit papers.class
Cluster data using the FarthestFirst algorithm.
For more information see:
Hochbaum, Shmoys (1985).class
Cluster data using the k means algorithm. -
Uses of TechnicalInformationHandler in weka.core
Modifier and TypeClassDescriptionclass
Implements the Chebyshev distance.class
This subclass of Optimization.java implements conjugate gradient descent rather than BFGS updates, by overriding findArgmin(), with the same tests for convergence, and applies the same line search code.class
Implementing Euclidean distance (or similarity) function.
One object defines not one distance but the data model in which the distances between objects of that data model can be computed.
Attention: For efficiency reasons the use of consistency checks (like are the data models of the two instances exactly the same), is low.
For more information, see:
Wikipedia.class
Implements the Manhattan distance (or Taxicab geometry).class
Implementing Minkowski distance (or similarity) function.
One object defines not one distance but the data model in which the distances between objects of that data model can be computed.
Attention: For efficiency reasons the use of consistency checks (like are the data models of the two instances exactly the same), is low.
For more information, see:
Wikipedia.class
Implementation of Active-sets method with BFGS update to solve optimization problem with only bounds constraints in multi-dimensions. -
Uses of TechnicalInformationHandler in weka.core.neighboursearch
Modifier and TypeClassDescriptionclass
Class implementing the BallTree/Metric Tree algorithm for nearest neighbour search.
The connection to dataset is only a reference.class
Class implementing the CoverTree datastructure.
The class is very much a translation of the c source code made available by the authors.
For more information and original source code see:
Alina Beygelzimer, Sham Kakade, John Langford: Cover trees for nearest neighbor.class
Class implementing the KDTree search algorithm for nearest neighbour search.
The connection to dataset is only a reference. -
Uses of TechnicalInformationHandler in weka.core.neighboursearch.balltrees
Modifier and TypeClassDescriptionclass
The class that constructs a ball tree bottom up.class
Class that splits a BallNode of a ball tree using Uhlmann's described method.
For information see:
Jeffrey K.class
Class that splits a BallNode of a ball tree based on the median value of the widest dimension of the points in the ball.class
The class that builds a BallTree middle out.
For more information see also:
Andrew W.class
Implements the Moore's method to split a node of a ball tree.
For more information please see section 2 of the 1st and 3.2.3 of the 2nd:
Andrew W.class
The class implementing the TopDown construction method of ball trees. -
Uses of TechnicalInformationHandler in weka.core.neighboursearch.kdtrees
Modifier and TypeClassDescriptionclass
The class that splits a node into two such that the overall sum of squared distances of points to their centres on both sides of the (axis-parallel) splitting plane is minimum.
For more information see also:
Ashraf Masood Kibriya (2007).class
The class that splits a KDTree node based on the median value of a dimension in which the node's points have the widest spread.
For more information see also:
Jerome H.class
The class that splits a KDTree node based on the midpoint value of a dimension in which the node's points have the widest spread.
For more information see also:
Andrew Moore (1991).class
The class that splits a node into two based on the midpoint value of the dimension in which the node's rectangle is widest. -
Uses of TechnicalInformationHandler in weka.core.stemmers
Modifier and TypeClassDescriptionclass
An iterated version of the Lovins stemmer.class
A stemmer based on the Lovins stemmer, described here:
Julie Beth Lovins (1968). -
Uses of TechnicalInformationHandler in weka.datagenerators.classifiers.classification
-
Uses of TechnicalInformationHandler in weka.datagenerators.clusterers
Modifier and TypeClassDescriptionclass
Cluster data generator designed for the BIRCH System
Dataset is generated with instances in K clusters.
Instances are 2-d data points.
Each cluster is characterized by the number of data points in itits radius and its center. -
Uses of TechnicalInformationHandler in weka.experiment
Modifier and TypeClassDescriptionclass
Behaves the same as PairedTTester, only it uses the corrected resampled t-test statistic. -
Uses of TechnicalInformationHandler in weka.filters.supervised.attribute
Modifier and TypeClassDescriptionclass
An instance filter that discretizes a range of numeric attributes in the dataset into nominal attributes.class
Merges values of all nominal attributes among the specified attributes, excluding the class attribute, using the CHAID method, but without considering re-splitting of merged subsets.class
Converts all nominal attributes into binary numeric attributes.class
* A filter that uses a PartitionGenerator to generate partition membership values; filtered instances are composed of these values plus the class attribute (if set in the input data) and rendered as sparse instances. -
Uses of TechnicalInformationHandler in weka.filters.unsupervised.attribute
Modifier and TypeClassDescriptionclass
Converts the given set of data into a kernel matrix.class
Discretizes numeric attributes using equal frequency binning and forces the number of bins to be equal to the square root of the number of values of the numeric attribute.
For more information, see:
Ying Yang, Geoffrey I.class
Reduces the dimensionality of the data by projecting it onto a lower dimensional subspace using a random matrix with columns of unit length. -
Uses of TechnicalInformationHandler in weka.gui.boundaryvisualizer