![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Let be iid random variables with common density f. In this paper two algorithms for computing the maximum penalized likelihood estimate of f using the Good Gaskins first penalty function are presented. Some results of Monte Carlo Studies are also given.
†This work was based on the Ph.D. Thesis of the first author at Purdue University.
‡Research was partially supported by the NSF Grant MPS74-07836A01.
†This work was based on the Ph.D. Thesis of the first author at Purdue University.
‡Research was partially supported by the NSF Grant MPS74-07836A01.
Notes
†This work was based on the Ph.D. Thesis of the first author at Purdue University.
‡Research was partially supported by the NSF Grant MPS74-07836A01.