Finding essential attributes from binary data
From MaRDI portal
Publication:1404409
DOI10.1023/A:1024653703689zbMATH Open1038.68092OpenAlexW1492854147WikidataQ59560621 ScholiaQ59560621MaRDI QIDQ1404409FDOQ1404409
Authors: Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura 
Publication date: 21 August 2003
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024653703689
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
- Discriminative frequent subgraph mining with optimality guarantees
- A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
- 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
Uses Software
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)
