- statistical algorithm
- мат. статистический алгоритм
Большой англо-русский и русско-английский словарь. 2001.
statistical algorithm
Смотреть что такое "statistical algorithm" в других словарях:
Statistical Lempel Ziv — is a concept of lossless data compression technique published by Dr. Sam Kwong and Yu Fan Ho in 2001.[1] It may be viewed as a variant of the Lempel Ziv (LZ) based method. The contribution of this concept is to include the statistical properties… … Wikipedia
Statistical parsing — is a group of parsing methods within natural language processing. The methods have in common that they associate grammar rules with a probability. Grammar rules are traditionally viewed in computational linguistics as defining the valid sentences … Wikipedia
Statistical learning theory — is an ambiguous term.#It may refer to computational learning theory, which is a sub field of theoretical computer science that studies how algorithms can learn from data. #It may refer to Vapnik Chervonenkis theory, which is a specific approach… … Wikipedia
Statistical static timing analysis — Conventional static timing analysis (STA) has been a stock analysis algorithm for the design of digital circuits over the last 30 years. However, in recent years the increased variation in semiconductor devices and interconnect has introduced a… … Wikipedia
Statistical classification — See also: Pattern recognition See also: Classification test In machine learning, statistical classification is the problem of identifying the sub population to which new observations belong, where the identity of the sub population is unknown, on … Wikipedia
Monte Carlo method in statistical physics — Monte Carlo in statistical physics refers to the application of the Monte Carlo method to problems in statistical physics, or statistical mechanics. Contents 1 Overview 2 Importance sampling 2.1 Canonical … Wikipedia
Expectation-maximization algorithm — An expectation maximization (EM) algorithm is used in statistics for finding maximum likelihood estimates of parameters in probabilistic models, where the model depends on unobserved latent variables. EM alternates between performing an… … Wikipedia
Metropolis–Hastings algorithm — The Proposal distribution Q proposes the next point that the random walk might move to. In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a… … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Baum-Welch algorithm — In computer science, statistical computing and bioinformatics, the Baum Welch algorithm is used to find the unknown parameters of a hidden Markov model (HMM). It makes use of the forward backward algorithm and is named for Leonard E. Baum and… … Wikipedia
Gibbs algorithm — In statistical mechanics, the Gibbs algorithm, first introduced by J. Willard Gibbs in 1878, is the injunction to choose a statistical ensemble (probability distribution) for the unknown microscopic state of a thermodynamic system by minimising… … Wikipedia
