| 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 | Field and Description |
|---|---|
static BooleanMatrixDecomposition |
BooleanMatrixDecomposition.BEST_UNCONFIGURED
An algorithm that delivers best results (one the two examples we tested)
without further configuration.
|
static BooleanMatrixDecomposition |
BooleanMatrixDecomposition.DBP
Algorithm proposed by Miettinen et.
|
static BooleanMatrixDecomposition |
BooleanMatrixDecomposition.LOC_ITER
Algorithm proposed by Miettinen for the BCX problem.
|
| Modifier and Type | Method and Description |
|---|---|
static BooleanMatrixDecomposition |
BooleanMatrixDecomposition.BEST_CONFIGURED(double assocThreshold)
Promising algorithm, that requires one further parameter to be learned.
|
Copyright © 2015. All rights reserved.