Package weka.classifiers.lazy.AM.label
Class BitSetLabel
- java.lang.Object
-
- weka.classifiers.lazy.AM.label.Label
-
- weka.classifiers.lazy.AM.label.BitSetLabel
-
-
Constructor Summary
Constructors Constructor Description BitSetLabel(java.util.BitSet l, int c)
Create a new label by storing match/mismatch information in the given bitset.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
allMatching()
java.util.Iterator<Label>
descendantIterator()
The "descendants" of a label are the set of labels with the same "mismatch" entries, but with one or more of the "match" entries changed into a "mismatch" entry.boolean
equals(java.lang.Object other)
int
getCardinality()
int
hashCode()
Label
intersect(Label other)
Create a new label for which each location is marked as a match if both this label and otherLabel are marked match, otherwise mismatch.boolean
isDescendantOf(Label possibleDescendant)
Determine if this label is the "descendant" of possibleAncestor.boolean
matches(int index)
Determine if the given index is marked as a match or a mismatch.int
numMatches()
java.lang.String
toString()
Label
union(Label other)
Create a new label for which each location is marked as a match if either this label orother
is marked match, otherwise mismatch.
-
-
-
Method Detail
-
getCardinality
public int getCardinality()
- Specified by:
getCardinality
in classLabel
- Returns:
- The number of attributes represented in this label.
-
matches
public boolean matches(int index)
Description copied from class:Label
Determine if the given index is marked as a match or a mismatch.
-
numMatches
public int numMatches()
- Specified by:
numMatches
in classLabel
- Returns:
- The total number of matches marked in this label.
-
intersect
public Label intersect(Label other)
Description copied from class:Label
Create a new label for which each location is marked as a match if both this label and otherLabel are marked match, otherwise mismatch. In other words, keep all mismatches from both labels.
-
union
public Label union(Label other)
Description copied from class:Label
Create a new label for which each location is marked as a match if either this label orother
is marked match, otherwise mismatch. In other words, keep all matches from both labels.
-
allMatching
public boolean allMatching()
- Specified by:
allMatching
in classLabel
- Returns:
- true if every feature of this label is a match (i.e. this is the
top of the lattice
; false otherwise
-
toString
public java.lang.String toString()
- Overrides:
toString
in classjava.lang.Object
-
equals
public boolean equals(java.lang.Object other)
- Overrides:
equals
in classjava.lang.Object
-
hashCode
public int hashCode()
- Overrides:
hashCode
in classjava.lang.Object
-
descendantIterator
public java.util.Iterator<Label> descendantIterator()
Description copied from class:Label
The "descendants" of a label are the set of labels with the same "mismatch" entries, but with one or more of the "match" entries changed into a "mismatch" entry. For example, the children of{match, mismatch, mismatch, match}
are:{mismatch, mismatch, mismatch, match}
,{match, mismatch, mismatch, mismatch}
, and{mismatch, mismatch, mismatch, mismatch}
- Specified by:
descendantIterator
in classLabel
- Returns:
- An iterator over the label descendants
-
isDescendantOf
public boolean isDescendantOf(Label possibleDescendant)
Description copied from class:Label
Determine if this label is the "descendant" of possibleAncestor. This label is a descendant of the other label if every mismatching entry in the other label is also a mismatching entry in this label. Any label is also a descendant of itself.- Specified by:
isDescendantOf
in classLabel
- Parameters:
possibleDescendant
- possible label ancestor- Returns:
- true if possibleAncestor is an ancestor of this label; false otherwise.
-
-