| 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 |
AssociationGenerator
Implementation of the Association candidate generation method, which was used
as first part of Miettinen's DBP algorithm.
|
class |
IdentityGenerator
Candidate generator, that just takes rows of the original matrix as
candidates.
|
class |
IntersectionGenerator
Candidate generator that takes all pairwise intersections of rows of the
original matrix as candidates.
|
class |
RestrictedIntersectionGenerator
Similar to IntersectionGenerator, this candidate generator creates candidates
by intersecting rows of the original matrix.
|
| Modifier and Type | Field and Description |
|---|---|
protected CandidateGenerator |
BooleanMatrixDecomposition.generator |
| Constructor and Description |
|---|
BooleanMatrixDecomposition(CandidateGenerator generator,
BasisSelector selector,
Combinator combinator,
double onesWeight) |
Copyright © 2015. All rights reserved.