Package 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.

See: Description

Interface Summary

Interface	Description
BasisSelector	This is the second component of the BMD algorithm.
CandidateGenerator	First component of the generic boolean matrix decomposition algorithm.

Class Summary

Class	Description
AssociationGenerator	Implementation of the Association candidate generation method, which was used as first part of Miettinen's DBP algorithm.
BooleanMatrixDecomposition	Implementation of a generic boolean matrix decomposition algorithm, that fits into this framework.
Combinator	The last component of the generic boolean matrix decomposition algorithm.
CombinatorPipeline	A row combinator, which is just a composition of multiple smaller row combinators.
Cover	A structure that stores all information necessary to predict changes of a weighted cover function for one single row.
CoverGreedyCombinator	Column combinator (3rd part of the algorithm), that tries to minimize the absolute reconstruction error in every step.
DensityGreedyCombinator	Combinator (3rd part of the algorithm), that tries to use the basis rows with maximal "improvement density".
FastLoc	A minor modification of Local search heuristic, proposed by Miettinen as second part of his BCX algorithm.
GreedyCombinator	Abstract greedy Combinator (third step of the algorithm).
GreedySelector	Basis Selector algorithm, that greedily selects the basis rows, estimating the reconstruction error by keeping an approximation of the combination matrix, which is also updated greedily in each step.
IdentityCombinator	A "formal" combinator, that does nothing itself and just returns the approximation generated by the basis selector in the previous step.
IdentityGenerator	Candidate generator, that just takes rows of the original matrix as candidates.
IntersectionGenerator	Candidate generator that takes all pairwise intersections of rows of the original matrix as candidates.
Iter	Combinator proposed as third part of Miettinen's BCX algorithm.
RestrictedIntersectionGenerator	Similar to IntersectionGenerator, this candidate generator creates candidates by intersecting rows of the original matrix.

Package org.kramerlab.bmad.algorithms Description

Contains many different implementations of essential parts of a boolean matrix decomposition algorithm, that is: candidate generators, basis selectors, and row combinators. The boolean matrix decomposition algorithm is implemented in BooleanMatrixDecomposition.java, all other classes are parts, that can be plugged into this abstract implementation.