• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1-11
• /
• 2003

일반적으로 모수에 대한 신뢰구간 추정량이 점 추정량보다 훨씬 더 선호되고 있으며 많이 알려져 있다. 그러나 이산형 분포의 경우에는 주로 대 표본 근사 이론에 입각한 근사 신뢰구간이 많이 사용되고 있다. 본 논문에서는 여러 가지 이산형 분포 가운데에서 가장 많이 활용되고 있는 이항분포와 포아송 분포의 모수에 대한 다양한 신뢰구간 추정량들을 소개하고 대 표본 근사 이론에 의한 신뢰구간뿐만 아니라 소 표본의 경우에도 유용하게 이용될 수 있는 신뢰구간 등을 살펴보고 이들 신뢰구간들을 비교하였다.

• The Korean Journal of Applied Statistics
• /
• v.11 no.2
• /
• pp.287-302
• /
• 1998

Saddlepoint approximation to the distribution function of sample mean(Daniels, 1987) is extended to the case of general statistic in this paper. The suggested approximation methods are applied to derive the approximations to the distributions of some statistics, including sample valiance and studentized mean. Some comparisons with other methods show that the suggested approximations are very accurate for moderate or small sample sizes. Even in extreme tail the accuracies are also maintained.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.269-277
• /
• 1994

Bootstrap approximation is compared with ordinary asymptotic method in the context of minimum chi-square estimation through application in a real problem. Fixed interval search method is shown to be superior over a random interval search method or Newton-Raphson method. All the procedures are implemented by S-Plus functions.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.199-206
• /
• 2006

Sequential pattern mining is an important data mining task with broad applications. However, conventional methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivial patterns but fail to find interesting patterns shared by many sequences. In this paper, to overcome these problems, we propose the theme of approximate sequential pattern mining roughly defined as identifying patterns approximately shared by many sequences. The proposed method works in two steps: one is to cluster target sequences by their similarities and the other is to find consensus patterns that ire similar to the sequences in each cluster directly through multiple alignment. For this purpose, a novel structure called weighted sequence is presented to compress the alignment result, and the longest consensus pattern that represents each cluster is generated from its weighted sequence. Finally, the effectiveness of the proposed method is verified by a set of experiments.

• Journal of Korean Society of Steel Construction
• /
• v.8 no.4 s.29
• /
• pp.105-113
• /
• 1996

본 연구에서는 철골모멘트골조의 패널존변형을 명시적으로 고려한 탄성층 간변위의 근사해석 방법을 제안하였다. 본 방법은 고전적 포탈법의 가정 및 D 치법에 기반한 해석적 접근법이다. 즉 포탈법의 가정에 따라 횡력을 받는 골조를 보-기둥 부분 골조로 분해한 후 대표적 내부 부분골조의 보, 기둥 및 패널존에서 기인하는 모든 횡변위 성분을 해석적으로 계산한다. 이때에 필요한 모든 내력(가령 패널존 전단변형 산정을 위한 보의 불균형모멘트)의 결정에 D 치법을 이용한다. 구조바닥의 강막작용을 고려하면 위의 과정을 통하여 산출된 대표적 내부 부분골조의 횡변위는 전체 골조의 횡변위와 거의 동일할 것으로 기대할 수 있다. 본 방법의 타당성 여부는 반강절 접합요소를 사용한 해석적 엄밀해와 비교하여 검증하였으며 만족스런 결과를 주는 것을 확인하였다. 본 연구의 방법에 의해 컴퓨터해석에 의하지 않고도 철골모멘트골조의 탄성층간변위를 실용성있는 정확도로서 신속하게 산정할 수 있으므로 본 연구의 결과는 예비적 횡강성 평가에 유용하게 사용될 수 있다. 또한 본 방법의 적용과정에서 해석자는 철골모멘트골조의 횡변위 기동에 관한 물리적 감각을 증진시킬 수 있을 것으로 사료된다.

• Proceedings of the KIPE Conference
• /
• 2019.11a
• /
• pp.206-207
• /
• 2019

리튬이온 배터리의 상태를 모니터링 하는 방법에 있어서, 대표적으로 배터리의 충전 상태(SOC)와 배터리의 건강 상태(SOH)를 추정하여 상태 지표로 사용된다. 본 연구에서는 리튬 이온 배터리의 상태 지표를 위한 용량 정보의 추정을 데이터 기반의 근사 모델을 이용하여 수행하였다. 다양한 근사 모델링 방법을 적용하여 추정되는 용량 정보를 비교하고, 모델링 방법에 따른 용량 추정 성능을 확인하였다. 또한, 이를 바탕으로 리튬이온 배터리의 용량을 예측하고 예측 성능을 분석하였다. 본 연구를 통하여 근사모델을 이용하는 경우, 리튬이온 배터리의 용량 추정은 물론 예측을 수행하는 방법으로서의 활용 가능성을 확인하였으며, 또한 제안하는 방법을 이용하여 보유하고 있는 모니터링 데이터를 활용하여 리튬이온 배터리의 성능을 평가하는데 있어 효과적으로 활용될 수 있을 것으로 판단된다.

• The Korean Journal of Applied Statistics
• /
• v.22 no.4
• /
• pp.793-804
• /
• 2009

The hypotheses of difference, ratio and odds ratio between two proportions are used for the non-inferiority trial. The approximate unconditional test suggested by Kang and Chen (2000) based on difference and ratio have the potential problem against the failure rate. When the sample size is small, the type I errors of the asymptotic test using the normal approximation suggested by Chen et al. (2000) tends to exceed the nominal level. Therefore, we propose the approximate unconditional test based on odds ratio and compare the test with the asymptotic test. And we compare the three hypotheses used in the approximate unconditional tests of two proportions with respect to the type I errors and power.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.57-66
• /
• 2005

The Interconnecting Highways problem is an abstract of many practical Layout Design problems in the areas of VLSI design, the optical and wired network design, and the planning for the road constructions. For the road constructions, the shortest-length road layouts that interconnect existing positions will provide many more economic benefits than others. That is, finding new road layouts to interconnect existing roads and cities over a wide area is an important issue. This paper addresses an approximation scheme that finds near optimal road layouts for the Interconnecting Highways problem which is NP-hard. As long as computational resources are provided, the near optimality can be acquired asymptotically. This implies that the result of the scheme can be regarded as the optimal solution for the problem in practice. While other approximation schemes can be made for the problem, this proposed scheme provides a big merit that the algorithm designed by this scheme fits well to given problem instances.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.16-21
• /
• 2002

Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.2
• /
• pp.163-168
• /
• 2011

Robust optimization or reliability-based design optimization are some of the methodologies that are employed to take into account the uncertainties of a system at the design stage. For applying such methodologies to solve industrial problems, accurate and efficient methods for estimating statistical moments and failure probability are required, and further, the results of sensitivity analysis, which is needed for searching direction during the optimization process, should also be accurate. The aim of this study is to employ the function approximation moment method into the sensitivity analysis formulation, which is expressed as an integral form, to verify the accuracy of the sensitivity results, and to solve a typical problem of reliability-based design optimization. These results are compared with those of other moment methods, and the feasibility of the function approximation moment method is verified. The sensitivity analysis formula with integral form is the efficient formulation for evaluating sensitivity because any additional function calculation is not needed provided the failure probability or statistical moments are calculated.