All Classes
-
All Classes Interface Summary Class Summary Enum Summary Class Description AMResults The results of runningAM
, containing the analogical effects of the individual training instances as well as the relevant supracontexts and overall class likelihoods.AMResults.Judgement AMResults.PointerCountingStrategry AMUtils This class holds constants and methods used in the AM classifier.AMUtils.CsvBuilder Simplify CSV printing by allowing specifying rows as Maps and converting automatically to lists of column values in theAMUtils.CsvBuilder.build(boolean)
method.AMUtils.CsvDoc AMVersion AnalogicalModeling Implements the Analogical Modeling algorithm, invented by Royal Skousen.AnalogicalModelingOutput This class implements a classification output scheme specific to the Analogical Modeling classifier.AnalogicalSetFormatter BasicLattice This class holds the supracontextual lattice and does the work of filling itself during classification.BasicSupra Basic implementation ofSupracontext
with no extra features.BitSetLabel ThisLabel
implementations sores match and mismatch data in aBitSet
, so there is no limit on the cardinality.BitSetLabeler ALabeler
implementation that createsBitSetLabels
.CanonicalizingSet<T> A set implementation that can be used to retrieve canonical versions of objects; this is not possible withSet
because of the lack of aget
method.ClassifiedSupra This supracontext is called "classified" because it keeps track of its outcome (or "class") at all times by inspecting the outcomes of the subcontexts added to it.Concept<T extends Supracontext> This class is a decorator which wraps aSupracontext
and adds the functionality of a node (concept) used in the ImprovedAddIntent algorithm (seeSparseLattice
.DistributedLattice This lass manages several smaller, heterogeneous lattices.DistributionFormatter Enum2TagUtils In Weka, configuration with a specific set of possible values is implemented usingTag
.Enum2TagUtils.TagInfo Enums whose values are to be used as tags should implement this.GangEffect Exemplars that seem less similar to the test item than those that seem more similar can still have a magnified effect if there are many of them.GangEffectsFormatter HeterogeneousLattice Same as a normal lattice, except no supracontext is deemed heterogeneous and hence everything is kept.IntLabel ALabel
implementation that stores match/mismatch data in a single integer for compactness and speed.IntLabeler Analogical Modeling uses labels composed of boolean vectors in order to group instances into subcontexts and subcontexts in supracontexts.JohnsenJohanssonLattice The approximation algorithm from "Efficient Modeling of Analogy", Johnsen and Johansson, DOI 10.1007/978-3-540-30586-6_77.Label Analogical Modeling uses labels composed of boolean vectors in order to group instances into subcontexts and subcontexts into supracontexts.Labeler Analogical Modeling uses labels composed of boolean vectors in order to group instances into subcontexts and subcontexts in supracontexts.Labeler.Partition Simple class for storing index spans.LabelerFactory A factory for creatingLabeler
instances.LabelerFactory.BitSetLabelerFactory LabelerFactory.CardinalityBasedLabelerFactory The cardinality of the instances restricts what kinds oflabels
can be used, and the Labeler which produces the smallest, fastest labels will be returned.LabelerFactory.IntLabelerFactory LabelerFactory.LongLabelerFactory Lattice Given a list of subcontexts, a lattice creates a collection of supracontexts, which are then used to create analogical sets and classify data.LatticeFactory Factory for creatingLattices
.LatticeFactory.CardinalityBasedLatticeFactory Chooses the lattice implementation based on the cardinality of the instances in the subcontext list.LinkedLatticeNode<T extends Supracontext> This class is a decorator which wraps aSupracontext
and adds the functionality of a linked node used in certain lattice-filling algorithms.LongLabel ALabel
implementation that stores match/mismatch data in a single long for compactness and speed.LongLabeler This labeler creates labels via theLongLabel
implementation.MissingDataCompare SparseLattice Warning: this class is currently experimental, slow, and not correct.Subcontext Represents a subcontext, containing a list ofInstances
which belong to it, along with their sharedLabel
and common outcome.SubcontextList This class creates and manages a list ofsubcontexts
from a set of previously classified exemplars and an exemplar to be classified.Supracontext A supracontext contains a set ofSubcontexts
which have certain commonalities in theirLabels
.