Bridges between deterministic and probabilistic models for binary data

اسناد مشابه

• Bridges between deterministic and probabilistic models for binary data

  سند علمی۲۰۰۰Andrew Gelman, Iwin Leenen, Iven Van Mechelen, Paul De Boeck

  For the analysis of binary data, various deterministic models have been proposed, which are generally simpler to fit and easier to understand than probabilistic models. We claim that corresponding to any deterministic model is an implicit stochastic model in which the determinist

• Deterministic-Probabilistic Models For Partially Observable Reinforcement Learning Problems

  سند علمی۲۰۱۰M. M. Hassan Mahmud, John W. Lloyd

  In this paper we consider learning the environment model in reinforcement learning tasks where the environment cannot be fully observed. The most popular frameworks for environment modeling are POMDPs and PSRs but they are considered difficult to learn. We propose to bypass this

• Probabilistic Modeling of Data Structures

  سند علمی۲۰۰۷Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski

  Professor Arne Andersson's Letter-to-the-Editor concerning our paper \On the Balance Property of Patricia Tries: External Path Length Viewpoint" Theor. Comp. Sci., 68, 1989 motivated us to present some thoughts about probabilistic analysis of data structures on words. The intenti

• Assessment of Different Link Functions for Modeling Binary Data to Derive Sound Inferences and Predictions

  سند علمی۲۰۰۳ICCSAFalk Huettmann, Julia Linke

  Binary data are widely used for spatial modeling and when inferences and predictions are to be derived. If a Generalized Linear Model (GLM) is applied, logit functions are often used. Here we show alternatives to the traditional logit approach using probit and the complementary l

• Unsupervised Multi-Level Non-Negative Matrix Factorization Model: Binary Data Case

  سند علمی۲۰۱۲J. Information SecurityQingquan Sun, Peng Wu, Yeqing Wu, Mengcheng Guo

  Rank determination issue is one of the most significant issues in non-negative matrix factorization (NMF) research. However, rank determination problem has not received so much emphasis as sparseness regularization problem. Usually, the rank of base matrix needs to be assumed. In

• Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model

  سند علمی۲۰۱۳SODARalph Neininger, Kevin Leckey, Wojciech Szpankowski

  Tries are among the most versatile and widely used data structures on words. They are pertinent to the (internal) structure of (stored) words and several splitting procedures used in diverse contexts ranging from document taxonomy to IP addresses lookup, from data compression (i.