Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Conceptual framework  





2 Model estimation  



2.1  Maximum likelihood estimation  





2.2  Berkson's minimum chi-square method  





2.3  Gibbs sampling  







3 Model evaluation  





4 Performance under misspecification  





5 History  





6 See also  





7 References  





8 Further reading  





9 External links  














Probit model






Català
Deutsch
Español
Français

Italiano
Русский
 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 




In other projects  



Wikimedia Commons
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 

(Redirected from Probit analysis)

Instatistics, a probit model is a type of regression where the dependent variable can take only two values, for example married or not married. The word is a portmanteau, coming from probability + unit.[1] The purpose of the model is to estimate the probability that an observation with particular characteristics will fall into a specific one of the categories; moreover, classifying observations based on their predicted probabilities is a type of binary classification model.

Aprobit model is a popular specification for a binary response model. As such it treats the same set of problems as does logistic regression using similar techniques. When viewed in the generalized linear model framework, the probit model employs a probit link function.[2] It is most often estimated using the maximum likelihood procedure,[3] such an estimation being called a probit regression.

Conceptual framework[edit]

Suppose a response variable Yisbinary, that is it can have only two possible outcomes which we will denote as 1 and 0. For example, Y may represent presence/absence of a certain condition, success/failure of some device, answer yes/no on a survey, etc. We also have a vector of regressors X, which are assumed to influence the outcome Y. Specifically, we assume that the model takes the form

where P is the probability and is the cumulative distribution function (CDF) of the standard normal distribution. The parameters β are typically estimated by maximum likelihood.

It is possible to motivate the probit model as a latent variable model. Suppose there exists an auxiliary random variable

where ε ~ N(0, 1). Then Y can be viewed as an indicator for whether this latent variable is positive:

The use of the standard normal distribution causes no loss of generality compared with the use of a normal distribution with an arbitrary mean and standard deviation, because adding a fixed amount to the mean can be compensated by subtracting the same amount from the intercept, and multiplying the standard deviation by a fixed amount can be compensated by multiplying the weights by the same amount.

To see that the two models are equivalent, note that

Model estimation[edit]

Maximum likelihood estimation[edit]

Suppose data set contains n independent statistical units corresponding to the model above.

For the single observation, conditional on the vector of inputs of that observation, we have:

[clarification needed]

where is a vector of inputs, and is a vector of coefficients.

The likelihood of a single observation is then

In fact, if , then , and if , then .

Since the observations are independent and identically distributed, then the likelihood of the entire sample, or the joint likelihood, will be equal to the product of the likelihoods of the single observations:

The joint log-likelihood function is thus

The estimator which maximizes this function will be consistent, asymptotically normal and efficient provided that exists and is not singular. It can be shown that this log-likelihood function is globally concavein, and therefore standard numerical algorithms for optimization will converge rapidly to the unique maximum.

Asymptotic distribution for is given by

where

[citation needed]

and is the Probability Density Function (PDF) of standard normal distribution.

Semi-parametric and non-parametric maximum likelihood methods for probit-type and other related models are also available.[4]

Berkson's minimum chi-square method[edit]

This method can be applied only when there are many observations of response variable having the same value of the vector of regressors (such situation may be referred to as "many observations per cell"). More specifically, the model can be formulated as follows.

Suppose among n observations there are only T distinct values of the regressors, which can be denoted as . Let be the number of observations with and the number of such observations with . We assume that there are indeed "many" observations per each "cell": for each .

Denote

Then Berkson's minimum chi-square estimator is a generalized least squares estimator in a regression of on with weights :

It can be shown that this estimator is consistent (asn→∞ and T fixed), asymptotically normal and efficient.[citation needed] Its advantage is the presence of a closed-form formula for the estimator. However, it is only meaningful to carry out this analysis when individual observations are not available, only their aggregated counts , , and (for example in the analysis of voting behavior).

Gibbs sampling[edit]

Gibbs sampling of a probit model is possible because regression models typically use normal prior distributions over the weights, and this distribution is conjugate with the normal distribution of the errors (and hence of the latent variables Y*). The model can be described as

From this, we can determine the full conditional densities needed:

The result for is given in the article on Bayesian linear regression, although specified with different notation.

The only trickiness is in the last two equations. The notation is the Iverson bracket, sometimes written or similar. It indicates that the distribution must be truncated within the given range, and rescaled appropriately. In this particular case, a truncated normal distribution arises. Sampling from this distribution depends on how much is truncated. If a large fraction of the original mass remains, sampling can be easily done with rejection sampling—simply sample a number from the non-truncated distribution, and reject it if it falls outside the restriction imposed by the truncation. If sampling from only a small fraction of the original mass, however (e.g. if sampling from one of the tails of the normal distribution—for example if is around 3 or more, and a negative sample is desired), then this will be inefficient and it becomes necessary to fall back on other sampling algorithms. General sampling from the truncated normal can be achieved using approximations to the normal CDF and the probit function, and R has a function rtnorm() for generating truncated-normal samples.

Model evaluation[edit]

The suitability of an estimated binary model can be evaluated by counting the number of true observations equaling 1, and the number equaling zero, for which the model assigns a correct predicted classification by treating any estimated probability above 1/2 (or, below 1/2), as an assignment of a prediction of 1 (or, of 0). See Logistic regression § Model for details.

Performance under misspecification[edit]

Consider the latent variable model formulation of the probit model. When the varianceof conditional on is not constant but dependent on , then the heteroscedasticity issue arises. For example, suppose and where is a continuous positive explanatory variable. Under heteroskedasticity, the probit estimator for is usually inconsistent, and most of the tests about the coefficients are invalid. More importantly, the estimator for becomes inconsistent, too. To deal with this problem, the original model needs to be transformed to be homoskedastic. For instance, in the same example, can be rewritten as , where . Therefore, and running probit on generates a consistent estimator for the conditional probability

When the assumption that is normally distributed fails to hold, then a functional form misspecification issue arises: if the model is still estimated as a probit model, the estimators of the coefficients are inconsistent. For instance, if follows a logistic distribution in the true model, but the model is estimated by probit, the estimates will be generally smaller than the true value. However, the inconsistency of the coefficient estimates is practically irrelevant because the estimates for the partial effects, , will be close to the estimates given by the true logit model.[5]

To avoid the issue of distribution misspecification, one may adopt a general distribution assumption for the error term, such that many different types of distribution can be included in the model. The cost is heavier computation and lower accuracy for the increase of the number of parameter.[6] In most of the cases in practice where the distribution form is misspecified, the estimators for the coefficients are inconsistent, but estimators for the conditional probability and the partial effects are still very good.[citation needed]

One can also take semi-parametric or non-parametric approaches, e.g., via local-likelihood or nonparametric quasi-likelihood methods, which avoid assumptions on a parametric form for the index function and is robust to the choice of the link function (e.g., probit or logit).[4]

History[edit]

The probit model is usually credited to Chester Bliss, who coined the term "probit" in 1934,[7] and to John Gaddum (1933), who systematized earlier work.[8] However, the basic model dates to the Weber–Fechner lawbyGustav Fechner, published in Fechner (1860), and was repeatedly rediscovered until the 1930s; see Finney (1971, Chapter 3.6) and Aitchison & Brown (1957, Chapter 1.2).[8]

A fast method for computing maximum likelihood estimates for the probit model was proposed by Ronald Fisher as an appendix to Bliss' work in 1935.[9]

See also[edit]

References[edit]

  1. ^ Oxford English Dictionary, 3rd ed. s.v. probit (article dated June 2007): Bliss, C. I. (1934). "The Method of Probits". Science. 79 (2037): 38–39. Bibcode:1934Sci....79...38B. doi:10.1126/science.79.2037.38. PMID 17813446. These arbitrary probability units have been called 'probits'.
  • ^ Agresti, Alan (2015). Foundations of Linear and Generalized Linear Models. New York: Wiley. pp. 183–186. ISBN 978-1-118-73003-4.
  • ^ Aldrich, John H.; Nelson, Forrest D.; Adler, E. Scott (1984). Linear Probability, Logit, and Probit Models. Sage. pp. 48–65. ISBN 0-8039-2133-0.
  • ^ a b Park, Byeong U.; Simar, Léopold; Zelenyuk, Valentin (2017). "Nonparametric estimation of dynamic discrete choice models for time series data" (PDF). Computational Statistics & Data Analysis. 108: 97–120. doi:10.1016/j.csda.2016.10.024.
  • ^ Greene, W. H. (2003), Econometric Analysis, Prentice Hall, Upper Saddle River, NJ.
  • ^ For more details, refer to: Cappé, O., Moulines, E. and Ryden, T. (2005): "Inference in Hidden Markov Models", Springer-Verlag New York, Chapter 2.
  • ^ Bliss, C. I. (1934). "The Method of Probits". Science. 79 (2037): 38–39. Bibcode:1934Sci....79...38B. doi:10.1126/science.79.2037.38. PMID 17813446.
  • ^ a b Cramer 2002, p. 7.
  • ^ Fisher, R. A. (1935). "The Case of Zero Survivors in Probit Assays". Annals of Applied Biology. 22: 164–165. doi:10.1111/j.1744-7348.1935.tb07713.x. Archived from the original on 2014-04-30.
  • Cramer, J. S. (2002). The origins of logistic regression (PDF) (Technical report). Vol. 119. Tinbergen Institute. pp. 167–178. doi:10.2139/ssrn.360300.
    • Published in: Cramer, J. S. (2004). "The early origins of the logit model". Studies in History and Philosophy of Science Part C: Studies in History and Philosophy of Biological and Biomedical Sciences. 35 (4): 613–626. doi:10.1016/j.shpsc.2004.09.003.
  • Fechner, Gustav Theodor (1860). Elemente der Psychophysik [Elements of psychophysics]. Vol. band 2. Leipzig: Breitkopf und Härtel.
  • Finney, D. J. (1971). Probit analysis.
  • Further reading[edit]

    External links[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Probit_model&oldid=1219478579"

    Categories: 
    Categorical regression models
    Classification algorithms
    Hidden categories: 
    Articles with short description
    Short description is different from Wikidata
    Wikipedia articles needing clarification from April 2019
    All articles with unsourced statements
    Articles with unsourced statements from October 2023
    Articles with unsourced statements from August 2009
    Articles needing cleanup from June 2019
    All pages needing cleanup
    Cleanup tagged articles with a reason field from June 2019
    Wikipedia pages needing cleanup from June 2019
    Articles with unsourced statements from June 2019
    CS1: long volume value
    Commons category link from Wikidata
    Articles with FAST identifiers
    Articles with BNF identifiers
    Articles with BNFdata identifiers
    Articles with GND identifiers
    Articles with J9U identifiers
    Articles with LCCN identifiers
     



    This page was last edited on 18 April 2024, at 00:39 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki