| Package | Description |
|---|---|
| org.kramerlab.bmad.algorithms |
Contains many different implementations of essential parts of a
boolean matrix decomposition algorithm, that is: candidate generators,
basis selectors, and row combinators.
|
| Modifier and Type | Class and Description |
|---|---|
class |
CombinatorPipeline
A row combinator, which is just a composition of multiple smaller row
combinators.
|
class |
CoverGreedyCombinator
Column combinator (3rd part of the algorithm), that tries to minimize the
absolute reconstruction error in every step.
|
class |
DensityGreedyCombinator
Combinator (3rd part of the algorithm), that tries to use the basis rows with
maximal "improvement density".
|
class |
GreedyCombinator
Abstract greedy Combinator (third step of the algorithm).
|
class |
IdentityCombinator
A "formal" combinator, that does nothing itself and just returns the
approximation generated by the basis selector in the previous step.
|
class |
Iter
Combinator proposed as third part of Miettinen's BCX algorithm.
|
| Modifier and Type | Field and Description |
|---|---|
protected Combinator |
BooleanMatrixDecomposition.combinator |
| Constructor and Description |
|---|
BooleanMatrixDecomposition(CandidateGenerator generator,
BasisSelector selector,
Combinator combinator,
double onesWeight) |
CombinatorPipeline(Combinator... combinators) |
Copyright © 2015. All rights reserved.