4 research outputs found

    μˆœμ„œν˜• μžλ£Œμ—μ„œμ˜ μ œν•œλœ μ œν•œλœ μš°λ„λΉ„λ₯Ό μ΄μš©ν•œ 곡간 검색 ν†΅κ³„λŸ‰ 연ꡬ

    No full text
    Dept. of Biostatistics and Computing/석사Spatial scan statistics proposed by Kulldorff are widely used as a technique to detect geographical disease clusters for different types of data such as Bernoulli, Poisson, ordinal, normal, and survival. The spatial scan statistic for ordinal data can be used to detect clusters indicating areas with high rates of more serious stages compared with the surrounding areas. However, it has been pointed out that the Poisson-based spatial scan statistic tends to detect the most likely cluster much larger than the true cluster by absorbing insignificant neighbors with non-elevated risk. We suspect that the spatial scan statistic for ordinal data might also have the similar undesirable phenomena. Tango (2008) proposed to modify the spatial scan statistic using a restricted likelihood ratio for scanning only the regions with elevated risk. The method worked well for preventing over-detection but was evaluated only in the Poisson model. In this paper, we propose to apply a restricted likelihood ratio into two spatial scan statistics to circumvent such a phenomenon in ordinal outcome data. Through a simulation study we compare the performance of the proposed methods with original spatial scan statistics. We calculate sensitivity, positive predicted value (PPV), usual power and bivariate power distribution as performance measures. The simulation study results show that the proposed spatial scan statistics with a restricted likelihood ratio have a reasonable or better performance compared with original ones. The original methods for ordinal data tend to detect larger clusters than the true cluster, and our approach seems to reduce the undesirable property. We illustrate the proposed methods using a real data set of the 2014 Health Screening Program of Korea with the diagnosis results of normal, caution, suspected disease, and diagnosed with disease as an ordinal outcome. κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰(spatial scan statistic)은 μš°λ„λΉ„ 검정을 기반으둜 νŠΉμ • 사건에 λŒ€ν•œ 뢄포가 λ‹€λ₯Έ μ§€μ—­μ˜ 뢄포와 ν†΅κ³„μ μœΌλ‘œ μœ μ˜ν•˜κ²Œ λ‹€λ₯Έ 곡간ꡰ집(spatial cluster)을 νƒμƒ‰ν•˜λŠ” λ°©λ²•μœΌλ‘œ μ—¬λŸ¬ λΆ„μ•Όμ—μ„œ 이용되고 μžˆλ‹€. 이 방법은 μ—°κ΅¬μžκ°€ 사전에 각 μ§€μ—­μ˜ 쀑심점을 κΈ°μ€€μœΌλ‘œ ν˜•μ„±λ˜λŠ” 후보 ꡰ집(scanning window)의 λͺ¨μ–‘κ³Ό μ΅œλŒ€ ꡰ집 크기λ₯Ό μ„€μ •ν•œλ‹€. 후보 κ΅°μ§‘μ˜ λͺ¨μ–‘은 μ›ν˜•, νƒ€μ›ν˜•, λΉ„μ •ν˜•μ΄ 널리 μ‚¬μš©λ˜κ³ , μ΅œλŒ€ ꡰ집 ν¬κΈ°λŠ” 보톡 전체 인ꡬ의 50%둜 μ„€μ •ν•œλ‹€. Kulldorff (1997)에 μ˜ν•΄ μ œμ•ˆλœ κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰μ΄ ꡰ집 탐색을 μœ„ν•œ λ°©λ²•μœΌλ‘œ 널리 μ“°μ΄λ‚˜, 이 방법이 μ‹€μ œ ꡰ집보닀 더 넓은 λ²”μœ„μ˜ ꡰ집을 λ„μΆœν•œλ‹€λŠ” 것이 Tango (2007)에 μ˜ν•΄ μ•Œλ €μ‘Œλ‹€. Tango (2008)λŠ” λͺ¨μ˜μ‹€ν—˜μ„ ν†΅ν•˜μ—¬ 포아솑 기반의 κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰μ΄ μ‹€μ œ ꡰ집 μ£Όλ³€μ˜ μœ μ˜ν•˜μ§€ μ•ŠλŠ” 지역듀을 ν‘μˆ˜ν•¨μœΌλ‘œμ¨ 더 넓은 지역을 κ΅°μ§‘μœΌλ‘œ λ„μΆœν•œλ‹€λŠ” 사싀을 λ³΄μ˜€κ³ , 이에 λŒ€ν•œ ν•΄κ²°μ±…μœΌλ‘œ 포아솑 기반의 곡간검색 ν†΅κ³„λŸ‰μ— μ œν•œλœ μš°λ„λΉ„λ₯Ό μ μš©ν•¨μœΌλ‘œμ¨ μœ μ˜ν•˜μ§€ μ•ŠλŠ” 지역듀을 사전에 μ œκ±°ν•˜μ—¬ 관심 λŒ€μƒμ˜ 지역듀 만으둜 ꡰ집을 λ„μΆœν•˜λŠ” 방법을 μ œμ•ˆν•˜μ˜€λ‹€. Tango (2008)κ°€ μ œμ•ˆν•œ 방법이 기쑴의 방법보닀 μ‹€μ œ ꡰ집을 비ꡐ적 더 μ •ν™•νžˆ 찾아냄을 λͺ¨μ˜ μ‹€ν—˜μ„ 톡해 λ³΄μ˜€λ‹€. ν•œνŽΈ μˆœμ„œν˜• μžλ£ŒλŠ” μ§ˆλ³‘μ˜ 진행단계와 같은 μˆœμœ„ λ²”μ£Όλ₯Ό κ°€μ§€λŠ” 자료둜 μ˜ν•™ λΆ„μ•Όμ—μ„œ 빈번히 λ‚˜νƒ€λ‚œλ‹€. μ΄λŸ¬ν•œ 자료λ₯Ό μœ„ν•œ κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰μ€ λŒ€λ¦½κ°€μ„€μ— 따라 두 가지 방법이 Jung et al. (2007)κ³Ό Jung and Lee (2011)에 μ˜ν•΄ μ œμ•ˆλœ λ°”κ°€ 있으며, λ³Έ μ—°κ΅¬μ—μ„œλŠ” 이 κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰λ“€ λ˜ν•œ μœ„μ™€ 같은 ν˜„μƒμ„ 보일 것이라 μ˜ˆμƒν•œλ‹€. λ”°λΌμ„œ λ³Έ μ—°κ΅¬μ—μ„œλŠ” μˆœμ„œν˜• 자료λ₯Ό μœ„ν•œ κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰μ— μ œν•œλœ μš°λ„λΉ„λ₯Ό μ μš©ν•˜λŠ” λ°©μ•ˆμ„ μ œμ•ˆν•˜κ³ , λͺ¨μ˜μ‹€ν—˜μ„ ν†΅ν•˜μ—¬ 기쑴의 방법과 비ꡐ 및 평가해 보고자 ν•œλ‹€. κ·Έ κ²°κ³Ό, μˆœμ„œν˜• 자료λ₯Ό μœ„ν•œ 기쑴의 κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰μ΄ 우리의 μ˜ˆμƒκ³Ό 같이 μ‹€μ œ ꡰ집보닀 더 넓은 μ§€μ—­μ˜ ꡰ집을 λ„μΆœν•œλ‹€λŠ” 것이 λ°œκ²¬λ˜μ—ˆκ³ , μ œν•œλœ μš°λ„λΉ„λ₯Ό μ μš©ν•œ κ³΅κ°„κ²€μƒ‰ν†΅κ³„λŸ‰ 방법이 μ΄λŸ¬ν•œ 점을 μ–΄λŠ 정도 잘 해결함을 μ•Œ 수 μžˆμ—ˆλ‹€. λ˜ν•œ μ œμ•ˆλœ 방법을 μ‹€μ œ 데이터에 μ μš©ν•¨μœΌλ‘œμ¨ λ³Έ λ°©λ²•μ˜ ν•„μš”μ„±μ„ μ œμ•ˆν•˜μ˜€λ‹€.ope

    μ‹€ν—˜κ³„νšλ²•μ„ μ΄μš©ν•œ μžλ™μ°¨μš© 휠 λ””μŠ€ν¬μ˜ λ‹€λ‹¨νŒμž¬μ„±ν˜• κΈˆν˜• 섀계

    No full text
    ν•™μœ„λ…Όλ¬Έ(석사)--μ„œμšΈλŒ€ν•™κ΅ λŒ€ν•™μ› :기계항곡곡학뢀,2003.Maste
    corecore