• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.322-324
• /
• 2008

패션 시장은 항상 경쟁이 치열하고 고객의 변화 및 이탈이 심한 시장이다. 경쟁의 요소가 품질 등의 가격적인 요소에서 디자인 및 서비스 등 비 가격 적인 요소의 중요성이 부각되고 있다. 이에 따라 고객 정보에 대한 분석을 기반으로 한 마케팅 및 판매 전략이 중요한 것은 두말할 필요가 없다. 정보 기술과 다양한 분석 기법은 다양한 방법으로 고객의 행동을 분석하여 고객의 구매 형태를 분석 및 예측하여 고객별로 차별화된 마케팅과 서비스를 제공할 수 있도록 한다.

• Journal of Internet Computing and Services
• /
• v.3 no.5
• /
• pp.41-49
• /
• 2002

Web mining can be broadly defined as the discovery and analysis of useful information from the World Wide Web. In this paper. we tried to analyze a user access pattern and designed a system which can supply useful information to users through the web mining, The proposed system can search the information of users pattern through the web site and news letters, and pass through classification of category through filtering, The fuzzy association rules are applied to the users who access recently, to each category that generated though these processes, and compares the generated sets to each users-access pages set, and it can send appropriate news letter to each user.

• Journal of KIISE:Software and Applications
• /
• v.36 no.2
• /
• pp.109-121
• /
• 2009

Although a prior knowledge is a factor to improve the clustering performance, it is dependant on how to use of them. Especial1y, when the prior knowledge is employed in constructing initial centroids of cluster groups, there should be concerned of similarities of a prior knowledge. Despite labels of some objects of a prior knowledge are identical, the objects whose similarities are low should be separated. By separating them, centroids of initial group were not fallen in a problem which is collision of objects with low similarities. There can use the separated prior knowledge by various methods such as various initializations. To apply association rule, proposed method makes enough cluster group number, then the centroids of initial groups could constructed by separated prior knowledge. Then ensemble of the various results outperforms what can not be separated.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.04a
• /
• pp.87-98
• /
• 2006

The reform of the information technique is very decisive in reforming effort of the government, and ubiquitous government is a representative example. But a problem in ubiquitous government service is that the efficiency is low. The reason is that the service of ubiquitous government could not be provided with a corresponding service to the inhabitants which is real and actual user. from now on, Gyeongnam province must have the ubiquitous service plan which can be the corresponding to the need of the inhabitants. In this paper we survey a ubiquitous recognition of Gyenongnam inhabitants and analyze the present situation by association rule mining. We can offer a basic data of policy about a ubiquitous service construction of Gyeongnam from the results of this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.49-51
• /
• 2001

데이터 마이닝은 KDD의 분야로서, 의미 있는 정보와 관심 있는 행동 패턴을 추출해 나가는 과정이다. WWW의 발전으로, 웹 데이터가 거대해지고 있다. 이러한 데이터 마이닝 분야에서도, 웹 사용 마이닝의 목적은 의미 있는 사용자 행동 패턴을 찾아내는 것이다. 특히 현재 전자상거래가 널리 활성화되고 있는 환경에서, 사용자의 특성을 발견해내는 것은 매우 중요한 부분이다. 사용자의 특성에 따라 사용자에게 상품을 추천하거나 메일을 보내는 것이나 사용자에게 적절하게 사이트를 구축하는 것이 가능하다. 전처리 과정을 통해서 추출된 트랜잭션 데이터를 모호한 사용자의 요구를 분석할 수 있는 퍼지 집합으로 변형시켜 Fuzzy Association Rule을 통해 분석한다. 그리고 분석된 결과에 대한 규칙을 사용자의 피드백을 통해서 다시 분석하는 과정을 거치게 된다. 사용자의 요구 사항을 적절히 반영할 수 있다.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.455-462
• /
• 2004

Network attacks are various types with development of internet and are a new types. The existing intrusion detection systems need a lot of efforts and costs in order to detect and respond to unknown or modified attacks because of detection based on signatures of known attacks. In this paper, we present a design and implementation for mining prototype system to predict unknown or modified attacks through network protocol attributes analysis. In order to analyze attributes of network protocols, we use the association rule and the frequent episode. The collected network protocols are storing schema of TCP, UDP, ICMP and integrated type. We are generating rules that can predict the types of network attacks. Our mining prototype in the intrusion detection system aspect is useful for response against new attacks as extra tool.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.7
• /
• pp.945-952
• /
• 2001

In consequence of expansion of internet users, electronic commerce is becoming a new prototype for marketing and sales, arid most of electronic commerce sites or internet shopping malls provide a rich source of information and convenient user interfaces about the organizations customers to maintain their patrons. One of the convenient interfaces for users is service to recommend products. To do this, they must exploit methods to extract and analysis specific patterns from purchasing information, behavior and market basket about customers. The methods are association rules and sequential patterns, which are widely used to extract correlation among products, and in most of on-line electronic commerce sites are executed with users information and purchased history by category-oriented. But these can't represent the diverse correlation among products and also hardly reflect users' buying patterns precisely, since the results are simple set of relations for single purchased pattern. In this paper, we propose an efficient mining technique, which allows for multiple purchased patterns that are category-independent and have relationship among items in the linked structure of single pattern items.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.375-379
• /
• 2009

Protein domain is the conserved unit of compact tree-dimensional structure and evolution, which carries specific function. Domains may appear in patterns in proteins, since they have been conserved through the evolution for functional formation of proteins. In this paper, we propose a formulated method for conservation analysis of domain combination based on association rule. Proposed method measures mutual dependency of domains in a combination, as well as co-occurrence frequency of them, which is conventionally used. Based on the method, we extracted conserve domain combinations in S.cerevisiae proteins and analyzed their functions based on Gene Ontology. From the results, we drew conclusions that domains in S.cerevisiae proteins form patterns whose members are highly affiliated to one another, and that extracted patterns tend to be associated with molecular function. Moreover, the results testified to proposed method superior to conventional ones for identifying domain combinations conserved for functional cooperation.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.205-213
• /
• 2010

This study uses the FP-tree algorithm, one of the mining techniques. This study is an attempt to suggest a new recommended system using a modified FP-tree algorithm which yields an association rule based on frequent 2-itemsets extracted from the transaction database. The modified recommended system consists of a pre-processing module, a learning module, a recommendation module and an evaluation module. The study first makes an assessment of the modified recommended system with respect to the precision rate, recall rate, F-measure, success rate, and recommending time. Then, the efficiency of the system is compared against other recommended systems utilizing the sequential pattern mining. When compared with other recommended systems utilizing the sequential pattern mining, the modified recommended system exhibits 5 times more efficiency in learning, and 20% improvement in the recommending capacity. This result proves that the modified system has more validity than recommended systems utilizing the sequential pattern mining.

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