• Korean Journal of Adult Nursing
• /
• v.22 no.4
• /
• pp.430-437
• /
• 2010

Purpose: The purpose of this study was to investigate the balance confidence and balance ability among community-residing stroke patients. Methods: The sample for this study was a convenience sample obtained from patients who visited welfare centers for the disabled in three cities from October to December in 2009. The Activities-specific Balance Confidence Scale and Berg Balance Scale were used to measure confidence in task performance and balance ability. Results: The level of balance confidence and balance ability were low in these subjects. There was a significant relationship between balance confidence and balance ability (r=.424, p=.000). Subjects with less balance ability felt less balance confidence. Conclusion: Among community-residing stroke patients, falls are common. Falls prevention which may contribute to the incidence of fall and fall related injury should be part of stroke rehabilitation plan. Also, it is necessary that an intervention for falls prevention after stroke should take into account factors such as the balance confidence and balance ability.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.653-661
• /
• 2016

The existing pattern-based triple generation systems based on distant supervision could be flawed by assumption of distant supervision. For resolving flaw from an excessive assumption, statistics information has been commonly used for measuring confidence of patterns in previous studies. In this study, we proposed a more accurate confidence measure based on semantic similarity between patterns and properties. Unsupervised learning method, word embedding and WordNet-based similarity measures were adopted for learning meaning of words and measuring semantic similarity. For resolving language discordance between patterns and properties, we adopted CCA for aligning bilingual word embedding models and a translation-based approach for a WordNet-based measure. The results of our experiments indicated that the accuracy of triples that are filtered by the semantic similarity-based confidence measure was 16% higher than that of the statistics-based approach. These results suggested that semantic similarity-based confidence measure is more effective than statistics-based approach for generating high quality triples.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.3
• /
• pp.601-609
• /
• 2014

The most widely used data mining technique for big data analysis is to generate meaningful association rules. This method has been used to find the relationship between set of items based on the association criteria such as support, confidence, lift, etc. Among them, confidence is the most frequently used, but it has the drawback that we can not know the direction of association by it. The attributably pure confidence was developed to compensate for this drawback, but the value was changed by the position of two item sets. In this paper, we propose four symmetrically and attributably pure confidence measures to compensate the shortcomings of confidence and the attributably pure confidence. And then we prove three conditions of interestingness measure by Piatetsky-Shapiro, and comparative studies with confidence, attributably pure confidence, and four symmetrically and attributably pure confidence measures are shown by numerical examples. The results show that the symmetrically and attributably pure confidence measures are better than confidence and the attributably pure confidence. Also the measure NSAPis found to be the best among these four symmetrically and attributably pure confidence measures.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.117-124
• /
• 2013

Association rule of data mining techniques is the method to quantify the relationship between a set of items in a huge database, andhas been applied in various fields like internet shopping mall, healthcare, insurance, and education. There are three primary interestingness measures for association rule, support and confidence and lift. Confidence is the most important measure of these measures, and we generate some association rules using confidence. But it is an asymmetric measure and has only positive value. So we can face with difficult problems in generation of association rules. In this paper we apply the similarity measures by probabilistic interestingness measure (PIM) with all marginal proportions (AMP) to solve this problem. The comparative studies with support, confidences, lift, chi-square statistics, and some similarity measures by PIM with AMPare shown by numerical example. As the result, we knew that the similarity measures by PIM with AMP could be seen the degree of association same as confidence. And we could confirm the direction of association because they had the sign of their values, and select the best similarity measure by PIM with AMP.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.3
• /
• pp.925-936
• /
• 2008

An association rule mining finds the relation among each items in massive volume database. In generating association rules, the researcher specifies the measurements randomly such as support, confidence and lift, and produces the rules. The rule is not produced if it is not suitable to the one any condition which is given value. For example, in case of a little small one than the value which a confidence value is specified but a support and lift's value is very high, this rule is meaningful rule. But association rule mining can not produce the meaningful rules in this case because it is not suitable to a given condition. Consequently, we creat insignificant error which is not selected to the meaningful rules. In this paper, we suggest clustering technique to association rule measures for finding effective association rules using measure of association.

• Proceedings of the KSPS conference
• /
• 2005.04a
• /
• pp.95-98
• /
• 2005

Many utterance verification (UV) algorithms have been studied to reject out-of-vocabulary (OOV) in speech recognition systems. Most of conventional confidence measures for UV algorithms are mainly based on log likelihood ratio test, but these measures take much time to evaluate the alternative hypothesis or anti-model likelihood. We propose a novel confidence measure which makes use of a momentary best scored state sequence during Viterbi search. Our approach is more efficient than conventional LRT-based algorithms because it does not need to build anti-model or to calculate the alternative hypothesis. The proposed confidence measure shows better performance in additive noise-corrupted speech as well as clean speech.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.207-216
• /
• 2005

One of the well-studied problems in data mining is the search for association rules. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. There are three criteria of association rule; support, confidence, lift. The goal of association rule mining is to find all the rules with support and confidence exceeding some user specified thresholds. We can know there is association between two items by the criteria of association rules. But we can not know the degree of association between two items. In this paper we examine the relation between the measures of association and the criteria of association rule for ordinal data.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.3
• /
• pp.523-532
• /
• 2013

Generally, data mining is the process of analyzing big data from different perspectives and summarizing it into useful information. The most widely used data mining technique is to generate association rules, and it finds the relevance between two items in a huge database. This technique has been used to find the relationship between each set of items based on the interestingness measures such as support, confidence, lift, etc. Among many interestingness measures, confidence is the most frequently used, but it has the drawback that it can not determine the direction of the association. The attributably pure confidence and compared confidence are able to determine the direction of the association, but their ranges are not [-1, +1]. So we can not interpret the degree of association operationally by their values. This paper propose a compared and attributably pure confidence to compensate for this drawback, and then describe some properties for a proposed measure. The comparative studies with confidence, compared confidence, attributably pure confidence, and a proposed measure are shown by numerical example. The results show that the a compared and attributably pure confidence is better than any other confidences.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.2
• /
• pp.27-34
• /
• 2001

Utterance verification is used in variable vocabulary word recognition to reject the word that does not belong to in-vocabulary word or does not belong to correctly recognized word. Utterance verification is an important technology to design a user-friendly speech recognition system. We propose a new utterance verification algorithm for no-training utterance verification system based on the minimum verification error. First, using PBW (Phonetically Balanced Words) DB (445 words), we create no-training anti-phoneme models which include many PLUs(Phoneme Like Units), so anti-phoneme models have the minimum verification error. Then, for OOV (Out-Of-Vocabulary) rejection, the phoneme-based confidence measure which uses the likelihood between phoneme model (null hypothesis) and anti-phoneme model (alternative hypothesis) is normalized by null hypothesis, so the phoneme-based confidence measure tends to be more robust to OOV rejection. And, the word-based confidence measure which uses the phoneme-based confidence measure has been shown to provide improved detection of near-misses in speech recognition as well as better discrimination between in-vocabularys and OOVs. Using our proposed anti-model and confidence measure, we achieve significant performance improvement; CA (Correctly Accept for In-Vocabulary) is about 89％, and CR (Correctly Reject for OOV) is about 90％, improving about 15-21％ in ERR (Error Reduction Rate).

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.4
• /
• pp.380-386
• /
• 2002

Conventional post-processing as like confidence measure (CM) proposed by Rahim calculates phones' CM using the likelihood between phoneme model and anti-model, and then word's CM is obtained by averaging phone-level CMs[1]. In conventional method, CMs of some specific keywords are tory low and they are usually rejected. The reason is that statistics of phone-level CMs are not consistent. In other words, phone-level CMs have different probability density functions (pdf) for each phone, especially sri-phone. To overcome this problem, in this paper, we propose normalized confidence measure. Our approach is to transform CM pdf of each tri-phone to the same pdf under the assumption that CM pdfs are Gaussian. For evaluating our method we use common keyword spotting system. In that system context-dependent HMM models are used for modeling keyword utterance and contort-independent HMM models are applied to non-keyword utterance. The experiment results show that the proposed NCM reduced FAR (false alarm rate) from 0.44 to 0.33 FA/KW/HR (false alarm/keyword/hour) when MDR is about 8%. It achieves 25% improvement of FAR.