| dc.contributor | 國立政治大學統計學系 | en_US |
| dc.contributor | 行政院國家科學委員會 | en_US |
| dc.creator (作者) | 洪英超 | zh_TW |
| dc.date (日期) | 2008 | en_US |
| dc.date.accessioned | 30-Aug-2012 09:59:43 (UTC+8) | - |
| dc.date.available | 30-Aug-2012 09:59:43 (UTC+8) | - |
| dc.date.issued (上傳時間) | 30-Aug-2012 09:59:43 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/53418 | - |
| dc.description.abstract (摘要) | 本計畫首先研究由Kennedy所提出一產生(近似)貝他分配的隨機搜尋方法。其目的是找出一組最佳參數設定使Kennedy的演算法在一給定的容忍範圍內有最快的平均收歛速度。透過以下的表現值: (i)可生成的貝他分配參數範圍; (ii) 生成時間; (iii) Kolmogorov-Smirnov統計量; 及 (iv) 平均所需亂數生成數; 我們接著評估一些常用的貝他分配生成演算法。根據評估的結果，我們將提供一如何選擇最適當貝他分配生成演算法的指導方針。 | - |
| dc.description.abstract (摘要) | In this project, we provide an overview of well-known beta algorithms. We first study a stochastic search procedure proposed by Kennedy (1988) that asymptotically generates a beta variate. The goal is to identify the optimal parameter setting so that Kennedy‘s algorithm can achieve the fastest speed of generation. For comparative purposes, we next evaluate the performance of some selected beta algorithms in terms of the following criteria: (i) validity of choice of shape parameters, (ii) computer generation time, (iii) initial set-up time, (iv) goodness-of-fit, and (v) amount of random number generation required. Based on the empirical study, we present three useful guidelines for choosing the best suited beta algorithm. | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | 學術補助 | en_US |
| dc.relation (關聯) | 研究期間:9708~ 9809 | en_US |
| dc.relation (關聯) | 研究經費:331仟元 | en_US |
| dc.subject (關鍵詞) | 統計;貝他分配演算法;評估 | en_US |
| dc.title (題名) | 貝他分配演算法之評估 | zh_TW |
| dc.title.alternative (其他題名) | Evaluation of Algorithms for Generating Beta Variates | - |
| dc.type (資料類型) | report | en |
