BitSetLabel |
This Label implementations sores match and mismatch data in a
BitSet , so there is no limit on the cardinality.
|
BitSetLabeler |
|
IntLabel |
A Label 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.
|
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.BitSetLabelerFactory |
|
LabelerFactory.CardinalityBasedLabelerFactory |
The cardinality of the instances restricts what kinds of labels can be used, and
the Labeler which produces the smallest, fastest labels will be returned.
|
LabelerFactory.IntLabelerFactory |
|
LabelerFactory.LongLabelerFactory |
|
LongLabel |
A Label implementation that stores match/mismatch data in a single
long for compactness and speed.
|
LongLabeler |
This labeler creates labels via the LongLabel implementation.
|