УДК 519.217.2

РОЗПОДІЛЕНІ БАЄСІВСЬКІ ПРОЦЕДУРИ МАШИННОГО НАВЧАННЯ

Белецкий Борис Александрович,
кандидат физ.-мат. наук, старший научный сотрудник Института кибернетики им. В.М. Глушкова НАН Украины, Киев,  borys.biletskyy@gmail.com

СПИСОК ЛІТЕРАТУРИ

1. Hilbert M., LЛpez P. The world’s technological capacity to store, communicate, and compute information. Science. 2011. Vol. 332, Iss. 6025. P. 60–65.


2. Moore G.E. Cramming more components onto integrated circuits. Electronics. 1965. Vol. 38, N 8. P. 114–117.


3. Gilbert S., Lynch N. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News. 2002. Vol. 33, Iss. 2. P. 51–59.


4. Dean J., Ghemawat S. MapReduce: simplified data processing on large clusters. Proс. of the 6th Conference on Symposium on Opearting Systems Design & Implementation. 2004. Vol. 6. P. 10–17.


5. Manning C.D., Raghavan P., Schtze H. Introduction to information retrieval. New York: Cambridge University Press, 2008. 482 p.


6. Sergienko I.V., Gupal A.M., Pashko S.V. Complexity of classification problems. Cybernetics and Systems Analysis. 1996. Vol. 32, N 4. P. 519–533.


7. Beletskiy B.A, Vagis A.A., Vasilyev S.V, Gupal N.A. Complexity of Bayesian procedure of inductive inference. Discrete case. Journal of Automation and Information Sciences. 2006. Vol. 38, Iss. 11. P. 56–73.


8. URL: https://github.com/bbiletskyy/categorical-bayes.


9. Czerniak J., Zarzycki H. Application of rough sets in the presumptive diagnosis of urinary system diseases. In: Artificial Intelligence and Security in Computing Systems. The Springer International Series in Engineering and Computer Science. Soldek J., Drobiazgiewicz L. (Eds.). Boston, MA: Springer, 2003. Vol. 752. P. 41–51.