issues
search
dzieciou
/
tree-labeller
Helps label training data using taxonomy information.
BSD 3-Clause "New" or "Revised" License
4
stars
1
forks
source link
Evaluate organoleptically different sampling approaches:
#9
Open
dzieciou
opened
1 year ago
dzieciou
commented
1 year ago
sampling n most distant leaves in a subtree
sort leaves by different subtrees,
dzieciou
commented
1 year ago
Quality criteria:
Exactly n leaves are selected
Let b(T,d) be a set of descendants of T at depth d, and |b(T,d)| be the cardinality of this set.
We want to find max d, such that |b(T,d)| >= n, but |b(T,d+1)| < n