425 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author김성욱-
dc.date.accessioned2019-10-23T01:47:53Z-
dc.date.available2019-10-23T01:47:53Z-
dc.date.issued2005-08-
dc.identifier.citationCSAM(Communications for Statistical Applications and Methods), v. 12, No. 2, Page. 483-496en_US
dc.identifier.issn2287-7843-
dc.identifier.urihttp://kiss.kstudy.com/thesis/thesis-view.asp?key=2462173-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/111403-
dc.description.abstractWe consider the power law process which is assumed to have multiple changepoints. We propose a binary segmentation procedure for locating all existing changepoints. We select one model between the no-changepoints model and the single changepoint model by the Bayes factor. We repeat this procedure until no more changepoints are found. Then we carry out a multiple test based on the Bayes factor through the intrinsic priors of Berger and Pericchi (1996) to investigate the system behaviour of failure times. We demonstrate our procedure with a real dataset and some simulated datasets.en_US
dc.language.isoen_USen_US
dc.publisher한국통계학회en_US
dc.subjectBinary segmentationen_US
dc.subjectChangepointen_US
dc.subjectModel selectionen_US
dc.subjectIntrinsic prioren_US
dc.subjectPower Law processen_US
dc.titleBayesian changepoints detection for the power law process with binary segmentation proceduresen_US
dc.typeArticleen_US
dc.relation.journal한국통계학회 논문집-
dc.contributor.googleauthorKim, Hyun Soo-
dc.contributor.googleauthorKim, Seong W.-
dc.contributor.googleauthorJang, Hak Jin-
dc.relation.code2012211008-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF SCIENCE AND CONVERGENCE TECHNOLOGY[E]-
dc.sector.departmentDEPARTMENT OF APPLIED MATHEMATICS-
dc.identifier.pidseong-
Appears in Collections:
COLLEGE OF SCIENCE AND CONVERGENCE TECHNOLOGY[E](과학기술융합대학) > APPLIED MATHEMATICS(응용수학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE