Skip to main content
Erschienen in: Automatic Documentation and Mathematical Linguistics 6/2020

01.11.2020 | INFORMATION ANALYSIS

Some Estimates of Computational Complexity When Predicting the Properties of New Objects Using Characteristic Functions

verfasst von: M. I. Zabezhailo

Erschienen in: Automatic Documentation and Mathematical Linguistics | Ausgabe 6/2020

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract—

This paper discusses approaches to evaluating the quality of intelligent data analysis results in diagnostic tasks. The reliability (indisputability) of empirical dependencies established during training (interpolation–extrapolation) on precedents is evaluated using a special mathematical tool, that is, characteristic functions. Characteristic functions are generated on the available sample of empirical data based on similarity analysis of precedent descriptions, formalized as a binary algebraic operation. Some estimates of the computational complexity of applying the proposed mathematical technique of characteristic functions to predicting (diagnosing) the properties of newly studied precedents are presented.
Fußnoten
1
The use of quotation marks here reflects a possible situation in which only some of the factors that characterize the causality mechanism of corresponding effects can be expressed in the chosen KRL, and an exhaustive causality description requires a more complete KRL.
 
2
is true for the counterexample in question.
 
3
This statement would be impossible to disprove on the current fact database!
 
4
Such problems shall be called polynomial-time solvable.
 
5
It may be shown that this set represents the Galois closure (see, for example, [4]) for a singleton set of generators {ak} with respect to the “alphabet” U and the set of examples Ω+ constructed on it using the intersection operation ∩ as the similarity operation ⊗.
 
6
That meet the condition of counterexample prohibition.
 
Literatur
1.
Zurück zum Zitat Zabezhailo, M.I., On the capacity of families of characteristic functions that provide the correct solution to problems of diagnostic type, Tezisy dokladov 19-i Vserossiiskoi konferentsii “Matematicheskie metody raspoznavaniya obrazov”—MMRO-2019 (25–28 oktyabrya 2019 g., Moskva) (Abstracts of the 19th All-Russian Conference “Mathematical Methods for Pattern Recognition”—MMRO-2019 (October 25–28, 2019, Moscow)), Moscow, 2019, pp. 305–306. Zabezhailo, M.I., On the capacity of families of characteristic functions that provide the correct solution to problems of diagnostic type, Tezisy dokladov 19-i Vserossiiskoi konferentsii “Matematicheskie metody raspoznavaniya obrazov”—MMRO-2019 (25–28 oktyabrya 2019 g., Moskva) (Abstracts of the 19th All-Russian Conference “Mathematical Methods for Pattern Recognition”—MMRO-2019 (October 25–28, 2019, Moscow)), Moscow, 2019, pp. 305–306.
2.
Zurück zum Zitat Zabezhailo, M.I. and Trunin, Yu.Yu., On the problem of medical diagnostic evidence: Intelligent analysis of empirical data on patients in samples of limited size, Autom. Doc. Math. Linguist., 2019, vol. 53, pp. 322–328.CrossRef Zabezhailo, M.I. and Trunin, Yu.Yu., On the problem of medical diagnostic evidence: Intelligent analysis of empirical data on patients in samples of limited size, Autom. Doc. Math. Linguist., 2019, vol. 53, pp. 322–328.CrossRef
3.
Zurück zum Zitat Grusho, A.A., Zabezhailo, M.I., and Timonina, E.E., On the causal representativeness of training sets of precedents in diagnostic problems, Informatics and Applications, 2020, no. 1, pp. 80–86. Grusho, A.A., Zabezhailo, M.I., and Timonina, E.E., On the causal representativeness of training sets of precedents in diagnostic problems, Informatics and Applications, 2020, no. 1, pp. 80–86.
4.
5.
6.
Zurück zum Zitat Valiant, L.G., The complexity of enumeration and reliability problems, SIAM J. Comput., 1979, vol. 8, no. 1, pp. 410–421.MathSciNetCrossRef Valiant, L.G., The complexity of enumeration and reliability problems, SIAM J. Comput., 1979, vol. 8, no. 1, pp. 410–421.MathSciNetCrossRef
7.
Zurück zum Zitat Valiant, L.G., The complexity of computing the permanent, Theor. Comput. Sci., 1979, vol. 8, no. 2, pp. 189–201.MathSciNetCrossRef Valiant, L.G., The complexity of computing the permanent, Theor. Comput. Sci., 1979, vol. 8, no. 2, pp. 189–201.MathSciNetCrossRef
8.
Zurück zum Zitat Grusho, A.A., Zabezhailo, M.I., Zatsarinnyi, A.A., and Timonina, E.E., On some possibilities of resource management in organizing proactive counteraction to computer attacks, Informatics and Applications, 2018, vol. 12, no. 1, pp. 62–70. Grusho, A.A., Zabezhailo, M.I., Zatsarinnyi, A.A., and Timonina, E.E., On some possibilities of resource management in organizing proactive counteraction to computer attacks, Informatics and Applications, 2018, vol. 12, no. 1, pp. 62–70.
Metadaten
Titel
Some Estimates of Computational Complexity When Predicting the Properties of New Objects Using Characteristic Functions
verfasst von
M. I. Zabezhailo
Publikationsdatum
01.11.2020
Verlag
Pleiades Publishing
Erschienen in
Automatic Documentation and Mathematical Linguistics / Ausgabe 6/2020
Print ISSN: 0005-1055
Elektronische ISSN: 1934-8371
DOI
https://doi.org/10.3103/S0005105520060072

Weitere Artikel der Ausgabe 6/2020

Automatic Documentation and Mathematical Linguistics 6/2020 Zur Ausgabe