Premium
A Maximum‐Entropy Based Heuristic for Density Estimation from Data in Histogram Form *
Author(s) -
Golany B.,
Phillips F. Y.
Publication year - 1990
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1990.tb01255.x
Subject(s) - histogram , computer science , entropy (arrow of time) , heuristic , data mining , variable (mathematics) , principle of maximum entropy , mathematics , artificial intelligence , image (mathematics) , mathematical analysis , physics , quantum mechanics
We look at a specific but pervasive problem in the use of secondary or published data in which the data are summarized in a histogram format, perhaps with additional mean or median information provided; two published sources yield histogram‐type summaries involving the same variable, but the two sources do not group the values of the variable the same way; the researcher wishes to answer a question using information from both data streams; and the original, detailed data underlying the published summary, which could give a better answer to the question, are unavailable. We review relevant aspects of maximum‐entropy (ME) estimation, and develop a heuristic for generating ME density estimates from data in histogram form when additional means and medians may be known. Application examples from several business and scientific areas illustrate the heuristic's use. Areas of application include business and social or market research, risk analysis, and individual risk profile analysis. Some instructional or classroom applications are possible as well.