Package | Description |
---|---|
meka.classifiers.multilabel.incremental | |
meka.core |
Modifier and Type | Field and Description |
---|---|
protected HashMap<LabelSet,Integer> |
PSUpdateable.combinations |
Modifier and Type | Class and Description |
---|---|
class |
LabelSetComparator |
class |
LabelVector
LabelVector - Multi-target compatible vector.
|
Modifier and Type | Method and Description |
---|---|
static LabelSet[] |
PSUtils.convert(LabelSet[] sparseY,
HashMap<LabelSet,Integer> map)
Given N labelsets 'sparseY', use a count 'map' to
|
static LabelSet[] |
PSUtils.cover(LabelSet y,
HashMap<LabelSet,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,
HashMap<LabelSet,Integer> map)
GetAllSubsets - Get all frequent subsets of 'y' according to 'map'.
|
static LabelSet[] |
PSUtils.getTopNSubsets(LabelSet y,
HashMap<LabelSet,Integer> map,
int n)
GetTopNSubsets - Don't cover all (like cover(y,map), rather only the top 'n')
|
static LabelSet |
PSUtils.getTopSubset(LabelSet y,
HashMap<LabelSet,Integer> map) |
static LabelSet[] |
PSUtils.makeLabelSetMap(weka.core.Instances T) |
Modifier and Type | Method and Description |
---|---|
static HashMap<LabelSet,Integer> |
PSUtils.countCombinationsSparse(weka.core.Instances D,
int L)
CountCombinationsSparse - return a mapping of each distinct label combination and its count.
|
static HashMap<LabelSet,Integer> |
MLUtils.countCombinationsSparse(weka.core.Instances D,
int L)
CountCombinations in a sparse way.
|
static HashMap<LabelSet,Integer> |
PSUtils.countCombinationsSparseSubset(weka.core.Instances D,
int[] indices)
CountCombinationsSparseSubset - like CountCombinationsSparse, but only interested in 'indices[]' wrt 'D'.
|
static Set<LabelSet> |
PSUtils.cover(LabelSet y,
SortedSet<LabelSet> S,
Comparator cmp) |
static SortedSet<LabelSet> |
PSUtils.getSortedSubsets(LabelSet y,
HashMap<LabelSet,Integer> map)
Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to length, and counts in 'map'.
|
static SortedSet<LabelSet> |
PSUtils.getSortedSubsets(LabelSet y,
Set<LabelSet> set,
Comparator cmp)
Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to 'cmp'.
|
static Set<LabelSet> |
PSUtils.getSubsets(LabelSet y,
Set<LabelSet> set)
Get Subsets - get all subsets of 'y' in the set 'set'.
|
static SortedSet<LabelSet> |
PSUtils.getTopNSubsetsAsSet(LabelSet y,
HashMap<LabelSet,Integer> map,
int n) |
static HashMap<LabelSet,Integer> |
PSUtils.loadMap(String filename)
LoadMap - Load the HashMap stored in 'filename'.
|
Modifier and Type | Method and Description |
---|---|
static LabelSet[] |
PSUtils.convert(LabelSet[] sparseY,
HashMap<LabelSet,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,
Set<LabelSet> Y)
Count Subsets - returns the number of times labelset 'ysub' exists as a subset in 'Y'.
|
static LabelSet[] |
PSUtils.cover(LabelSet y,
HashMap<LabelSet,Integer> map)
Cover - cover 'y' completely (or as best as possible) with sets from 'map'.
|
static Set<LabelSet> |
PSUtils.cover(LabelSet y,
SortedSet<LabelSet> S,
Comparator cmp) |
int |
LabelSet.distance(LabelSet o) |
static LabelSet[] |
PSUtils.getAllSubsets(LabelSet y,
HashMap<LabelSet,Integer> map)
GetAllSubsets - Get all frequent subsets of 'y' according to 'map'.
|
static SortedSet<LabelSet> |
PSUtils.getSortedSubsets(LabelSet y,
HashMap<LabelSet,Integer> map)
Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to length, and counts in 'map'.
|
static SortedSet<LabelSet> |
PSUtils.getSortedSubsets(LabelSet y,
Set<LabelSet> set,
Comparator cmp)
Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to 'cmp'.
|
static Set<LabelSet> |
PSUtils.getSubsets(LabelSet y,
Set<LabelSet> set)
Get Subsets - get all subsets of 'y' in the set 'set'.
|
static LabelSet[] |
PSUtils.getTopNSubsets(LabelSet y,
HashMap<LabelSet,Integer> map,
int n)
GetTopNSubsets - Don't cover all (like cover(y,map), rather only the top 'n')
|
static SortedSet<LabelSet> |
PSUtils.getTopNSubsetsAsSet(LabelSet y,
HashMap<LabelSet,Integer> map,
int n) |
static LabelSet |
PSUtils.getTopSubset(LabelSet y,
HashMap<LabelSet,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) |
Modifier and Type | Method and Description |
---|---|
static LabelSet[] |
PSUtils.convert(LabelSet[] sparseY,
HashMap<LabelSet,Integer> map)
Given N labelsets 'sparseY', use a count 'map' to
|
static int |
PSUtils.countSubsets(LabelSet ysub,
Set<LabelSet> Y)
Count Subsets - returns the number of times labelset 'ysub' exists as a subset in 'Y'.
|
static LabelSet[] |
PSUtils.cover(LabelSet y,
HashMap<LabelSet,Integer> map)
Cover - cover 'y' completely (or as best as possible) with sets from 'map'.
|
static Set<LabelSet> |
PSUtils.cover(LabelSet y,
SortedSet<LabelSet> S,
Comparator cmp) |
static LabelSet[] |
PSUtils.getAllSubsets(LabelSet y,
HashMap<LabelSet,Integer> map)
GetAllSubsets - Get all frequent subsets of 'y' according to 'map'.
|
static SortedSet<LabelSet> |
PSUtils.getSortedSubsets(LabelSet y,
HashMap<LabelSet,Integer> map)
Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to length, and counts in 'map'.
|
static SortedSet<LabelSet> |
PSUtils.getSortedSubsets(LabelSet y,
Set<LabelSet> set,
Comparator cmp)
Get Sorted Subsets - get all subsets of 'y' in the set 'set'; sorted according to 'cmp'.
|
static Set<LabelSet> |
PSUtils.getSubsets(LabelSet y,
Set<LabelSet> set)
Get Subsets - get all subsets of 'y' in the set 'set'.
|
static LabelSet[] |
PSUtils.getTopNSubsets(LabelSet y,
HashMap<LabelSet,Integer> map,
int n)
GetTopNSubsets - Don't cover all (like cover(y,map), rather only the top 'n')
|
static SortedSet<LabelSet> |
PSUtils.getTopNSubsetsAsSet(LabelSet y,
HashMap<LabelSet,Integer> map,
int n) |
static LabelSet |
PSUtils.getTopSubset(LabelSet y,
HashMap<LabelSet,Integer> map) |
static weka.core.Instance[] |
PSUtils.PSTransformation(weka.core.Instance x,
int L,
HashMap<LabelSet,Integer> map,
int n,
weka.core.Instances iTemplate)
Transform one instance into multi-class representations (an array of possibly multiple single-label instances).
|
static void |
PSUtils.saveMap(String filename,
HashMap<LabelSet,Integer> map)
SaveMap - Save the HashMap 'map' to the file 'filename'.
|
static int |
PSUtils.sumCounts(HashMap<LabelSet,Integer> map)
Sum Counts - sum all the values in 'map'.
|
Constructor and Description |
---|
LabelSetComparator(HashMap<LabelSet,Integer> c) |
Copyright © 2017. All Rights Reserved.