Modeling by shortest data description
From MaRDI portal
Publication:1132048
DOI10.1016/0005-1098(78)90005-5zbMath0418.93079OpenAlexW2054658115WikidataQ55966897 ScholiaQ55966897MaRDI QIDQ1132048
Publication date: 1978
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(78)90005-5
System identification (93B30) Estimation and detection in stochastic control theory (93E10) Identification in stochastic control theory (93E12)
Related Items (only showing first 100 items - show all)
Covariance estimation via fiducial inference ⋮ TGCnA: temporal gene coexpression network analysis using a low-rank plus sparse framework ⋮ The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework ⋮ Graph Summarization with Latent Variable Probabilistic Models ⋮ Piecewise FARIMA models for long-memory time series ⋮ Blockwise AICc and its consistency properties in model selection ⋮ On the selection of predictors by using greedy algorithms and information theoretic criteria ⋮ Three-way approximation of decision granules based on the rough set approach ⋮ A new data adaptive elastic net predictive model using hybridized smoothed covariance estimators with information complexity ⋮ User-friendly Introduction to PAC-Bayes Bounds ⋮ Distance‐based logistic model for cross‐classified categorical data ⋮ Unsupervised discretization by two-dimensional MDL-based histogram ⋮ Flexible Statistical Learning Model for Unsupervised Image Modeling and Segmentation ⋮ Minimum description length for selection of models of musical rhythm ⋮ Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) ⋮ Fast and fully-automated histograms for large-scale data sets ⋮ SMLSOM: the shrinking maximum likelihood self-organizing map ⋮ Some models are useful, but how do we know which ones? Towards a unified Bayesian model taxonomy ⋮ Learning the structure of Bayesian networks with ancestral and/or heuristic partition ⋮ Unnamed Item ⋮ Bayesian Model Search for Nonstationary Periodic Time Series ⋮ More on testing the normality assumptionin the Tobit Model ⋮ Software modules categorization through likelihood and bayesian analysis of finite dirichlet mixtures ⋮ Female athletic participation and income: evidence from a latent class model ⋮ M-estimator-based robust estimation of the number of components of a superimposed sinusoidal signal model ⋮ Identifying the number of components in Gaussian mixture models using numerical algebraic geometry ⋮ Mixture Modeling with Pairwise, Instance-Level Class Constraints ⋮ Security analysis of the decoy method with the Bennett–Brassard 1984 protocol for finite key lengths ⋮ A mathematical theory of computational resolution limit in multi-dimensional spaces * ⋮ Configuration complexity assessment of convergent supply chain systems ⋮ Sign and rank covariance matrices ⋮ Statistical theory of shape under elliptical models via QR decomposition ⋮ Consistent model and moment selection procedures for GMM estimation with application to dynamic panel data models ⋮ Population sizing for inductive linkage identification ⋮ Data mining in brain imaging ⋮ Explanatory and creative alternatives to the MDL principle ⋮ A new method for sparsity control in support vector classification and regression ⋮ An investigation of model selection criteria for neural network time series forecasting ⋮ Estimating the number of signals of the damped exponential models. ⋮ Stochastic complexity and the mdl principle ⋮ Order estimation for subspace methods ⋮ Differential equations as deterministic models in science and technology Part II: Simulation ⋮ Density estimation with quadratic loss: a confidence intervals method ⋮ Methods for Modal Model Quality Improvement — Parameter Estimation Process (part II) ⋮ Discovering unbounded unions of regular pattern languages from positive examples ⋮ Shape Modeling by Optimising Description Length Using Gradients and Parameterisation Invariance ⋮ Free deterministic equivalent Z-scores of compound Wishart models: A goodness of fit test of 2D ARMA models ⋮ PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification ⋮ PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification ⋮ Philosophical issues in Kolmogorov complexity ⋮ Summarizing and understanding large graphs ⋮ Structural changes estimation for strongly dependent processes ⋮ Model selection with misspecified spatial covariance structure ⋮ Model selection for hybrid dynamical systems via sparse regression ⋮ Rethinking arithmetic for deep neural networks ⋮ Minimum description length revisited ⋮ Rough Sets: From Rudiments to Challenges ⋮ Unnamed Item ⋮ Generic Constraint-based Block Modeling using Constraint Programming ⋮ A Quantile‐based Test for Symmetry of Weakly Dependent Processes ⋮ Bayesian Identification of Seasonal Multivariate Autoregressive Processes ⋮ Learning causal Bayesian networks using minimum free energy principle ⋮ Learning tractable NAT-modeled Bayesian networks ⋮ Testing causality using efficiently parametrized vector ARMA models ⋮ A time series model for an exchange rate in a target zone with applications ⋮ Application of the evidence procedure to the estimation of wireless channels ⋮ Bayes factors, relations to minimum description length, and overlapping model classes ⋮ Model order selection for short data: an exponential fitting test (EFT) ⋮ Tracking signal subspace invariance for blind separation and classification of nonorthogonal sources in correlated noise ⋮ Subspace-based localization and inverse scattering of multiply scattering point targets ⋮ A review of signal subspace speech enhancement and its application to noise robust speech recognition ⋮ New approaches for channel prediction based on sinusoidal modeling ⋮ Model selection and Akaike's information criterion (AIC): The general theory and its analytical extensions ⋮ An information theoretic approach to pedigree reconstruction ⋮ High-resolution cross-estimation channel modelling method and experimental results on broadband mobile communication in urban rich-scattering environment ⋮ Mathematical analysis of an extended Mumford-Shah model for image segmentation ⋮ Maximum likelihood robust regression by mixture models ⋮ Classification using hierarchical naïve Bayes models ⋮ The max-min hill-climbing Bayesian network structure learning algorithm ⋮ MODL: a Bayes optimal discretization method for continuous attributes ⋮ Learning decomposable Markov networks in pseudo-independent domains with local evaluation ⋮ On model order estimation for partially observed Markov chains ⋮ Quantifying inductive bias: AI learning algorithms and Valiant's learning framework ⋮ Signal extraction and knowledge discovery based on statistical modeling ⋮ A comparative investigation on model selection in independent factor analysis ⋮ Rudiments of rough sets ⋮ Inferring decision trees using the minimum description length principle ⋮ Nonstationary time series identification ⋮ Generalised shape theory via pseudo-Wishart distribution ⋮ Hypotheses for image features, icons and textons ⋮ Effects of skewness and kurtosis on model selection criteria ⋮ Multiple appearance models ⋮ A graphical approach to relatedness inference ⋮ Simultaneous confidence bands for sequential autoregressive fitting ⋮ Inference in affine shape theory under elliptical models ⋮ Model selection in multivariate adaptive regression splines (MARS) using information complexity as the fitness function ⋮ Testing order constraints: qualitative differences between Bayes factors and normalized maximum likelihood ⋮ Survey on speech emotion recognition: features, classification schemes, and databases ⋮ Krimp: mining itemsets that compress ⋮ Mathematical issues in the inference of causal interactions among multichannel neural signals
Cites Work
This page was built for publication: Modeling by shortest data description
