• 응용통계연구
• /
• 제25권6호
• /
• pp.1027-1036
• /
• 2012

Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions. We could obtain confidence intervals of similarity distance for the same and different persons, and optimal thresholds to minimize two kinds of error rates for distance distributions. It is found that the two confidence intervals of the same and different persons are not overlapped and that the optimal threshold locates between two confidence intervals. Hence an alternative statistical matching method can be suggested by using nonoverlapped confidence intervals and optimal thresholds obtained from the distributions of similarity distances.

• Journal of Computing Science and Engineering
• /
• 제8권2호
• /
• pp.94-106
• /
• 2014

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.333-339
• /
• 2003

In this paper, we develop the probability matching priors for the parameters of non-regular Pareto distribution. We prove the propriety of joint posterior distribution induced by probability matching priors. Through the simulation study, we show that the proposed probability matching Prior matches the coverage probabilities in a frequentist sense. A real data example is given.

• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.559-568
• /
• 2006

In this paper, we develop the noninformative priors for the linear mixed models when the parameter of interest is the ratio of variance components. We developed the first and second order matching priors. We reveal that the one-at-a-time reference prior satisfies the second order matching criterion. It turns out that the two group reference prior satisfies a first order matching criterion, but Jeffreys' prior is not first order matching prior. Some simulation study is performed.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2005년도 추계 학술발표회 논문집
• /
• pp.141-146
• /
• 2005

Ensemble method has been known as one of the most powerful classification tools that can improve prediction accuracy. Ensemble method also has been understood as ‘perturb and combine’ strategy. Many studies have tried to develop ensemble methods by improving perturbation. In this paper, we propose two new ensemble methods that improve combining, based on the idea of pattern matching. In the experiment with simulation data and with real dataset, the proposed ensemble methods peformed better than bagging. The proposed ensemble methods give the most accurate prediction when the pruned tree was used as the base learner.

• Journal of the Korean Data and Information Science Society
• /
• 제18권1호
• /
• pp.247-257
• /
• 2007

In this paper, we develop the noninformative priors for the common shape parameter in the gamma distributions. We develop the matching priors and reveal that the second order matching prior does not exist. It turns out that the one-at-a-time reference prior and the two group reference prior satisfy a first order probability matching criterion. Some simulation study is peformed.

• Communications for Statistical Applications and Methods
• /
• 제8권1호
• /
• pp.29-37
• /
• 2001

In this paper, we consider the second order probability matching criterion for the ratio of the variance components under the one-way random effect model. It turns out that among all of the reference priors given in Ye(1994), the only one reference prior satisfies the second order matching criterion. Similar results are also obtained for the intraclass correlation as well.

• Journal of the Korean Data and Information Science Society
• /
• 제22권2호
• /
• pp.361-369
• /
• 2011

In this paper, we develop the reference and the matching priors for the reliability function of two-parameter exponential distribution. We derive the reference priors and the matching prior, and prove the propriety of joint posterior distribution under the general prior including the reference priors and the matching prior. Through the sim-ulation study, we show that the proposed reference priors match the target coverage probabilities in a frequentist sense.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2005년도 추계학술대회
• /
• pp.71-84
• /
• 2005

The Fieller-Creasy problem involves statistical inference about the ratio of two independent normal means. It is difficult problem from either a frequentist or a likelihood perspective. As an alternatives, a Bayesian analysis with noninformative priors may provide a solution to this problem. In this paper, we extend the results of Yin and Ghosh (2001) to unbalanced sample case. We find various noninformative priors such as first and second order matching priors, reference and Jeffreys' priors. The posterior propriety under the proposed noninformative priors will be given. Using real data, we provide illustrative examples. Through simulation study, we compute the frequentist coverage probabilities for probability matching and reference priors. Some simulation results will be given.

• Journal of the Korean Data and Information Science Society
• /
• 제23권2호
• /
• pp.353-363
• /
• 2012

In this paper, we introduce the noninformative priors such as the matching priors and the reference priors for the common scale parameter in the Pareto distributions. It turns out that the posterior distribution under the reference priors is not proper, and Jeffreys' prior is not a matching prior. It is shown that the proposed first order prior matches the target coverage probabilities in a frequentist sense through simulation study.