"epsilon-machine" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "epsilon",
        "3": "machine"
      },
      "expansion": "epsilon + machine",
      "name": "af"
    }
  ],
  "etymology_text": "epsilon + machine. Coined by James Crutchfield and Karl Young in their 1989 paper “Inferring Statistical Complexity”.",
  "forms": [
    {
      "form": "epsilon-machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "epsilon-machine (plural epsilon-machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1989, James Crutchfield, Karl Young, Inferring Statistical Complexity",
          "text": "With a direct measure of an ε-machine’s complexity, the theory gives a computation-theoretic foundation to the notions of model optimality and, most importantly, a measure of the computational complexity of estimated models.",
          "type": "quotation"
        },
        {
          "ref": "2001, Cosma Rohilla Shalizi, Causal Architecture, Complexity and Self-Organization in Time Series and Cellular Automata",
          "text": "The ϵ-machine is the organization of the process, or at least of the part of it which is relevant to our measurements. It leads to a natural measure of the statistical complexity of processes, namely the amount of information needed to specify the state of the ϵ-machine. […] Using the ϵ-machine, we see that the causal states always form a Markov process. This is satisfying ideologically, and has interesting information-theoretic and ergodic consequences.",
          "type": "quotation"
        },
        {
          "ref": "2010, Sean Harrison Whalen, Security applications of the epsilon-machine, abstract",
          "text": "These predictors, called ε-machines, are a subset of a well known statistical model class called the Hidden Markov Model (HMM). Despite being a subset, ε-machines have several important advantages over traditional HMMs. This dissertation illustrates these advantages by applying ε-machines to several problems in computer security: anomaly-based intrusion detection in High Performance Computing (HPC) environments, automated protocol reverse engineering, and structural drift.",
          "type": "quotation"
        },
        {
          "ref": "2011, Nicolas Brodu, “Reconstruction of epsilon-machines in predictive frameworks and decisional states”, in Advances in Complex Systems, volume 14, number 05",
          "text": "This article introduces both a new algorithm for reconstructing epsilon-machines from data, as well as the decisional states. These are defined as the internal states of a system that lead to the same decision, based on a user-provided utility or pay-off function. […] The intrinsic underlying structure of the system is modeled by an epsilon-machine and its causal states.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A deterministic automaton consisting of a system of causal states and the transitions between them, functioning as the smallest possible maximally predictive model of a stochastic process"
      ],
      "id": "en-epsilon-machine-en-noun-lYLwI3J4",
      "links": [
        [
          "deterministic",
          "deterministic"
        ],
        [
          "automaton",
          "automaton"
        ],
        [
          "consist",
          "consist"
        ],
        [
          "system",
          "system"
        ],
        [
          "causal state",
          "causal state"
        ],
        [
          "transition",
          "transition"
        ],
        [
          "maximally",
          "maximally"
        ],
        [
          "predictive",
          "predictive"
        ],
        [
          "model",
          "model"
        ],
        [
          "stochastic",
          "stochastic"
        ],
        [
          "process",
          "process"
        ]
      ],
      "raw_glosses": [
        "(computational mechanics) A deterministic automaton consisting of a system of causal states and the transitions between them, functioning as the smallest possible maximally predictive model of a stochastic process"
      ],
      "synonyms": [
        {
          "word": "ϵ-machine"
        },
        {
          "word": "ε-machine"
        }
      ],
      "topics": [
        "computational",
        "computing",
        "engineering",
        "mathematics",
        "mechanical-engineering",
        "mechanics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "epsilon-machine"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "epsilon",
        "3": "machine"
      },
      "expansion": "epsilon + machine",
      "name": "af"
    }
  ],
  "etymology_text": "epsilon + machine. Coined by James Crutchfield and Karl Young in their 1989 paper “Inferring Statistical Complexity”.",
  "forms": [
    {
      "form": "epsilon-machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "epsilon-machine (plural epsilon-machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English compound terms",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "Quotation templates to be cleaned"
      ],
      "examples": [
        {
          "ref": "1989, James Crutchfield, Karl Young, Inferring Statistical Complexity",
          "text": "With a direct measure of an ε-machine’s complexity, the theory gives a computation-theoretic foundation to the notions of model optimality and, most importantly, a measure of the computational complexity of estimated models.",
          "type": "quotation"
        },
        {
          "ref": "2001, Cosma Rohilla Shalizi, Causal Architecture, Complexity and Self-Organization in Time Series and Cellular Automata",
          "text": "The ϵ-machine is the organization of the process, or at least of the part of it which is relevant to our measurements. It leads to a natural measure of the statistical complexity of processes, namely the amount of information needed to specify the state of the ϵ-machine. […] Using the ϵ-machine, we see that the causal states always form a Markov process. This is satisfying ideologically, and has interesting information-theoretic and ergodic consequences.",
          "type": "quotation"
        },
        {
          "ref": "2010, Sean Harrison Whalen, Security applications of the epsilon-machine, abstract",
          "text": "These predictors, called ε-machines, are a subset of a well known statistical model class called the Hidden Markov Model (HMM). Despite being a subset, ε-machines have several important advantages over traditional HMMs. This dissertation illustrates these advantages by applying ε-machines to several problems in computer security: anomaly-based intrusion detection in High Performance Computing (HPC) environments, automated protocol reverse engineering, and structural drift.",
          "type": "quotation"
        },
        {
          "ref": "2011, Nicolas Brodu, “Reconstruction of epsilon-machines in predictive frameworks and decisional states”, in Advances in Complex Systems, volume 14, number 05",
          "text": "This article introduces both a new algorithm for reconstructing epsilon-machines from data, as well as the decisional states. These are defined as the internal states of a system that lead to the same decision, based on a user-provided utility or pay-off function. […] The intrinsic underlying structure of the system is modeled by an epsilon-machine and its causal states.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A deterministic automaton consisting of a system of causal states and the transitions between them, functioning as the smallest possible maximally predictive model of a stochastic process"
      ],
      "links": [
        [
          "deterministic",
          "deterministic"
        ],
        [
          "automaton",
          "automaton"
        ],
        [
          "consist",
          "consist"
        ],
        [
          "system",
          "system"
        ],
        [
          "causal state",
          "causal state"
        ],
        [
          "transition",
          "transition"
        ],
        [
          "maximally",
          "maximally"
        ],
        [
          "predictive",
          "predictive"
        ],
        [
          "model",
          "model"
        ],
        [
          "stochastic",
          "stochastic"
        ],
        [
          "process",
          "process"
        ]
      ],
      "raw_glosses": [
        "(computational mechanics) A deterministic automaton consisting of a system of causal states and the transitions between them, functioning as the smallest possible maximally predictive model of a stochastic process"
      ],
      "topics": [
        "computational",
        "computing",
        "engineering",
        "mathematics",
        "mechanical-engineering",
        "mechanics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "ϵ-machine"
    },
    {
      "word": "ε-machine"
    }
  ],
  "word": "epsilon-machine"
}