On the complexity of implementing logical supervised classification procedures

DOI10.1134/S0965542525700848MaRDI QIDQ6925715zbMATH OpenFDO

Authors E. V. Dyukova

Publication date 25 September 2025

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542525700848

zbMATH Keywords

asymptotically optimal algorithmintractable discrete problemirredundant covering of an integer matrixlogical data analysisregular representative elementary classifiersupervised classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Computational aspects of data analysis and big data (68T09) Pattern recognition, speech recognition (68T10)

Cites work

• Algorithms for finding logical regularities in pattern recognition
• Asymptotic estimates of some characteristics of a set of representative systems and the problem of stability
• Asymptotically optimal dualization algorithms
• Discrete analysis of feature descriptions in recognition problems of high dimensionality
• Efficient algorithms for dualizing large-scale hypergraphs
• scientific article; zbMATH DE number 3474790 (Why is no real title available?)
• scientific article; zbMATH DE number 3622987 (Why is no real title available?)
• Logical classification based on finding regular representative elementary classifiers
• Number of solutions for some special logical analysis problems of integer data
• On generating all maximal independent sets
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Triadic formal concept analysis and triclustering: searching for optimal patterns

This page was built for publication: On the complexity of implementing logical supervised classification procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925715)