Глоссариум по искусственному интеллекту: 2500 терминов. Том 2. Александр Юрьевич Чесалов. Читать онлайн. Newlib. NEWLIB.NET

Автор: Александр Юрьевич Чесалов
Издательство: Издательские решения
Серия:
Жанр произведения:
Год издания: 0
isbn: 9785006094109
Скачать книгу
(Bilingual Evaluation Understudy) is a text quality evaluation algorithm between 0.0 and 1.0, inclusive, indicating the quality of a translation between two human languages (for example, between English and Russian). A BLEU score of 1.0 indicates a perfect translation; a BLEU score of 0.0 indicates a terrible translation175.

      Blockchain is algorithms and protocols for decentralized storage and processing of transactions structured as a sequence of linked blocks without the possibility of their subsequent change176.

      Boltzmann machine (also stochastic Hopfield network with hidden units) is a type of stochastic recurrent neural network and Markov random field. Boltzmann machines can be seen as the stochastic, generative counterpart of Hopfield networks177.

      Boolean neural network is an artificial neural network approach which only consists of Boolean neurons (and, or, not). Such an approach reduces the use of memory space and computation time. It can be implemented to the programmable circuits such as FPGA (Field-Programmable Gate Array or Integrated circuit).

      Boolean satisfiability problem (also propositional satisfiability problem; abbreviated SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable. On the other hand, if no such assignment exists, the function expressed by the formula is FALSE for all possible variable assignments and the formula is unsatisfiable178.

      Boosting is a Machine Learning ensemble meta-algorithm for primarily reducing bias and variance in supervised learning, and a family of Machine Learning algorithms that convert weak learners to strong ones179.

      Bounding Box commonly used in image or video tagging; this is an imaginary box drawn on visual information. The contents of the box are labeled to help a model recognize it as a distinct type of object.

      Brain technology (also self-learning know-how system) is a technology that employs the latest findings in neuroscience. The term was first introduced by the Artificial Intelligence Laboratory in Zurich, Switzerland, in the context of the ROBOY project. Brain Technology can be employed in robots, know-how management systems and any other application with self-learning capabilities. In particular, Brain Technology applications allow the visualization of the underlying learning architecture often coined as «know-how maps»180.

      Brain—computer interface (BCI), sometimes called a brain—machine interface (BMI), is a direct communication pathway between the brain’s electrical activity and an external device, most commonly a computer or robotic limb. Research on brain—computer interface began in the 1970s by Jacques Vidal at the University of California, Los Angeles (UCLA) under a grant from the National Science Foundation, followed by a contract from DARPA. The Vidal’s 1973 paper marks the first appearance of the expression brain—computer interface in scientific literature181.

      Brain-inspired computing – calculations on brain-like structures, brain-like calculations using the principles of the brain (see also neurocomputing, neuromorphic engineering).

      Branching factor in computing, tree data structures, and game theory, the number of children at each node, the outdegree. If this value is not uniform, an average branching factor can be calculated182,183.

      Broadband refers to various high-capacity transmission technologies that transmit data, voice, and video across long distances and at high speeds. Common mediums of transmission include coaxial cables, fiber optic cables, and radio waves184.

      Brute-force search (also exhaustive search or generate and test) is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem’s statement185.

      Bucketing – converting a (usually continuous) feature into multiple binary features called buckets or bins, typically based on value range186.

      Byte – eight bits. A byte is simply a chunk of 8 ones and zeros. For example: 01000001 is a byte. A computer often works with groups of bits rather than individual bits and the smallest group of bits that a computer usually works with is a byte. A byte is equal to one column in a file written in character format187.

      «C»

      CAFFE is short for Convolutional Architecture for Fast Feature Embedding which is an open-source deep learning framework de- veloped in Berkeley AI Research. It supports many different deep learning architectures and GPU-based acceleration computation kernels188,189.

      Calibration layer is a post-prediction adjustment, typically to account for prediction bias. The adjusted predictions and probabilities should match the distribution of an observed set of labels190.

      Candidate generation — the initial set of recommendations chosen by a recommendation system191.

      Candidate sampling is a training-time optimization in which a probability is calculated for all the positive labels, using, for example, softmax, but only for a random sample of negative labels. For example, if we have an example labeled beagle and dog candidate sampling computes the predicted probabilities and corresponding loss terms for the beagle and dog class outputs in addition to a random subset of the remaining classes (cat, lollipop, fence). The idea is that the negative classes can learn from less frequent negative reinforcement as long as positive classes always get proper positive reinforcement, and this is indeed observed empirically. The motivation for candidate sampling is a computational efficiency win from not computing predictions for all negatives192.

      Canonical Formats in information technology, canonicalization is the process of making something conform] with some specification… and is in an approved format. Canonicalization may sometimes mean generating canonical data from noncanonical data. Canonical formats are widely supported and considered to be optimal for long-term preservation193.

      Capsule neural network (CapsNet) is a machine learning system that is a type of artificial neural network (ANN) that can be used to better model hierarchical relationships. The approach is an attempt to more closely mimic biological neural organization194,195.

      Case-Based Reasoning (CBR) is a way to solve a new problem by using solutions to similar problems. It has been formalized


<p>175</p>

BLEU (Bilingual Evaluation Understudy) [Электронный ресурс] https://developers.google.com URL: https://developers.google.com/machine-learning/glossary/language (дата обращения: 27.03.2023)

<p>176</p>

Blockchain [Электронный ресурс] https://books.google.ru URL: https://books.google.ru/books?id= -w2DEAAAQBAJ&pg=PT301&lpg= PT301&dq=algorithms+and +protocols+for+decentralized+storage+and+processing+of +transactions +structured+as+a+sequence+of+linked+blocks+without+the+ possibility +of+their+subsequent+change&source =bl&ots=ruX5Ow4F-g&sig= ACfU3U0fmUw6tcXOQoRbPdWNAfwf5AFYWQ&hl =ru&sa=X&ved=2ahUKEwjmpsrjx_ 79AhWDmIsKHQqDBvMQ6AF6BAgrEAM#v= onepage&q=algorithms%20and %20protocols%20for %20decentralized%20storage%20and%20processing %20of%20transactions %20structured%20as%20a%20sequence %20of%20linked%20blocks %20without%20the %20possibility%20of%20their% 20subsequent %20change&f=false (дата обращения: 28.03.2023)

<p>177</p>

Boltzmann machine [Электронный ресурс] https://dic.academic.ru URL: https://dic.academic.ru/dic.nsf/ruwiki/1828062 (дата обращения: 04.02.2022)

<p>178</p>

Boolean satisfiability problem A. de Carvalho M.C. Fairhurst D.L. Bisset, An integrated Boolean neural network for pattern classification. Pattern Recognition Letters Volume 15, Issue 8, August 1994, Pages 807—813 (дата обращения: 10.02.2022)

<p>179</p>

Boosting [Электронный ресурс] https://en.wikipedia.org URL: https://en.wikipedia.org/wiki/Boosting_(machine_learning) (дата обращения: 28.03.2023)

<p>180</p>

Brain technology [Электронный ресурс] https://en.wikipedia.org URL: https://en.wikipedia.org/wiki/Brain_technology (дата обращения: 10.05.2023)

<p>181</p>

Brain—computer interface [Электронный ресурс] https://en.wikipedia.org URL: https://en.wikipedia.org/wiki/Brain%E2%80%93computer_interface (дата обращения: 07.07.2022)

<p>182</p>

Branching factor [Электронный ресурс] https://en.wikipedia.org URL: https://en.wikipedia.org/wiki/Branching_factor (дата обращения: 28.03.2023)

<p>183</p>

Коэффициент ветвления дерева [Электронный ресурс] https://ru.wikipedia.org URL: https://ru.wikipedia.org/wiki/Коэффициент_ветвления_(информатика) (дата обращения: 28.03.2023)

<p>184</p>

Broadband [Электронный ресурс] www.investopedia.com URL: https://www.investopedia.com/terms/b/broadband.asp (дата обращения: 07.07.2022)

<p>185</p>

Brute-force search [Электронный ресурс] https://spravochnick.ru URL: https://spravochnick.ru/informatika/algoritmizaciya/algoritm_polnogo_perebora/ (дата обращения: 07.02.2022)

<p>186</p>

Bucketing [Электронный ресурс] https://www.primeclasses.in URL: https://www.primeclasses.in/glossary/data-science-course/machine-learning/bucketing (дата обращения: 29.06.2023)

<p>187</p>

Byte [Электронный ресурс] www.umich.edu (дата обращения: 07.07.2022) URL: https://www.icpsr.umich.edu/web/ICPSR/cms/2042#B

<p>188</p>

CAFFE [Электронный ресурс] https://en.wikipedia.org URL: https://en.wikipedia.org/wiki/Caffe_(software) (дата обращения: 02.07.2023)

<p>189</p>

Среда CAFFE (сверточная архитектура для быстрого внедрения функций) [Электронный ресурс] https://ru.wikipedia.org URL: https://ru.wikipedia.org/wiki/Caffe (дата обращения: 02.07.2023)

<p>190</p>

Calibration layer [Электронный ресурс] https://developers.google.com URL: https://developers.google.com/machine-learning/glossary#iteration (дата обращения: 02.05.2023)

<p>191</p>

Candidate generation [Электронный ресурс] https://developers.google.com URL: https://developers.google.com/machine-learning/recommendation/overview/candidate-generation (дата обращения: 10.01.2022)

<p>192</p>

Candidate sampling [Электронный ресурс] https://developers.google.com URL: https://developers.google.com/machine-learning/glossary#candidate-sampling (дата обращения: 28.03.2023)

<p>193</p>

Canonical Formats [Электронный ресурс] www.umich.edu URL: https://www.icpsr.umich.edu/web/ICPSR/cms/2042#C (дата обращения: 07.07.2022)

<p>194</p>

Capsule neural network [Электронный ресурс] https://ru.what-this.com URL: https://ru.what-this.com/7202531/1/kapsulnaya-neyronnaya-set.html (дата обращения: 07.02.2022)

<p>195</p>

Capsule neural network [Электронный ресурс] https://neurohive.io URL: https://neurohive.io/ru/osnovy-data-science/kapsulnaja-nejronnaja-set-capsnet/ (дата обращения: 08.02.2022)