• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.10
• /
• pp.969-982
• /
• 2016

Recently, the researches to discovery drug candidates from natural herbs have received considerable attention. In human body, enzyme mostly metabolize the compounds of natural herbs. In this study, we analysis the enzyme interactions using assoication mining. We get this data from BRENDA(: BRaunschweig ENzyme DAtabase) system. Based on enzyme interaction model, we divide the metabolites into substrate metabolites, product metabolites, inhibitor metabolites, and activating metabolites. We then compose substrate metabolite transaction, product metabolite transaction with each metabolites and enzyme interaction transaction with all metabolites. Also we take account of organism for each transactions. We mine frequent metabolites and patterns from six transactions using association rule mining. And we analysis the relationship among metabolites. As a result, we identify the distributions and patterns of metabolites consist in enzyme interactions. We found that metabolites include in only substrate are identified and have very low supports. This results can be useful to develop the effective metabolism prediction model for compounds of natural herbs.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.439-452
• /
• 2007

We study on the privacy preserving data mining, PPDM for short, by using randomization. The theoretical PPDM based on the secure multi-party computation techniques is not practical for its computational inefficiency. So we concentrate on a practical PPDM, especially randomization technique. We survey various privacy measures and study on the privacy preserving mining of association rules by using randomization. We propose a new randomization operator, binomial selector, for privacy preserving technique of association rule mining. A binomial selector is a special case of a select-a-size operator by Evfimievski et al.[3]. Moreover we present some simulation results of detecting an appropriate parameter for a binomial selector. The randomization by a so-called cut-and-paste method in [3] is not efficient and has high variances on recovered support values for large item-sets. Our randomization by a binomial selector make up for this defects of cut-and-paste method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10c
• /
• pp.155-158
• /
• 2007

현재 전자상거래는 우리의 생활과 밀접히 연관되어 있다. 최근 인터넷을 기반으로 전자조달, 수출입 브로커 등과 같은 유형의 B2B 전자상거래가 활발히 이루어지고 있으며, 소비자를 대상으로 하는 전자상거래 또한 점차 확산되는 시장을 형성하고 있다. 국제적으로도 전자상거래 시장 규모가 급속도로 증가할 것이라는 전망은 자명한 사실이다. 전자상거래에 대한 의존도가 높아지면서 관리해야 하는 데이터의 양 또한 급속도로 증가하고 있다. 본 논문에서는 실시간으로 유입되는 데이터를 효율적으로 활용하기 위챈 실시간 데이터 마이닝 활용 모델을 제안한다. 이 실시간 데이터 마이닝 모델은 지속적으로 유입되는 데이터의 규칙화를 통해 저장 공간의 효율성을 극대화하고 중요도 분석을 통한 총체적인 접근 방법을 시도함으로써 전자상거래 상에서 유용하게 쓰일 수 있는 활용 모델이다. 이 실시간 데이터 마이닝 모델의 바탕은 데이터 마이닝의 기법인 SEMMA를 따르며, 그 특징에 따라 규칙 추출과 의사 결정 나무 기법을 이용하여 전자상거래 상에서 유용하게 사용될 수 있는 모델을 제시하고자 한다.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2002.03a
• /
• pp.38-44
• /
• 2002

고객관계관리(CRM)나 마케팅과 같은 경영방식에서도 대용량의 공간 데이터베이스를 사용하는 지리정보시스템(GIS)과 같은 응용분야를 접목하고 있다. gCRM은 지리정보시스템과 고객관계관리를 결합한 것으로, 이러한 실정을 단적으로 보여 주고 있는 경영방식이다. gCRM은 대용량의 데이터베이스로부터 관심 있는 분야를 찾아내고 분석하게 된다. 그러기 위해서는 데이터마이닝이라는 기술이 필요하다. 하지만, gCRM은 일반적인 데이터베이스뿐만 아니라 공간 데이터베이스 역시 많이 사용되어진다. 이러한 공간데이터베이스로부터 관심 있는 부분이나 관계 그리고 특성 등을 찾아내기 위해서는 공간데이타마이닝이 요구된다. 본 논문에서는 gCRM 솔루션들의 기능을 중심으로 다양한 공간데이타마이닝 기법과 어떠한 관계가 있는지를 살펴봄으로써 gCRM과 공간데이타마이닝이 접목할 수 있는 부분에 대하여 정리하였다.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.307-310
• /
• 2008

GIS 기술의 발달로 많은 양의 공간 데이터가 축적됨에 따라 공간 데이터 마이닝의 중요성이 커지고 있다. 본 논문에서는 새로운 공간 데이터 마이닝 시스템인 SD-Miner를 제안한다. SD-Miner는 크게 GUI 모듈과 데이터 마이닝 함수 모듈, 데이터 관리 모듈의 세부분으로 구성된다. GUI 모듈은 사용자의 입력과 출력을 담당한다. SD-Miner의 핵심 부분인 데이터 마이닝 함수 모듈은 공간 데이터 마이닝의 주요 기법인 공간 클러스터링, 공간 분류, 공간 특성화, 시공간 연관규칙 탐사 기능을 제공한다. 데이터 관리 모듈은 DBMS를 이용하여 데이터를 저장하고 관리한다. 실제 공간 데이터를 이용한 마이닝을 수행함으로써 개발된 SD-Miner의 실용성을 규명하고, 의미 있는 마이닝 결과들을 도출한다.

• The KIPS Transactions:PartD
• /
• v.17D no.1
• /
• pp.1-8
• /
• 2010

Association rule mining techniques enable us to acquire knowledge concerning sales patterns among individual items from voluminous transactional data. Certainly, one of the major purposes of association rule mining is utilizing the acquired knowledge to provide marketing strategies such as catalogue design, cross-selling and shop allocation. However, this requires too much time and high cost to only extract the actionable and profitable knowledge from tremendous numbers of discovered patterns. In currently available literature, a number of interest measures have been devised to accelerate and systematize the process of pattern evaluation. Unfortunately, most of such measures, including support and confidence, are prone to yielding impractical results because they are calculated only from the sales frequencies of items. For instance, traditional measures cannot differentiate between the purchases in a small basket and those in a large shopping cart. Therefore, some adjustment should be made to the size of market baskets because there is a strong possibility that mutually irrelevant items could appear together in a large shopping cart. Contrary to the previous approaches, we attempted to consider market basket's size in calculating interest measures. Because the devised measure assigns different weights to individual purchases according to their basket sizes, we expect that the measure can minimize distortion of results caused by accidental patterns. Additionally, we performed intensive computer simulations under various environments, and we performed real case analyses to analyze the correctness and consistency of the devised measure.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.353-362
• /
• 2016

By Wikipedia, data mining is the process of discovering patterns in a big data set involving methods at the intersection of association rule, decision tree, clustering, artificial intelligence, machine learning. and database systems. Association rule is a method for discovering interesting relations between items in large transactions by interestingness measures. Association rule interestingness measures play a major role within a knowledge discovery process in databases, and have been developed by many researchers. Among them, the Hellinger measure is a good association threshold considering the information content and the generality of a rule. But it has the drawback that it can not determine the direction of the association. In this paper we proposed a signed Hellinger measure to be able to interpret operationally, and we checked three conditions of association threshold. Furthermore, we investigated some aspects through a few examples. The results showed that the signed Hellinger measure was better than the Hellinger measure because the signed one was able to estimate the right direction of association.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.857-868
• /
• 2014

Data mining is the representative analysis methodology in the era of big data, and is the process to analyze a massive volume database and summarize it into meaningful information. Association rule technique finds the relationship among several items in huge database using the interestingness measures such as support, confidence, lift, etc. But these interestingness measures cannot be used to establish a causality relationship between antecedent and consequent item sets. Moreover, we can not know association direction by them. This paper propose causally confirmed association thresholds to compensate for these problems, and then check the three conditions of interestingness measures. The comparative studies with basic association thresholds, causal association thresholds, and causally confirmed association thresholds are shown by simulation studies. The results show that causally confirmed association thresholds are better than basic and causal association thresholds.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1106-1116
• /
• 2007

Recently e-commerce trade on the web has grown rapidly in scale and complexity, just as web site designs and web servers have become more complicated. In view of these complexities, it is obviously difficult to analyse web user's data since they web users employ so many different web paths. The existing association rule investigation algorithms identify all items with a high correlation. However even though users often only want to find items in which they have interest, it is still difficult to find the rules they want out of all of the many association rules found by existing algorithms. In this paper, we propose a system linking each node with the sequence association rule, linking all routes after finding a path corresponding to a user with the association rule-one of the data mining techniques which identify user patterns in web user paths. The suggested system helps us construct individualized or customer-subdivided sites using the sequence association rule in order to harmonize the paths of web users with user characters.

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