Uses of Class
meka.core.LabelSet

Packages that use LabelSet

Package	Description
meka.core

Uses of LabelSet in meka.core

Subclasses of LabelSet in meka.core

Modifier and Type	Class and Description
class	LabelSetComparator
class	LabelVector LabelVector - Multi-target compatible vector.

Methods in meka.core that return LabelSet

Modifier and Type	Method and Description
static LabelSet[]	PSUtils.convert(LabelSet[] sparseY, java.util.HashMap<LabelSet,java.lang.Integer> map) Given N labelsets 'sparseY', use a count 'map' to
static LabelSet[]	PSUtils.cover(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) Cover - cover 'y' completely (or as best as possible) with sets from 'map'.
LabelSet	LabelSet.deep_copy()
static LabelSet[]	PSUtils.getAllSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) GetAllSubsets - Get all frequent subsets of 'y' according to 'map'.
static LabelSet[]	PSUtils.getTopNSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map, int n) GetTopNSubsets - Don't cover all (like cover(y,map), rather only the top 'n')
static LabelSet	PSUtils.getTopSubset(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map)
static LabelSet[]	PSUtils.makeLabelSetMap(weka.core.Instances T)

Methods in meka.core that return types with arguments of type LabelSet

Modifier and Type	Method and Description
static java.util.HashMap<LabelSet,java.lang.Integer>	MLUtils.countCombinationsSparse(weka.core.Instances D, int L) CountCombinations in a sparse way.
static java.util.HashMap<LabelSet,java.lang.Integer>	PSUtils.countCombinationsSparse(weka.core.Instances D, int L) CountCombinationsSparse - return a mapping of each distinct label combination and its count.
static java.util.HashMap<LabelSet,java.lang.Integer>	PSUtils.countCombinationsSparseSubset(weka.core.Instances D, int[] indices) CountCombinationsSparseSubset - like CountCombinationsSparse, but only interested in 'indices[]' wrt 'D'.
static java.util.Set<LabelSet>	PSUtils.cover(LabelSet y, java.util.SortedSet<LabelSet> S, java.util.Comparator cmp)
static java.util.SortedSet<LabelSet>	PSUtils.getSortedSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to length, and counts in 'map'.
static java.util.SortedSet<LabelSet>	PSUtils.getSortedSubsets(LabelSet y, java.util.Set<LabelSet> set, java.util.Comparator cmp) Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to 'cmp'.
static java.util.Set<LabelSet>	PSUtils.getSubsets(LabelSet y, java.util.Set<LabelSet> set) Get Subsets - get all subsets of 'y' in the set 'set'.
static java.util.SortedSet<LabelSet>	PSUtils.getTopNSubsetsAsSet(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map, int n)
static java.util.HashMap<LabelSet,java.lang.Integer>	PSUtils.loadMap(java.lang.String filename) LoadMap - Load the HashMap stored in 'filename'.

Methods in meka.core with parameters of type LabelSet

Modifier and Type	Method and Description
static LabelSet[]	PSUtils.convert(LabelSet[] sparseY, java.util.HashMap<LabelSet,java.lang.Integer> map) Given N labelsets 'sparseY', use a count 'map' to
static double[]	PSUtils.convertDistribution(double[] p, int L, LabelSet[] meta_labels) Convert Distribution - Given the posterior across combinations, return the distribution across labels.
static int	PSUtils.countSubsets(LabelSet ysub, java.util.Set<LabelSet> Y) Count Subsets - returns the number of times labelset 'ysub' exists as a subset in 'Y'.
static LabelSet[]	PSUtils.cover(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) Cover - cover 'y' completely (or as best as possible) with sets from 'map'.
static java.util.Set<LabelSet>	PSUtils.cover(LabelSet y, java.util.SortedSet<LabelSet> S, java.util.Comparator cmp)
int	LabelSet.distance(LabelSet o)
static LabelSet[]	PSUtils.getAllSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) GetAllSubsets - Get all frequent subsets of 'y' according to 'map'.
static java.util.SortedSet<LabelSet>	PSUtils.getSortedSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to length, and counts in 'map'.
static java.util.SortedSet<LabelSet>	PSUtils.getSortedSubsets(LabelSet y, java.util.Set<LabelSet> set, java.util.Comparator cmp) Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to 'cmp'.
static java.util.Set<LabelSet>	PSUtils.getSubsets(LabelSet y, java.util.Set<LabelSet> set) Get Subsets - get all subsets of 'y' in the set 'set'.
static LabelSet[]	PSUtils.getTopNSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map, int n) GetTopNSubsets - Don't cover all (like cover(y,map), rather only the top 'n')
static java.util.SortedSet<LabelSet>	PSUtils.getTopNSubsetsAsSet(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map, int n)
static LabelSet	PSUtils.getTopSubset(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map)
void	LabelSet.minus(LabelSet l2)
static double[]	PSUtils.recombination_t(double[] p, int L, LabelSet[] map)
static double[]	PSUtils.recombination(double[] p, int L, LabelSet[] map) Convert Distribution - Given the posterior across combinations, return the distribution across labels.
int	LabelSet.subsetof(LabelSet y)

Method parameters in meka.core with type arguments of type LabelSet

Modifier and Type	Method and Description
static LabelSet[]	PSUtils.convert(LabelSet[] sparseY, java.util.HashMap<LabelSet,java.lang.Integer> map) Given N labelsets 'sparseY', use a count 'map' to
static int	PSUtils.countSubsets(LabelSet ysub, java.util.Set<LabelSet> Y) Count Subsets - returns the number of times labelset 'ysub' exists as a subset in 'Y'.
static LabelSet[]	PSUtils.cover(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) Cover - cover 'y' completely (or as best as possible) with sets from 'map'.
static java.util.Set<LabelSet>	PSUtils.cover(LabelSet y, java.util.SortedSet<LabelSet> S, java.util.Comparator cmp)
static LabelSet[]	PSUtils.getAllSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) GetAllSubsets - Get all frequent subsets of 'y' according to 'map'.
static java.util.SortedSet<LabelSet>	PSUtils.getSortedSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map) Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to length, and counts in 'map'.
static java.util.SortedSet<LabelSet>	PSUtils.getSortedSubsets(LabelSet y, java.util.Set<LabelSet> set, java.util.Comparator cmp) Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to 'cmp'.
static java.util.Set<LabelSet>	PSUtils.getSubsets(LabelSet y, java.util.Set<LabelSet> set) Get Subsets - get all subsets of 'y' in the set 'set'.
static LabelSet[]	PSUtils.getTopNSubsets(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map, int n) GetTopNSubsets - Don't cover all (like cover(y,map), rather only the top 'n')
static java.util.SortedSet<LabelSet>	PSUtils.getTopNSubsetsAsSet(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map, int n)
static LabelSet	PSUtils.getTopSubset(LabelSet y, java.util.HashMap<LabelSet,java.lang.Integer> map)
static weka.core.Instance[]	PSUtils.PSTransformation(weka.core.Instance x, int L, java.util.HashMap<LabelSet,java.lang.Integer> map, int n)
static void	PSUtils.saveMap(java.lang.String filename, java.util.HashMap<LabelSet,java.lang.Integer> map) SaveMap - Save the HashMap 'map' to the file 'filename'.
static int	PSUtils.sumCounts(java.util.HashMap<LabelSet,java.lang.Integer> map) Sum Counts - sum all the values in 'map'.

Constructor parameters in meka.core with type arguments of type LabelSet

Constructor and Description
LabelSetComparator(java.util.HashMap<LabelSet,java.lang.Integer> c)