• Title/Summary/Keyword: 연관 규칙 마이닝

Search Result 286, Processing Time 0.024 seconds

Network Anomaly Detection using Association Rule Mining in Network Packets (네트워크 패킷에 대한 연관 마이닝 기법을 적용한 네트워크 비정상 행위 탐지)

  • Oh, Sang-Hyun;Chang, Joong-Hyuk
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.3
    • /
    • pp.22-29
    • /
    • 2009
  • In previous work, anomaly-based intrusion detection techniques have been widely used to effectively detect various intrusions into a computer. This is because the anomaly-based detection techniques can effectively handle previously unknown intrusion methods. However, most of the previous work assumed that the normal network connections are fixed. For this reason, a new network connection may be regarded as an anomalous event. This paper proposes a new anomaly detection method based on an association-mining algorithm. The proposed method is composed of two phases: intra-packet association mining and inter-packet association mining. The performances of the proposed method are comparatively verified with JAM, which is a conventional representative intrusion detection method.

Mining Association Rules on Significant Rare Data using Relative Support (상대 지지도를 이용한 의미 있는 희소 항목에 대한 연관 규칙 탐사 기법)

  • Ha, Dan-Shim;Hwang, Bu-Hyun
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.577-586
    • /
    • 2001
  • Recently data mining, which is analyzing the stored data and discovering potential knowledge and information in large database is a key research topic in database research data In this paper, we study methods of discovering association rules which are one of data mining techniques. And we propose a technique of discovering association rules using the relative support to consider significant rare data which have the high relative support among some data. And we compare and evaluate existing methods and the proposed method of discovering association rules for discovering significant rare data.

  • PDF

Association Rules Reflected Temporal Information (시정보 반영을 통한 연관규칙의 신뢰도 측정)

  • Ok, Jee-Woong;Paik, Ju-Ryon;Kim, Ung-Mo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.11a
    • /
    • pp.353-356
    • /
    • 2006
  • 연관규칙 (Association rule) 마이닝은 무수히 많은 데이터로부터 유용한 정보만을 뽑아내어 실생활에 적용하여 이점을 얻게 하는 데이터마이닝의 가장 핵심적인 연구분야이다. 마켓 기반 데이터들로부터 고객들의 구매유형을 분석하여 적절한 판매전략을 세우거나 기업 데이터로부터 특정 업무와 관련된 의사결정을 지원하는 등의 일이 모두 연관규칙을 기반으로 한다. 그러나 대부분의 연관규칙들은 시간을 고려하지 않는 않거나, 순차패턴만을 고려해왔다. 따라서 하루중 특정 규칙이 발생되지 않는 시간대에도 그 규칙에 대한 불필요한 노력이 있었다. 본 논문에서는 추출된 연관규칙들과 각 트랜잭션에 부여한 시간 정보를 분석하여 특정 항목 (Item) 집합들 간의 연관규칙이 빈번하게 발생하는 시간대를 추출한다. 추출되 시간 정보를 이용하여 시간대별 유용한 판매 전략을 세움으로써, 상품 판매를 극대화하고자 한다.

  • PDF

Design and Implementation of Spatial Association Rule Discovery System for Spatial Data Analysis (공간 데이터 분석을 위한 공간 연관 규칙 탐사 시스템의 설계 및 구현)

  • Ahn, Chan-Min;Lee, Yun-Seok;Park, Sang-Ho;Lee, Ju-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.27-34
    • /
    • 2006
  • Recently, the study about the technology which effectively manage spatial information is actively conducted. For the effective knowledge inquiry, various extended data mining methods are applied in spatial data mining. However, former spatial association rule system appears the problem that does not reflect various non-spatial property along the inquiries because it searches the rule from the calculation among predicates. To resolve the problem, present study suggests the system that extends the inquiries using in spatial database, searches the association rule among non-spatial object property after setting the data based on space information. Especially, the model which is applicable to geographical information system is embodied. Embodied system with this method enables to search more useful spatial association rule in real life since it shows high migration property with extended spatial database and considers spatial property and various non-spatial property.

  • PDF

Standardization for basic association measures in association rule mining (연관 규칙 마이닝에서의 평가기준 표준화 방안)

  • Park, Hee-Chang
    • 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.

Association rule ranking function by decreased lift influence (향상도 영향 감소화에 의한 연관성 순위결정함수)

  • Park, Hee-Chang
    • 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.

XOnto-Apriori: An eXtended Ontology Reasoning-based Association Rule Mining Algorithm (XOnto-Apriori: 확장된 온톨로지 추론 기반의 연관 규칙 마이닝 알고리즘)

  • Lee, Chong-Hyeon;Kim, Jang-Won;Jeong, Dong-Won;Lee, Suk-Hoon;Baik, Doo-Kwon
    • The KIPS Transactions:PartD
    • /
    • v.18D no.6
    • /
    • pp.423-432
    • /
    • 2011
  • In this paper, we introduce XOnto-Apriori algorithm which is an extension of the Onto-Apriori algorithm. The extended algorithm is designed to improve the conventional algorithm's problem of comparing only identifiers of transaction items by reasoning transaction properties of the items which belong in the same category. We show how the mining algorithm works with a smartphone application recommender system based on our extended algorithm to clearly describe the procedures providing personalized recommendations. Further, our simulation results validate our analysis on the algorithm overhead, precision, and recall.

Design and Implementation of Analysis System for Answer Dataset with Data Mining (데이터 마이닝을 이용한 시험 응답데이터 분석시스템 설계 및 구현)

  • Kwak, Eun-Young;Kim, Hyeoncheol
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.1
    • /
    • pp.65-74
    • /
    • 2008
  • In this paper, we introduce an analysis system for answer dataset by using a data mining method. We analyze students' answer data collected from a test including multiple choice question items, and find associations between the items. Analysis of evaluation results based on our system will not only provide correct information on students' achievement levels but also provides a basis for modifying weaknesses of the evaluation procedures, question items, or teaching/learning procedures. Furthermore, it will enable us to improve the quality of question items for future use so that we can secure itemsets of high quality.

  • PDF

Association Rule Mining for Space Reduction and Performance Improvement (저장공간 축소와 실행시간 개선을 고려한 연관규칙 마이닝)

  • 한영우;이수원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.337-339
    • /
    • 2002
  • 연관규칙 탐사기법은 거래(사건) 속에 포함된 품목(항목)간의 연관관계를 발견하고자 할 때 사용하는 기법이며, 독특한 형태의 자료구조를 사용하는 다양한 연관규칙 알고리즘들이 제안되었다. 다양한 특성을 갖는 대용량의 데이터에 대해 효율적으로 연관규칙 탐사를 수행하기 위해서는 저장공간과 실행시간을 모두 고려해야 한다. 본 논문에서는 후보항목집합 발생과정 없이 압축빈발항목집합과 동적링크집합을 이용하여 저장공간 축소와 실행시간 개선을 동시에 고려한 연관규칙 알고리즘을 제안하며, 그 우수성을 증명하기 위해 연관규칙 탐사의 대표적인 자료 구조인 FP-struct, H-Struct와의 저장공간 비교 및 이들 저장구조를 사용하는 FP-growth, H-mine 알고리즘과의 실행시간을 비교한다.

  • PDF

Implementation of Association Rules Creation System from GML Documents (GML 문서에서 연관규칙 생성 시스템 구현)

  • Kim, Eui-Chan;Hwang, Byung-Yeon
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.1 s.16
    • /
    • pp.27-35
    • /
    • 2006
  • As the increasing interest about geographical information, such researches and applied fields become wide. OGC(Open GIS Consortium) developed GML(Geography Markup Language) which is adopted XML(extensible Markup Language) in GIS field. In various applied field, GML is used and studied continuously. This paper try to find out the meaningful rules using Apriori algorithm from GML documents, one of the data mining techniques which is studied based on existing XML documents There are two ways to find out the rules. One is the way that find out the related rules as extracting the content in GML documents, the other find out the related rules based on used tags and attributes. This paper describes searching the rules through two ways and shows the system adopted two ways.

  • PDF