A Novel Bayes Factor for Inverse Model Selection Problem based on Inverse Reference Distribution
Journal Title: International Journal of Mathematics and Statistics Invention - Year 2017, Vol 5, Issue 6
Abstract
Statistical model selection problem can be divided into two broad categories based on Forward and Inverse problem. Compared to a wealthy of literature available for Forward model selection, there are very few methods applicable for Inverse model selection context. In this article we propose a novel Bayes factor for model selection in Bayesian Inverse Problem context. The proposed Bayes Factor is specially designed for Inverse problem with the help of Inverse Reference Distribution (IRD). We will discuss our proposal from decision theoretic perspective.
Authors and Affiliations
Debashis Chatterjee
Keywords
Related Articles
- EP ID EP406676
- DOI -
- Views 152
- Downloads 0
Enhancing the Mean Ratio Estimator for Estimating Population Mean Using Conventional Parameters
Use of auxilliary information in survey sampling has its eminent role in estimating the population parameters with greater precision. The present paper concentrates on estimating the finite population mean by proposing t...
The Schur Complement of Gyroscopically Stabilized Quadratic Pencils
In this paper we consider a taking advantage of the Schur complement of gyroscopically stabilized quadratic pencils. All eigenvalues of the gyroscopically stabilized quadratic problems are real and lying in four disjoint...
Shift Strategy for Gyroscopically Stabilized Quadratic Systems
In this paper we consider a special class of the quadratic eigenvalue problems, gyroscopically stabilized quadratic problems. All eigenvalue of the gyroscopically stabilized quadratic problems are real and lying in four...
Statistical Modelling For Heterogeneous Dataset
Statistical modelling is of prime importance in each and every sphere of data analysis. This paper reviews the justification of fitting linear model to the collected data. Inappropriateness of the fitted model may be due...
A Comparative Analysis Between 0-1 Knapsack Problem And Travelling Salesman Problem
Travelling Salesman Problem (TSP), need to locate a base stage of all the vertices in the chart and in Shortest Paths issue there is no compelling reason to consider all the vertices we can scan the states space for leas...