• Title/Summary/Keyword: 순차 규칙 마이닝

Search Result 33, Processing Time 0.041 seconds

A Process Mining using Association Rule and Sequence Pattern (연관규칙과 순차패턴을 이용한 프로세스 마이닝)

  • Chung, So-Young;Kwon, Soo-Tae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.31 no.2
    • /
    • pp.104-111
    • /
    • 2008
  • A process mining is considered to support the discovery of business process for unstructured process model, and a process mining algorithm by using the associated rule and sequence pattern of data mining is developed to extract information about processes from event-log, and to discover process of alternative, concurrent and hidden activities. Some numerical examples are presented to show the effectiveness and efficiency of the algorithm.

Study on the Usability Based on Web Mining in Army College Library Homepage (웹마이닝을 통한 도서관 홈페이지의 사용편의성에 관한 연구 - 육군대학 도서관 홈페이지를 중심으로 -)

  • 손용배;이응봉
    • Proceedings of the Korean Society for Information Management Conference
    • /
    • 2001.08a
    • /
    • pp.213-218
    • /
    • 2001
  • 본 연구는 육군대학 도서관 홈페이지의 웹서버에 저장되어 있는 로그파일을 실험 데이터로 사용하여, 기존 데이터마이닝(data mining)의 기법들 중에서 연관규칙(association rules) 탐사 기법을 적용함으로써, 사용자들의 웹 항행에 대한 순차패턴을 추출하였다. 이를 분석하여 실제 사용자들이 효과적으로 사용할 수 있는 웹사이트 디자인을 제안하고 나아가 대상 웹사이트의 사용편의성을 평가하였다.

  • PDF

Temporal Data Mining Framework (시간 데이타마이닝 프레임워크)

  • Lee, Jun-Uk;Lee, Yong-Jun;Ryu, Geun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.365-380
    • /
    • 2002
  • Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from large quantities of temporal data. Temporal knowledge, expressible in the form of rules, is knowledge with temporal semantics and relationships, such as cyclic pattern, calendric pattern, trends, etc. There are many examples of temporal data, including patient histories, purchaser histories, and web log that it can discover useful temporal knowledge from. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering temporal knowledge from temporal data, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treated data in database at best as data series in chronological order and did not consider temporal semantics and temporal relationships containing data. In order to solve this problem, we propose a theoretical framework for temporal data mining. This paper surveys the work to date and explores the issues involved in temporal data mining. We then define a model for temporal data mining and suggest SQL-like mining language with ability to express the task of temporal mining and show architecture of temporal mining system.

On-Line Mining using Association Rules and Sequential Patterns in Electronic Commerce (전자상거래에서 연관규칙과 순차패턴을 이용한 온라인 마이닝)

  • 김성학
    • 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.

  • PDF

Classification of Protein Sequence Using Sequential Pattern Mining (순차 패턴 마이닝 기법을 이용한 단백질 서열 분류)

  • 정광호;김진수;최성용;한승진;이정현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.298-300
    • /
    • 2004
  • 기존의 생물정보학 연구는 전체 서열들의 매칭을 통한 상동성 연구에 중점을 두고 진행되어 왔다 최근에 서열 데이터베이스의 급격한 증가와 게놈 정보가 축적됨에 따라 서열로부터 다양한 정보를 얻기 위해 서열 데이터 분석에 마이닝 기법을 접목시키고자 하는 다양한 기술들이 제안되고 있다. 단백질과 DNA의 서열 비교는 생물정보학의 기본 작업 기운데 하나이다. 신속하고 자동화 된 서열 비교 능력은 새로운 서열에 대한 기능 판별 및 분석 등 모든 작업을 용이하게 한다 본 논문에서는 동종의 단백질 서열들을 다중 정렬하여 일치하는 구간을 찾아내고, 그 구간에서 아미노산 코드와 위치정보를 이용해 동종 서열들 간의 특정한 패턴 규칙을 찾아내고, 새로운 서열에서 어떤 서열 필턴 특징이 발생하는지를 찾아냄으로써 서얼을 분류하는 방법을 제안한다.

  • PDF

Web Mining for Discovering Interesting Information using Effective Clustering (효율적인 클러스터링을 이용한 관심 정보 추출을 위한 웹 마이닝)

  • Kim, Sung-Hark;Ahn, Byeong-Tae
    • Journal of Digital Contents Society
    • /
    • v.9 no.2
    • /
    • pp.251-260
    • /
    • 2008
  • In internet being a repository of massive information, we easily may not find our desired information, this issue also exists in e-commerce which gets rapid growth. In most of e-commerce sites, the methods furnishing information have been made use of statistical analysis or simple process by category-oriented, but these can't represent diverse correlation among products information and also hardly reflect users' purchasing patterns precisely. In this thesis, we propose more efficient web mining ways for discovering interesting information using effective clustering in e-commerce, which get achieved more suitable relationship among products information using both sequential patterns and association rules in category-independent, and experiments show the efficiency of our proposed methods. And we propose search using effective clustering rapidly.

  • PDF

Efficient Mining of User Behavior patterns by classification of age based on location information (위치에 따른 연령대별 유용한 행동패턴 추출 기법)

  • Kim, HyeRan;Lee, SeungCheol;Kim, UngMo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.250-253
    • /
    • 2007
  • 통신기술의 발달로 무선단말기의 보급이 급증하고 무선 네트워크 사용이 일반화됨으로써, 최근 유비쿼터스 컴퓨팅 기술이 중요한 이슈가 되고 있다. 유비쿼터스 컴퓨팅은 시간과 장소의 한계를 넘어 사용자가 하고자 하는 일을 컴퓨팅 환경이 상황을 인지하여 돕는 것을 가능하게 한다. 상황인지를 위해 순차패턴과 시간 연관규칙 탐사를 이용하여 사용자의 행동패턴을 추출하는 연구가 활발히 진행되고 있다. 이러한 연구를 통한 행동패턴은 사용자의 특성을 간과하게 되며, 각 사용자에게 더욱 유용한 서비스를 제공하기 위해서는 사용자를 분류하는 것이 필요하다. 그러나 기존의 연구는 단지 통계적인 사용자의 빈발 행동패턴만을 추출하여 각 사용자의 관심사와는 무관한 서비스 제공이 이루어질 수 있다. 성별, 나이, 직업 등의 개인정보와 위치를 고려하여 사용자에게 더욱 더 효율적이고 유용한 서비스를 제공할 수 있도록 행동패턴을 유형별로 분류할 필요가 있다. 본 논문에서는 각 위치에 따른 사용자의 연령대별 유용한 행동패턴을 추출하여 정확한 서비스를 제공할 수 있는 마이닝 기법을 제안한다.

  • PDF

A Dynamic Recommendation System Using User Log Analysis and Document Similarity in Clusters (사용자 로그 분석과 클러스터 내의 문서 유사도를 이용한 동적 추천 시스템)

  • 김진수;김태용;최준혁;임기욱;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.5
    • /
    • pp.586-594
    • /
    • 2004
  • Because web documents become creation and disappearance rapidly, users require the recommend system that offers users to browse the web document conveniently and correctly. One largely untapped source of knowledge about large data collections is contained in the cumulative experiences of individuals finding useful information in the collection. Recommendation systems attempt to extract such useful information by capturing and mining one or more measures of the usefulness of the data. The existing Information Filtering system has the shortcoming that it must have user's profile. And Collaborative Filtering system has the shortcoming that users have to rate each web document first and in high-quantity, low-quality environments, users may cover only a tiny percentage of documents available. And dynamic recommendation system using the user browsing pattern also provides users with unrelated web documents. This paper classifies these web documents using the similarity between the web documents under the web document type and extracts the user browsing sequential pattern DB using the users' session information based on the web server log file. When user approaches the web document, the proposed Dynamic recommendation system recommends Top N-associated web documents set that has high similarity between current web document and other web documents and recommends set that has sequential specificity using the extracted informations and users' session information.

Design and Analysis of Efficient Operation Sequencing in FMC Robot Using Simulation and Sequential Patterns (시뮬레이션과 순차 패턴을 이용한 FMC 로봇의 효율적 작업 순서 설계 및 분석)

  • Kim, Sun-Gil;Kim, Youn-Jin;Lee, Hong-Chul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.6
    • /
    • pp.2021-2029
    • /
    • 2010
  • This paper suggested the method to design and analyze FMC robot's dispatching rule using the Simulation and Sequential Patterns. To do this, first of all, we built FMC using simulation and then, extracted signals that facilities call a robot, saved it as the log type. Secondly, we built robot's optimal path using the Sequential Pattern Mining with the results of analyzing the log and relationship between machine and robot actions. Lastly, we adapted it to the A corp.'s manufacturing line for verifying its performance. As a result of applying the new dispatching rule in FMC, total throughput and total flow time decrease because of decreasing material loss time and increasing robot utility. Furthermore, because this method can be applied for every manufacturing plant using simulation, it can contribute to advance total FMC efficiency as well.

An Interpretable Log Anomaly System Using Bayesian Probability and Closed Sequence Pattern Mining (베이지안 확률 및 폐쇄 순차패턴 마이닝 방식을 이용한 설명가능한 로그 이상탐지 시스템)

  • Yun, Jiyoung;Shin, Gun-Yoon;Kim, Dong-Wook;Kim, Sang-Soo;Han, Myung-Mook
    • Journal of Internet Computing and Services
    • /
    • v.22 no.2
    • /
    • pp.77-87
    • /
    • 2021
  • With the development of the Internet and personal computers, various and complex attacks begin to emerge. As the attacks become more complex, signature-based detection become difficult. It leads to the research on behavior-based log anomaly detection. Recent work utilizes deep learning to learn the order and it shows good performance. Despite its good performance, it does not provide any explanation for prediction. The lack of explanation can occur difficulty of finding contamination of data or the vulnerability of the model itself. As a result, the users lose their reliability of the model. To address this problem, this work proposes an explainable log anomaly detection system. In this study, log parsing is the first to proceed. Afterward, sequential rules are extracted by Bayesian posterior probability. As a result, the "If condition then results, post-probability" type rule set is extracted. If the sample is matched to the ruleset, it is normal, otherwise, it is an anomaly. We utilize HDFS datasets for the experiment, resulting in F1score 92.7% in test dataset.