• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.423-432
• /
• 2009

Advances in information and communication technologies are changing our society greatly. In knowledge-based society, information can be obtained easily via communication tools such as web and e-mail. However, obtaining right and up-to-date information is difficult in spite of overflowing information. The concept of adaptive web site has been initiated recently. The purpose of the site is to provide information only users want out of tons of data gathered. In this paper, an algorithm is developed for adaptive web site construction. The proposed algorithm is based on association rules that are major principle in adaptive web site construction. The algorithm is constructed by analysing log data in web server and extracting meaning documents through finding behavior patterns of users. The proposed algorithm has the following characteristics. First, it is superior to existing algorithms using association rules in time complexity. Its superiority is proved theoretically. Second, the proposed algorithm is effective in space complexity. This is due to that it does not need any intermediate products except a linked list that is essential for finding frequent item sets.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.717-726
• /
• 2003

In this paper, we analyze the associated rule based deductive algorithm which creates the rules automatically for intrusion detection from the vast packet data. Based on the result, we also suggest the deductive algorithm which creates the rules of intrusion pattern fast in order to apply the intrusion detection systems. The deductive algorithm proposed is designed suitable to the concept of clustering which classifies and deletes the large data. This algorithm has direct relation with the method of pattern generation and analyzing module of the intrusion detection system. This can also extend the appication range and increase the detection speed of exiting intrusion detection system as the rule database is constructed for the pattern management of the intrusion detection system. The proposed pattern generation technique of the deductive algorithm is used to the algorithm is used to the algorithm which can be changed by the supporting rate of the data created from the intrusion detection system. Fanally, we analyze the possibility of the speed improvement of the rule generation with the algorithm simulation.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.5
• /
• pp.891-899
• /
• 2010

Association rule is the technique to represent the relationship between two or more items by numerical representing for the relevance of each item in vast amounts of databases, and is most being used in data mining. The basic thresholds for association rule are support, confidence, and lift. these are used to generate the association rules. We need standardization of lift because the range of lift value is different from that of support and confidence. And also we need standardization of support and confidence to compare objectively association level of antecedent variables for one descendant variable. In this paper we propose a method for standardization of association thresholds considering marginal probability for each item to grasp objectively and exactly association level, check the conditions for association criteria and then compare association thresholds with standardized association thresholds using some concrete examples.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.397-405
• /
• 2010

Data mining is the method to find useful information for large amounts of data in database, and one of the important goals is to search and decide the association for several variables. The task of association rule mining is to find certain association relationships among a set of data items in a database. There are three primary measures for association rule, support and confidence and lift. In this paper we developed a association rule ranking function by decreased lift influence to generate association rule for items satisfying at least one of three criteria. We compared our function with the functions suggested by Park (2010), and Wu et al. (2004) using some numerical examples. As the result, we knew that our decision function was better than the function of Park's and Wu's functions because our function had a value between -1 and 1regardless of the range for three association thresholds. Our function had the value of 1 if all of three association measures were greater than their thresholds and had the value of -1 if all of three measures were smaller than the thresholds.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1579-1582
• /
• 2003

점차 네트워크상의 침입 시도가 증가되고 다변화되어 침입탐지에 많은 어려움을 주고 있다. 시스템에 새로운 침입에 대한 탐지능력과 다량의 감사데이터의 효율적인 분석을 위해 데이터마이닝 기법이 적용된다. 침입탐지 방법 중 비정상행위 탐지는 모델링된 정상행위에서 벗어나는 행위들을 공격행위로 간주하는 기법이다. 비정상행위 탐지에서 정상행위 모델링을 하기 위해 연관규칙이나 빈발에피소드가 적용되었다. 그러나 이러한 기법들에서는 시간요소를 배제하거나 패턴들의 발생순서만을 다루기 때문에 정확하고 유용한 정보를 제공할 수 없다. 따라서 이 논문에서는 이 문제를 해결할 수 있는 시간연관규칙과 분류규칙을 이용한 비정상행위 탐지 모델을 제안하였다. 즉, 발생되는 패턴의 주기성과 달력표현을 이용, 유용한 시간지식표현을 갖는 시간연관규칙을 이용해 정상행위 프로파일을 생성하였고 이 프로파일에 의해 비정상행위로 간주되는 규칙들을 발견하고 보다 정확한 비정상행위 판별 여부를 결정하기 위해서 분류기법을 적용하였다.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.293-298
• /
• 2006

Many data are stored in database. For getting any information from many data, we use the query sentences. These information is basic and simple. Data mining method is various. In this paper, we manage clustering and association rules. We present a method for finding the better association rules, and we solve a problem of the existing association rules. We propose and apply a new clustering method to fit for association rules. It is not clustering of the existing distance basis or category basis. If we find association rules of each clusters, we can get not only existing rules found in all transaction but also rules that will be characteristics of clusters. Through this study, we can expect that we will reduce the number of many transaction access in large databases and find association of small group.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.261-264
• /
• 2007

퍼지 추론은 애매한 지식을 효과적으로 처리할 수 있는 장점이 있다. 그러나 규칙의 연관속성은 규칙을 과다하게 생성하기 때문에 유용하고 중요한 규칙을 결정하는데 여러 가지 문제점이었다. 본 논문에서는 퍼지 규칙에서 규칙간의 상관성을 고려하여 불필요한 속성을 제거하고, 퍼지규칙의 상대농도를 이용하여 추론결과의 정확성을 유지하면서 규칙의 수를 최소화 하는 방법을 제안한다. 제안한 방법의 타당성을 검증하기 위하여 기존의 규칙 감축 방법에 따른 출론 결과와 비교 검증하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.63-65
• /
• 2000

웹 개인화 기술의 발달은 많은 업체들이 기존 고객의 유지와 신규 고객의 확보를 위한 수단을 제공하였다. 현재의 개인화 기술은 크게 내용 기반 그리고 협력적 정보 여과 방식에 기반한 기술로 나뉘어질 수 있다. 내용 기반 정보 여과 방식에 기반한 개인화 기술은 멀티미디어 정보로 표현된 대부분의 웹 오브젝트(페이지, 이미지, 동영상, 사운드, 상품 등)에는 적용하기 어렵고, 협력적 정보 여과방식은 Cold Start Problem과 단일 도메인내에서의 개인화 서비스만이 가능하다는 문제점이 있다. 본 논문에서는 협력적 정보 여과 방식과 데이터 마이닝 기술 중의 연관 규칙 생성 방법을 혼합한 웹 개인화 시스템을 제안한다. 다양한 멀티미디어 형태로 표현되는 웹 오브젝트의 내용 분석이 어려우므로, 각각의 오브젝트를 하나의 아이템으로 인식하고 개인화 서비스를 시도하는 협력적 정보 여과 방식을 채택하였다. 협력적 정보 여과의 결과로 발견된 도메인별 유사 사용자의 웹 오브젝트 사용 정보를 연관 규칙 생성 알고리즘에 적용하여 오브젝트간의 연관성을 발견한다. 발견된 오브젝트간의 연관성은 서로 다른 정보 도메인의 오브젝트가 현재 사용자에게 흥미있는 것인가를 예측할 수 있는 자료로서 사용될 수 있다. 협력적 정보 여과 방식에 의해 생성된 오브젝트의 선호도값과 오브젝트 연관성 정보를 비교하여 사용자에게 개인화된 웹 서비스를 제공한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.84-86
• /
• 2008

The customer relation marketing in which companies can utilize to control and to get the filtered information efficiently has appeared. It is applying data mining to build the management that can even predict and recommend products to customers. In this paper, we proposed the adaptive customer relation management strategies using the association rules of data mining. The proposed method uses the association rules composes frequent customers with occurrence of candidate customer set creates the rules of associative customers. We analyzed the efficient feature of purchase customers using the hyper graph partition according to the lift of creative association rules. Therefore, we discovered strategies of the cross-selling and the up-selling about customers.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2741-2749
• /
• 2009

There have been many researches to detect and recover from faults on smart home environment, because these faults should lower its reliability. while, most of these researches have addressed functional defects of devices or software malfunction, few attempts have been made to deal with faults which may occur due to the inter relationships among devices. In this paper, we define the relationships among devices as rules, and propose a method for generating fault diagnosis knowledge which defines the symptoms and causes of faults. We classify the contexts of devices into two sets, depending on whether it satisfies the rules or not. when this method is applied to smart home environment, it is feasible not only to detect faults that may occur due to the relationships among devices but to identify their causes at real time.