Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/5573
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZ. Nurul Hila-
dc.contributor.authorL. Muhamad Safiih-
dc.date.accessioned2017-04-10T07:32:09Z-
dc.date.available2017-04-10T07:32:09Z-
dc.date.issued2016-08-
dc.identifier.citationVol. 11, No. 17en_US
dc.identifier.urihttp://hdl.handle.net/123456789/5573-
dc.description.abstractThe basis idea of double bootstrap is using iteration procedure in the set sample of first bootstrap. The iteration seems to consume a period of time in completing all steps of double bootstrap algorithm and could delaying interested estimation such as accuracy estimation. To overcome this problem, an alternative of double bootstrap is proposed in this research. Instead of using iteration, generally, the procedure is to repeat the whole algorithm of single bootstrap in resulting a sample of double bootstrap. In terms of accuracy, this research constructs two double bootstrap intervals and estimates the coverage rate and its length. The procedure of double bootstrap and its accuracy estimation apply in simulation study. The result shows double bootstrap intervals have the same coverage with nominal rate and gives shorter length when comparing with single bootstrap intervals. Thus, the proposed double bootstrap has given an accuracy estimation and not complex to be used in simulation study.en_US
dc.language.isoenen_US
dc.publisherInternational Mathematical Forumen_US
dc.subjectDouble bootstrap intervalsen_US
dc.subjectCoverage rateen_US
dc.subjectLength of intervalsen_US
dc.titleThe Accuracy of Two-sided Confidence Interval Algorithmen_US
dc.title.alternativeAn Alternative of Double Bootstrap Approachen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
126-The accuracy of two-sided confidence interval algorithm An alternative of double bootstrap.pdfFull Text File357.09 kBAdobe PDFView/Open


Items in UMT-IR are protected by copyright, with all rights reserved, unless otherwise indicated.