On the logical analysis of partially ordered data in the supervised classification problem
DOI10.1134/S0965542519090082zbMath1494.68212OpenAlexW2980337740MaRDI QIDQ2284267
E. V. Dyukova, G. O. Masliakov, P. A. Prokofyev
Publication date: 14 January 2020
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542519090082
supervised classificationdualization over products of partially ordered setsirreducible covering of Boolean matrixlogical data analysismonotone dualizationordered irredundant covering of integer matrix
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generating all maximal independent sets
- Algebraic-logic synthesis of correct recognition procedures based on elementary algorithms
- Logical correctors in the problem of classification by precedents
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions
- Finding maximal independent elements of products of partial orders (the case of chains)
- Asymptotically optimal dualization algorithms
- Efficient algorithms for dualizing large-scale hypergraphs
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- A model of recognition algorithms with representative samples and systems of supporting sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Discrete analysis of feature descriptions in recognition problems of high dimensionality
This page was built for publication: On the logical analysis of partially ordered data in the supervised classification problem
