Abstract
In the class of discrete enumeration problems, an important place belongs to the problems of searching for frequently and infrequently occurring elements in integer data. Questions on the effectiveness of such a search are directly related to the study of the metric (quantitative) properties of sets of frequent and infrequent elements. It is assumed that the initial data are presented in the form of an integer matrix, whose rows are descriptions of the studied objects in the given system of the numerical characteristics of these objects, called attributes. The case is considered when each attribute takes values from the set {\(0,1, \ldots ,k - 1\} , \; k \geqslant 2\). Asymptotic estimates for the typical number of special, frequent fragments of object descriptions, called correct fragments, and estimates for the typical length of such a fragment are given. We also present new results concerning the study of the metric properties of the minimal infrequent fragments of descriptions of objects.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
L. V. Baskakova and Yu. I. Zhuravlev, “Model of recognition algorithms with representative sets and support set systems,” Zh. Vychisl. Mat. Mat. Fiz. 21 (5), 1264–1275 (1981).
P. L. Hammer, “Partially defined Boolean functions and cause-effect relationships,” in Lectures at the Int. Conf. on Multi-Attribute Decision Making via O.R.-based Expert Systems (University of Passau, Passau, Germany, 1986).
E. V. Dyukova and Yu. I. Zhuravlev, “Discrete analysis of feature descriptions in recognition problems of high dimensionality,” Comput. Math. Math. Phys. 40 (8), 1214–1227 (2000).
E. V. Dyukova and N. V. Peskov, “Search for informative fragments in descriptions of objects in discrete recognition procedures,” Comput. Math. Math. Phys. 42 (5), 711–723 (2002).
Yu. I. Zhuravlev, V. V. Ryazanov, and O. V. Sen’ko, Recognition. Mathematical Methods. Software System. Practical Applications (FAZIS, Moscow, 2006) [in Russian].
N. Dragunov, E. Djukova, and A. Djukova, “Supervised classification and finding frequent elements in data,” in VIII Int. Conf. on Information Technology and Nanotechnology (ITNT) (IEEE, Samara, 2022).
E. V. Djukova and A. P. Djukova, “On the complexity of learning logical classification procedures,” “Informatics and Applications” 16 (4), 57–62 (2022).
A. E. Andreev, “On the asymptotic behavior of the number of dead-end tests and the length of the minimum test for almost all tables,” Probl. Kibern., No. 41, pp. 117–142 (1984) [in Russian].
E. V. Djukova and R. M. Sotnezov, “Asymptotic estimates for the number of solutions of the dualization problem and its generalizations,” Comput. Math. Math. Phys. 51 (8), 1431–1440 (2011).
V. N. Noskov and V. A. Slepyan, “On the number of dead-end tests for a class of tables,” Kibernetika, No. 1, 60–65 (1972) [in Russian].
C. Aggarwal Charu, Frequent Pattern Mining (Springer, New York, 2014). https://www.charuaggarwal.net/freqbook.pdf.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Djukova, A.P., Djukova, E.V. Number of Solutions for Some Special Logical Analysis Problems of Integer Data. J. Comput. Syst. Sci. Int. 62, 817–826 (2023). https://doi.org/10.1134/S1064230723050052
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230723050052