Finding essential attributes from binary data
From MaRDI portal
Recommendations
Cited in
(10)- Performance analysis of a greedy algorithm for inferring Boolean functions
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
- Reformulation of the support set selection problem in the logical analysis of data
- An improved branch-and-bound method for maximum monomial agreement
- A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
- Discriminative frequent subgraph mining with optimality guarantees
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Supervised box clustering
- Retracted article: Discrete optimization method based on Grassmannian parameterization in multidimensional dichotomic data structuring
- Computing minimal sets of descriptive conditions for binary data
This page was built for publication: Finding essential attributes from binary data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404409)