• Journal of the Korean Data and Information Science Society
• /
• v.22 no.2
• /
• pp.235-243
• /
• 2011

The most widely used data mining technique is to explore association rules. This technique has been used to find the relationship between each set of items based on the association thresholds such as support, confidence, lift, etc. There are many interestingness measures as the criteria for evaluating association rules. Among them, confidence is the most frequently used, but it has the drawback that it can not determine the direction of the association. The net confidence measure was developed to compensate for this drawback, but it is useless in the case that the value of positive confidence is the same as that of negative confidence. This paper propose a attributably pure confidence to evaluate association rules and then describe some properties for a proposed measure. The comparative studies with confidence, net confidence, and attributably pure confidence are shown by numerical example. The results show that the attributably pure confidence is better than confidence or net confidence.

• 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.22 no.3
• /
• pp.495-503
• /
• 2011

The most widely used data mining technique is to find association rules. Association rule mining is the method to quantify the relationship between each set of items in very huge database based on the association thresholds. There are some basic association thresholds to explore meaningful association rules ; support, confidence, lift, etc. Among them, confidence is the most frequently used, but it has the drawback that it can not determine the direction of the association. The net confidence and the attributably pure confidence were developed to compensate for this drawback, but they have other drawbacks.In this paper we consider some predictive similarity measures for binary data in cluster analysis and multi-dimensional analysis as association threshold to compensate for these drawbacks. The comparative studies with net confidence, attributably pure confidence, and some predictive similarity measures are shown by numerical example.

• 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.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.5
• /
• pp.939-948
• /
• 2012

The most widely used data mining technique is to explore association rules. This technique has been used to find the relationship between items in a massive database based on the interestingness measures such as support, confidence, lift, etc. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control.In general, association rule technique generates the rule, 'If A, then B.', whereas negative association rule technique generates the rule, 'If A, then not B.', or 'If not A, then B.'. We can determine whether we promote other products in addition to promote its products only if we add negative association rules to existing association rules. In this paper, we proposed the negatively attributable and pure confidence to overcome the problems faced by negative association rule technique, and then we checked three conditions for interestingness measure. The comparative studies with negative confidence, negatively pure confidence, and negatively attributable and pure confidence are shown by numerical examples. The results show that the negatively attributable and pure confidence is better than negative confidence and negatively pure confidence.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.2
• /
• pp.263-270
• /
• 2010

Data mining is the process of sorting through large amounts of data and picking out useful information. An important goal of data mining is to discover, define and determine the relationship between several variables. Association rule mining is an important research topic in data mining. An association rule technique finds the relation among each items in massive volume database. Association rule technique consists of two steps: finding frequent itemsets and then extracting interesting rules from the frequent itemsets. Some interestingness measures have been developed in association rule mining. Interestingness measures are useful in that it shows the causes for pruning uninteresting rules statistically or logically. This paper explores some problems for two interestingness measures, confidence and net confidence, and then propose a decision process for right association rule generation using these interestingness measures.

• Culinary science and hospitality research
• /
• v.21 no.6
• /
• pp.167-181
• /
• 2015

The purpose of this study is to examine the effects of genuineness, usefulness, overstatement, and assentation of the smartphone majib app on trust, perceived risk, and use intention, and thereby suggest useful information for the mobile application. A survey was conducted from May 11, 2015 to June 30, 2015 targeting smartphone majib app users through convenience sampling. A total of 300 questionnaires were distributed, of which 275 were used for analysis after excluding 25 response for negligent or inappropriate responses. The results found that, first, of the review characteristics, genuineness and usefulness, assentation had positive (+) effects on trust, while overstatement had a negative (-) effect on trust. Second, of the review characteristics, only genuineness and usefulness had significant effects on perceived risk. Third, trust had a significant effect on use intention rather than on perceived risk. Fourth, trust and perceived risk had mediating effects on the relationship between the assentation of the majib smartphone app review characteristics and use intention.

• Journal of the Korean Data Analysis Society
• /
• v.20 no.6
• /
• pp.2865-2872
• /
• 2018

In the field of data mining technique, there are various methods such as association rules, cluster analysis, decision tree, neural network. Among them, association rules are defined by using various association evaluation criteria such as support, confidence, and lift. Agrawal et al. (1993) first proposed this association rule, and since then research has been conducted by many scholars. Recently, studies related to crossover entropy have been published (Park, 2016b). In this paper, we proposed a purely symmetric J measure considering directionality and purity in the previously published J measure, and examined its usefulness by using examples. As a result, it is found that the pure symmetric J measure changes more clearly than the conventional J measure, the symmetric J measure, and the pure crossover entropy measure as the frequency of coincidence increases. The variation of the pure symmetric J measure was also larger depending on the magnitude of the inconsistency, and the presence or absence of the association was more clearly understood.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.406-408
• /
• 2003

현재 많이 사용되고 있는 P2P 개념으로는 순수 F2P와 변형 F2P구조가 있다. 순수 P2P의 모델에는 Gnutella와 Ktella 등의 형태가 존재하고 변형 P2P로는 무수히 많은 형태가 존재한다. 순수 P2P 모델의 경우에는 정보 공유에서 연결성을 장점으로 Gnutella의 형태를 응용한 형태로 많이 사용되고 있지만 정보를 검색하거나 제공하기 위해 많은 트래픽을 소모하게 된다. 이와는 달리 변형 P2P모델들 중 정보 공유 모델들이 존재하는데 이 모델들은 사용자에게 효율적이고 빠른 검색과 색인을 제공하기 위해 기존의 서버/클라이언트 형태를 취하고 있지만 제공하는 서버의 능력에 의존할 수 밖에 없다. 파일공유 모델의 Peer들에 대해 연결성 유지를 위한 많은 부하와 사용자에 있어서 그룹에 대한 형태의 문제점 그리고 서버의 Fail로 인한 비 연결성에 대한 문제점을 해결하기 위해 본 논문에서는 라우팅 프로토콜 기법에서의 접근과 계층적 구조를 적용하고 Backup 시스템을 포함해서 효율적인 그룹관리와 동적인 서버의 지정으로 신뢰성을 유지하기 위한 시스템을 설계하고 구현하였다.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.2
• /
• pp.179-188
• /
• 2011

Association rule represents the relationship between items in a massive database by quantifying their relationship, and is used most frequently in data mining techniques. In general, association rule technique generates the rule, 'If A, then B.', whereas negative association rule technique generates the rule, 'If A, then not B.', or 'If not A, then B.'. We can determine whether we promote other products in addition to promote its products only if we add negative association rules to existing association rules. In this paper, we proposed the negatively pure association rules by negatively pure support, negatively pure confidence, and negatively pure lift to overcome the problems faced by negative association rule technique. In checking the usefulness of this technique through numerical examples, we could find the direction of association by the sign of the negatively pure association rule measure.