• Title/Summary/Keyword: 연관 규칙 확장

Search Result 60, Processing Time 0.031 seconds

Design and Implementation of Rule Discovery Algorithm strongly coupled with Time-series databases (시계열 데이터베이스와 강결합된 규칙발견 알고리즘 설계와 구현)

  • 박인창;김성규
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.43-45
    • /
    • 2001
  • 마이닝 시스템은 그 특성에 따라 매우 다른 형태의 구현 방법이 존재한다. 그러므로 마이닝 시스템간 호환성이나 재사용성은 매우 낮다. 본 노문에서는 이 문제를 시계열 데이터베이스를 통한 RDB와 강 결합함으로써 표준화에 대한 문제를 해겨라고자 시도하였다. RDB와의 강 결합은 표준화 문제를 해결함과 더불어 마이닝 시스템에 DBMS의 관련 기술을 이용함으로써 성능을 극대화시킨다. 특히 DBMS의 인텍스 기능을 이용함으로써 마이닝 시스템의 성능 향상을 시도하였다. 본 논문에서는 기존의 순차패턴 탐사의 시간개념 부재, 트랜잭션 데이터베이스 기반구조, 그리고 알고리즘 수행에 있어서 메모리 한계에 따른 문제등의 단점을 지적하고, 이를 수정하고 보완하기 위해서 시간 거리와 패턴 길이의 개념을 확장하였으며 그에 따른 연관규칙의 관련 공식을 수정 보완하여 제안한다. 또한 RDB와의 강 결합되어 기존의 트랜잭션 데이터베이스 구조를 벗어나 시계열 데이터에 보다 쉽게 적용할 수 있는 절차와 알고리즘을 제안한다.

  • PDF

Item Filtering System Using Associative Relation Clustering Split Method (연관관계 군집 분할 방법을 이용한 아이템 필터링 시스템)

  • Cho, Dong-Ju;Park, Yang-Jae;Jung, Kyung-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.6
    • /
    • pp.1-8
    • /
    • 2007
  • In electronic commerce, it is important for users to recommend the proper item among large item sets with saving time and effort. Therefore, if the recommendation system can be recommended the suitable item, we will gain a good satisfaction to the user. In this paper, we proposed the associative relation clustering split method in the collaborative filtering in order to perform the accuracy and the scalability. We produce the lift between associative items using the ratings data. and then split the node group that consists of the item to improve an efficiency of the associative relation cluster. This method differs the association about the items of groups. If the association of groups is filled, the reminding items combine. To estimate the performance, the suggested method is compared with the K-means and EM in the MovieLens data set.

A study on environmental adaptation and expansion of intelligent agent (지능형 에이전트의 환경 적응성 및 확장성)

  • Baek, Hae-Jung;Park, Young-Tack
    • The KIPS Transactions:PartB
    • /
    • v.10B no.7
    • /
    • pp.795-802
    • /
    • 2003
  • To live autonomously, intelligent agents such as robots or virtual characters need ability that recognizes given environment, and learns and chooses adaptive actions. So, we propose an action selection/learning mechanism in intelligent agents. The proposed mechanism employs a hybrid system which integrates a behavior-based method using the reinforcement learning and a cognitive-based method using the symbolic learning. The characteristics of our mechanism are as follows. First, because it learns adaptive actions about environment using reinforcement learning, our agents have flexibility about environmental changes. Second, because it learns environmental factors for the agent's goals using inductive machine learning and association rules, the agent learns and selects appropriate actions faster in given surrounding and more efficiently in extended surroundings. Third, in implementing the intelligent agents, we considers only the recognized states which are found by a state detector rather than by all states. Because this method consider only necessary states, we can reduce the space of memory. And because it represents and processes new states dynamically, we can cope with the change of environment spontaneously.

Generator of Dynamic User Profiles Based on Web Usage Mining (웹 사용 정보 마이닝 기반의 동적 사용자 프로파일 생성)

  • An, Kye-Sun;Go, Se-Jin;Jiong, Jun;Rhee, Phill-Kyu
    • The KIPS Transactions:PartB
    • /
    • v.9B no.4
    • /
    • pp.389-390
    • /
    • 2002
  • It is important that acquire information about if customer has some habit in electronic commerce application of internet base that led in recommendation service for customer in dynamic web contents supply. Collaborative filtering that has been used as a standard approach to Web personalization can not get rapidly user's preference change due to static user profiles and has shortcomings such as reliance on user ratings, lack of scalability, and poor performance in the high-dimensional data. In order to overcome this drawbacks, Web usage mining has been prevalent. Web usage mining is a technique that discovers patterns from We usage data logged to server. Specially. a technique that discovers Web usage patterns and clusters patterns is used. However, the discovery of patterns using Afriori algorithm creates many useless patterns. In this paper, the enhanced method for the construction of dynamic user profiles using validated Web usage patterns is proposed. First, to discover patterns Apriori is used and in order to create clusters for user profiles, ARHP algorithm is chosen. Before creating clusters using discovered patterns, validation that removes useless patterns by Dempster-Shafer theory is performed. And user profiles are created dynamically based on current user sessions for Web personalization.

Analysis of Graph Mining based on Free-Tree (자유트리 기반의 그래프마이닝 기법 분석)

  • YoungSang No;Unil Yun;Keun Ho Ryu;Myung Jun Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.275-278
    • /
    • 2008
  • Recently, there are many research of datamining. On the transaction dataset, association rules is made by finding of interesting patterns. A part of mining, sub-structure mining is increased in interest of and applied to many high technology. But graph mining has more computing time then itemset mining. Therefore, that need efficient way for avoid duplication. GASTON is best algorithm of duplication free. This paper analyze GASTON and expect the future work.

Design of Automatic Indexing System Using Korean Morpheme Network (문법형태소 네트워크를 이용한 자동색인 시스템의 설계)

  • Ahn, Sung-Hyun;Chang, Jae-Woo
    • Annual Conference on Human and Language Technology
    • /
    • 1995.10a
    • /
    • pp.13-17
    • /
    • 1995
  • 본 논문은 한국어 특성을 적용하여 키워드를 자동으로 추출하는 기법을 제시한다. 기존에 제안된 명사 추출 시스템인 문법형태소 네트워크를 확장하여 단일 명사 뿐만 아니라 복합 명사를 색인어로 추출한다. 복합 명사는 단일 명사에 비해 보다 한정적 개념을 가지므로, 색인어로 추출될 때 문헌의 식별력을 높일 수 있다. 복합 명사를 구성하는 각각의 단일 명사를 인식함으로써 복합 명사를 분해하고, 간단한 구단위 구문분석을 수행하는 명사 결합 규칙에 따라 단일 명사들을 복합 명사로 합성하는 방법을 제시한다. 마지막으로 이와 같이 추출된 복합 명사에, 복합 명사를 구성하는 단일 명사간의 연관성을 고려하여 보다 정확한 가중치를 부여할 수 있는 새로운 가중치 부여 방안을 제시한다.

  • PDF

A Method for Generating Large-Interval Itemset using Locality of Data (데이터의 지역성을 이용한 빈발구간 항목집합 생성방법)

  • 박원환;박두순
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.465-475
    • /
    • 2001
  • Recent1y, there is growing attention on the researches of inducing association rules from large volume of database. One of them is the method that can be applied to quantitative attribute data. This paper presents a new method for generating large-interval itemsets, which uses locality for partitioning the range of data. This method can minimize the loss of data-inherent characteristics by generating denser large-interval items than other methods. Performance evaluation results show that our new approach is more efficient than previously proposed techniques.

  • PDF

Learning and Modeling of Neuro-Fuzzy modeling using Clustering and Fuzzy rules (클러스터링과 퍼지 규칙을 이용한 뉴로-퍼지 시스템 학습 및 모델링)

  • Kim, Sung-Suk;Kwak, Keun-Chang;Kim, Ju-Sik;Ryu, Jeong-Woong
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2879-2881
    • /
    • 2005
  • 본 논문에서는 뉴로-퍼지 모델의 전제부 소속함수의 새로운 학습방법을 통한 모델링 기법을 제안한다. 모델의 크기와 학습시간을 줄이는 기법으로 클러스터링 기법을 이용한 모델의 초기 파라미터 결정 방법이 있다. 이는 클러스터링 후 이들 파라미터를 다시 모델에 적용하여 모델을 학습하는 순차적 방법으로써 모델의 학습이 끝난 후의 전제부 파라미터가 클러스터링 파라미터와 연관성을 가지지 못하는 경우가 발생하였다. 또한 오차미분 기반 학습에서는 전제부 초기치가 국부적 최적해에서 벋어나지 못하는 문제점을 가지고 있다. 본 논문에서는 자율적으로 클러스터의 수를 추정하며 이들 파라미터를 최적화하며 이를 이용하여 뉴로-퍼지 모델의 학습을 실시하는 학습기법을 제안하였다. 제안된 방법에서는 기존의 오차미분 기반 학습을 클러스터링 기반 학습으로 확장하였으며 이를 이용한 모델의 성능을 기존의 연구결과와 비교하여 우수성을 보인다.

  • PDF

A Rule Extraction Method Using Relevance Factor for FMM Neural Networks (FMM 신경망에서 연관도요소를 이용한 규칙 추출 기법)

  • Lee, Seung-Kang;Lee, Jae-Hyuk;Kim, Ho-Joon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.377-380
    • /
    • 2012
  • 본 연구에서는 학습데이터의 빈도요소를 반영하도록 수정된 구조의 FMM 신경망을 소개하고, 이로부터 패턴 분류를 위한 지식 표현을 생성하는 방법론을 제안한다. 하이퍼박스 멤버쉽함수는 5종류의 퍼지 분할을 기반으로 설정한 구간에 대하여 소속정도를 반영하여 결정하며, 각 차원별로 특징범위의 폭과 빈도 요소로부터 가중치 값이 학습된다. 본 연구에서는 제안된 이론을 수화인식 문제를 대상으로 고찰하였다. 인식 시스템의 구성은 특징추출을 위하여 3차원으로 확장된 구조의 CNN 모델을 사용하였으며, 수화패턴 데이터의 표현은 모션 히스토리 볼륨(Motion History Volume) 구조를 기반으로 하였다. 6종류의 수화패턴 동영상으로부터 27개 특징요소를 추출하고 이를 사용한 FMM 신경망의 학습과정과 지식의 추출 과정을 실험으로 보이고 그 유용성을 고찰한다.

Development of Intelligent Job Classification System based on Job Posting on Job Sites (구인구직사이트의 구인정보 기반 지능형 직무분류체계의 구축)

  • Lee, Jung Seung
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.123-139
    • /
    • 2019
  • The job classification system of major job sites differs from site to site and is different from the job classification system of the 'SQF(Sectoral Qualifications Framework)' proposed by the SW field. Therefore, a new job classification system is needed for SW companies, SW job seekers, and job sites to understand. The purpose of this study is to establish a standard job classification system that reflects market demand by analyzing SQF based on job offer information of major job sites and the NCS(National Competency Standards). For this purpose, the association analysis between occupations of major job sites is conducted and the association rule between SQF and occupation is conducted to derive the association rule between occupations. Using this association rule, we proposed an intelligent job classification system based on data mapping the job classification system of major job sites and SQF and job classification system. First, major job sites are selected to obtain information on the job classification system of the SW market. Then We identify ways to collect job information from each site and collect data through open API. Focusing on the relationship between the data, filtering only the job information posted on each job site at the same time, other job information is deleted. Next, we will map the job classification system between job sites using the association rules derived from the association analysis. We will complete the mapping between these market segments, discuss with the experts, further map the SQF, and finally propose a new job classification system. As a result, more than 30,000 job listings were collected in XML format using open API in 'WORKNET,' 'JOBKOREA,' and 'saramin', which are the main job sites in Korea. After filtering out about 900 job postings simultaneously posted on multiple job sites, 800 association rules were derived by applying the Apriori algorithm, which is a frequent pattern mining. Based on 800 related rules, the job classification system of WORKNET, JOBKOREA, and saramin and the SQF job classification system were mapped and classified into 1st and 4th stages. In the new job taxonomy, the first primary class, IT consulting, computer system, network, and security related job system, consisted of three secondary classifications, five tertiary classifications, and five fourth classifications. The second primary classification, the database and the job system related to system operation, consisted of three secondary classifications, three tertiary classifications, and four fourth classifications. The third primary category, Web Planning, Web Programming, Web Design, and Game, was composed of four secondary classifications, nine tertiary classifications, and two fourth classifications. The last primary classification, job systems related to ICT management, computer and communication engineering technology, consisted of three secondary classifications and six tertiary classifications. In particular, the new job classification system has a relatively flexible stage of classification, unlike other existing classification systems. WORKNET divides jobs into third categories, JOBKOREA divides jobs into second categories, and the subdivided jobs into keywords. saramin divided the job into the second classification, and the subdivided the job into keyword form. The newly proposed standard job classification system accepts some keyword-based jobs, and treats some product names as jobs. In the classification system, not only are jobs suspended in the second classification, but there are also jobs that are subdivided into the fourth classification. This reflected the idea that not all jobs could be broken down into the same steps. We also proposed a combination of rules and experts' opinions from market data collected and conducted associative analysis. Therefore, the newly proposed job classification system can be regarded as a data-based intelligent job classification system that reflects the market demand, unlike the existing job classification system. This study is meaningful in that it suggests a new job classification system that reflects market demand by attempting mapping between occupations based on data through the association analysis between occupations rather than intuition of some experts. However, this study has a limitation in that it cannot fully reflect the market demand that changes over time because the data collection point is temporary. As market demands change over time, including seasonal factors and major corporate public recruitment timings, continuous data monitoring and repeated experiments are needed to achieve more accurate matching. The results of this study can be used to suggest the direction of improvement of SQF in the SW industry in the future, and it is expected to be transferred to other industries with the experience of success in the SW industry.