Mixture Failure Rate: A Study Based on Cross-entropy and MCMC Method

被引:0
|
作者
Tien Thanh Thach [1 ]
Bris, Radim [1 ]
Coolen, Frank P. A. [2 ]
机构
[1] VSB Tech Univ Ostrava, Dept Appl Math, Ostrava, Czech Republic
[2] Univ Durham, Dept Math Sci, Durham, England
关键词
Failure time distribution; failure rate; Markov chain Monte Carlo; Metropolis-Hastings algorithm; maximum likelihood estimation; Cross-Entropy algorithm; LIFE DISTRIBUTIONS; RELIABILITY; PARAMETERS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, the parameters and reliability characteristics of the mixture of the failure time distribution are estimated based on a complete sample using both Markov chain Monte Carlo (MCMC) method and maximum likelihood estimation via cross-entropy (CE) algorithm. While maximum likelihood estimation is the most frequently used method for parameter estimation, MCMC has recently emerged as a good alternative. The most popular MCMC method, called the Metropolis-Hastings algorithm, is used to provide a complete analysis of the concerned posterior distribution. A simulation study is provided to compare MCMC with CE, and differences between the estimates obtained by the two approaches are evaluated.
引用
收藏
页码:373 / 382
页数:10
相关论文
共 50 条
  • [41] Application of the Cross-Entropy Method to Electromagnetic Optimisation Problems
    Kovaleva, Maria
    Bulger, David
    Khokle, Rajas P.
    Esselle, Karu P.
    2018 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM ON ANTENNAS AND PROPAGATION & USNC/URSI NATIONAL RADIO SCIENCE MEETING, 2018, : 1595 - 1596
  • [42] Sparse Antenna Array Optimization With the Cross-Entropy Method
    Minvielle, Pierre
    Tantar, Emilia
    Tantar, Alexandru-Adrian
    Berisset, Philippe
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2011, 59 (08) : 2862 - 2871
  • [43] The Cross-Entropy Method for Policy Search in Decentralized POMDPs
    Oliehoek, Frans A.
    Kooij, Julian F. P.
    Vlassis, Nikos
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2008, 32 (04): : 341 - 357
  • [44] Vehicle routing problem with stochastic customers and demands based on the cross-entropy method
    Lou, Shan-Zuo
    Shi, Zhong-Ke
    Kongzhi yu Juece/Control and Decision, 2007, 22 (01): : 7 - 10
  • [45] A Cross-Entropy Based Feature Selection Method for Binary Valued Data Classification
    Wang, Zhipeng
    Zhu, Qiuming
    INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, ISDA 2021, 2022, 418 : 1406 - 1416
  • [46] Convergence properties of the cross-entropy method for discrete optimization
    Costa, Andre
    Jones, Owen Dafydd
    Kroese, Dirk
    OPERATIONS RESEARCH LETTERS, 2007, 35 (05) : 573 - 580
  • [47] Cross-Entropy Method for Design and Optimization of Pixelated Metasurfaces
    Kovaleva, Maria
    Bulger, David
    Esselle, Karu P.
    IEEE ACCESS, 2020, 8 (08): : 224922 - 224931
  • [48] Solving the Multidimensional Assignment Problem by a Cross-Entropy method
    Duc Manh Nguyen
    Hoai An Le Thi
    Tao Pham Dinh
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (04) : 808 - 823
  • [49] The Cross-Entropy Method and Its Application to Inverse Problems
    Ho, S. L.
    Yang, Shiyou
    IEEE TRANSACTIONS ON MAGNETICS, 2010, 46 (08) : 3401 - 3404
  • [50] Cooperative Cross-Entropy method for generating entangled networks
    Kin-Ping Hui
    Annals of Operations Research, 2011, 189 : 205 - 214