• Title/Summary/Keyword: Rule Extraction

Search Result 52, Processing Time 0.421 seconds

Development of Datamining Roadmap and Its Application to Water Treatment Plant for Coagulant Control (데이터마이닝 로드맵 개발과 수처리 응집제 제어를 위한 데이터마이닝 적용)

  • Bae, Hyeon;Kim, Sung-Shin;Kim, Ye-Jin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.7
    • /
    • pp.1582-1587
    • /
    • 2005
  • In coagulant control of water treatment plants, rule extraction, one of datamining categories, was performed for coagulant control of a water treatment plant. Clustering methods were applied to extract control rules from data. These control rules can be used for fully automation of water treatment plants instead of operator's knowledge for plant control. To perform fuzzy clustering, there are some coefficients to be determined and these kinds of studies have been performed over decades such as clustering indices. In this study, statistical indices were taken to calculate the number of clusters. Simultaneously, seed points were found out based on hierarchical clustering. These statistical approaches give information about features of clusters, so it can reduce computing cost and increase accuracy of clustering. The proposed algorithm can play an important role in datamining and knowledge discovery.

Improved rule extraction from artificial neural network using CDRPs (CDRPs를 이용한 인공 신경망에서 추출된 규칙 개선방법)

  • Lee, Hurn-Joo;Kim, Hyeoncheol
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.554-556
    • /
    • 2018
  • 최근 인공 신경망은 다양한 분야에서 뛰어난 성능을 보여주고 있지만 인공 신경망이 학습한 지식이 어떠한 내용인지를 사람이 이해하기 어렵다는 문제점이 있다. 이와 같은 문제점을 해결하기 위한 방법 중 하나로 인공 신경망으로부터 인간이 이해할 수 있는 형태의 규칙을 추출하는 방법들이 고안이 되었다. 본 연구에서는 규칙추출 알고리즘 중 하나인 OAS 알고리즘을 이용해 규칙을 추출해보고 CDRPs(Critical Data Routing Paths)를 활용하여 추출한 규칙의 품질을 개선하는 방법을 제시하였다.

Reinforcement Learning with Clustering for Function Approximation and Rule Extraction (함수근사와 규칙추출을 위한 클러스터링을 이용한 강화학습)

  • 이영아;홍석미;정태충
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.11
    • /
    • pp.1054-1061
    • /
    • 2003
  • Q-Learning, a representative algorithm of reinforcement learning, experiences repeatedly until estimation values about all state-action pairs of state space converge and achieve optimal policies. When the state space is high dimensional or continuous, complex reinforcement learning tasks involve very large state space and suffer from storing all individual state values in a single table. We introduce Q-Map that is new function approximation method to get classified policies. As an agent learns on-line, Q-Map groups states of similar situations and adapts to new experiences repeatedly. State-action pairs necessary for fine control are treated in the form of rule. As a result of experiment in maze environment and mountain car problem, we can achieve classified knowledge and extract easily rules from Q-Map

Intelligent Distributed Platform using Mobile Agent based on Dynamic Group Binding (동적 그룹 바인딩 기반의 모바일 에이전트를 이용한 인텔리전트 분산 플랫폼)

  • Mateo, Romeo Mark A.;Lee, Jae-Wan
    • Journal of Internet Computing and Services
    • /
    • v.8 no.3
    • /
    • pp.131-143
    • /
    • 2007
  • The current trends in information technology and intelligent systems use data mining techniques to discover patterns and extract rules from distributed databases. In distributed environment, the extracted rules from data mining techniques can be used in dynamic replications, adaptive load balancing and other schemes. However, transmission of large data through the system can cause errors and unreliable results. This paper proposes the intelligent distributed platform based on dynamic group binding using mobile agents which addresses the use of intelligence in distributed environment. The proposed grouping service implements classification scheme of objects. Data compressor agent and data miner agent extracts rules and compresses data, respectively, from the service node databases. The proposed algorithm performs preprocessing where it merges the less frequent dataset using neuro-fuzzy classifier before sending the data. Object group classification, data mining the service node database, data compression method, and rule extraction were simulated. Result of experiments in efficient data compression and reliable rule extraction shows that the proposed algorithm has better performance compared to other methods.

  • PDF

Real-time Fault Detection and Classification of Reactive Ion Etching Using Neural Networks (Neural Networks을 이용한 Reactive Ion Etching 공정의 실시간 오류 검출에 관한 연구)

  • Ryu Kyung-Han;Lee Song-Jae;Soh Dea-Wha;Hong Sang-Jeen
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.7
    • /
    • pp.1588-1593
    • /
    • 2005
  • In coagulant control of water treatment plants, rule extraction, one of datamining categories, was performed for coagulant control of a water treatment plant. Clustering methods were applied to extract control rules from data. These control rules can be used for fully automation of water treatment plants instead of operator's knowledge for plant control. To perform fuzzy clustering, there are some coefficients to be determined and these kinds of studies have been performed over decades such as clustering indices. In this study, statistical indices were taken to calculate the number of clusters. Simultaneously, seed points were found out based on hierarchical clustering. These statistical approaches give information about features of clusters, so it can reduce computing cost and increase accuracy of clustering. The proposed algorithm can play an important role in datamining and knowledge discovery.

Trading rule extraction in stock market using the rough set approach

  • Kim, Kyoung-jae;Huh, Jin-nyoung;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 1999.10a
    • /
    • pp.337-346
    • /
    • 1999
  • In this paper, we propose the rough set approach to extract trading rules able to discriminate between bullish and bearish markets in stock market. The rough set approach is very valuable to extract trading rules. First, it does not make any assumption about the distribution of the data. Second, it not only handles noise well, but also eliminates irrelevant factors. In addition, the rough set approach appropriate for detecting stock market timing because this approach does not generate the signal for trade when the pattern of market is uncertain. The experimental results are encouraging and prove the usefulness of the rough set approach for stock market analysis with respect to profitability.

  • PDF

Development of a Knowledge Discovery System using Hierarchical Self-Organizing Map and Fuzzy Rule Generation

  • Koo, Taehoon;Rhee, Jongtae
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.431-434
    • /
    • 2001
  • Knowledge discovery in databases(KDD) is the process for extracting valid, novel, potentially useful and understandable knowledge form real data. There are many academic and industrial activities with new technologies and application areas. Particularly, data mining is the core step in the KDD process, consisting of many algorithms to perform clustering, pattern recognition and rule induction functions. The main goal of these algorithms is prediction and description. Prediction means the assessment of unknown variables. Description is concerned with providing understandable results in a compatible format to human users. We introduce an efficient data mining algorithm considering predictive and descriptive capability. Reasonable pattern is derived from real world data by a revised neural network model and a proposed fuzzy rule extraction technique is applied to obtain understandable knowledge. The proposed neural network model is a hierarchical self-organizing system. The rule base is compatible to decision makers perception because the generated fuzzy rule set reflects the human information process. Results from real world application are analyzed to evaluate the system\`s performance.

  • PDF

Bayesian Learning based Fuzzy Rule Extraction for Clustering (군집화를 위한 베이지안 학습 기반의 퍼지 규칙 추출)

  • 한진우;전성해;오경환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.389-391
    • /
    • 2003
  • 컴퓨터 학습의 군집화는 주어진 데이터를 서로 유사한 몇 개의 집단으로 묶는 작업을 수행한다. 군집화를 위한 유사도 결정을 위한 측도는 많은 기법들에서 매우 다양한 측도들이 사용되고 또한 연구되어 왔다. 하지만 군집화의 결과에 대한 성능측정에 대한 객관적인 기준 설정이 어렵기 때문에 군집화 결과에 대한 해석은 매우 주관적이고 애매한 경우가 많다. 퍼지 군집화는 이러한 애매한 군집화 문제에 있어서 융통성 있는 군집 결정 방안을 제시해 준다. 각 개체들이 특정 군집에 속하게 될 퍼지 멤버 함수값을 원소로 하는 유사도 행렬을 통하여 군집화를 수행한다. 본 논문에서는 베이지안 학습을 통하여 군집화를 위한 퍼지 멤버 함수값을 구하였다. 본 연구에서는 최적의 퍼지 군집화 수행을 위하여 베이지안 학습 기반의 퍼지 규칙을 추출하였다. 인공적으로 만든 데이터와 기존의 기계 학습 데이터를 이용한 실험을 통하여 제안 방법의 성능을 확인하였다.

  • PDF

A Data Mining Technique for Customer Behavior Association Analysis in Cyber Shopping Malls (가상상점에서 고객 행위 연관성 분석을 위한 데이터 마이닝 기법)

  • 김종우;이병헌;이경미;한재룡;강태근;유관종
    • The Journal of Society for e-Business Studies
    • /
    • v.4 no.1
    • /
    • pp.21-36
    • /
    • 1999
  • Using user monitoring techniques on web, marketing decision makers in cyber shopping malls can gather customer behavior data as well as sales transaction data and customer profiles. In this paper, we present a marketing rule extraction technique for customer behavior analysis in cyber shopping malls, The technique is an application of market basket analysis which is a representative data mining technique for extracting association rules. The market basket analysis technique is applied on a customer behavior log table, which provide association rules about web pages in a cyber shopping mall. The extracted association rules can be used for mall layout design, product packaging, web page link design, and product recommendation. A prototype cyber shopping mall with customer monitoring features and a customer behavior analysis algorithm is implemented using Java Web Server, Servlet, JDBC(Java Database Connectivity), and relational database on windows NT.

  • PDF

An Automatic Fuzzy Rule Extraction using an Advanced Quantum Clustering and It's Application to Nonlinear Regression (개선된 Quantum 클러스터링을 이용한 자동적인 퍼지규칙 생성 및 비선형 회귀로의 응용)

  • Kim, Sung-Suk;Kwak, Keun-Chang
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.182-183
    • /
    • 2007
  • 본 논문에서는 전형적인 비선형 회귀문제를 다루기 위해 슈뢰딩거 방정식에 의해 표현되는 Hilbert공간에서 수행되는 Quantum 클러스터링과 Mountain 함수를 이용하여, 수치적인 입출력데이터로부터 TSK 형태의 자동적인 퍼지 if-then 규칙의 생성방법을 제안한다. 여기서 슈뢰딩거 방정식은 분석적으로 확률함수로부터 유도되어질 수 있는 포텐셜 함수를 포함한다. 이 포텐셜의 최소점들은 데이터의 특성을 포함하는 클러스터 중심들과 관련되어진다. 그러나 이들 클러스터 중심들은 데이터의 수와 같으므로 퍼지 규칙을 생성하기 어려울 뿐만 아니라 수렴속도가 느린 문제점을 가지고 있다. 이러한 문제점들을 해결하기 위해서, 본 논문에서는 밀도 척도에 기초한 클러스터 중심의 근사적인 추정에 대해 간단하면서 효과적인 Mountain 함수를 이용하여 효과적인 클러스터 중심을 얻음과 동시에 적응 뉴로-퍼지 네트워크의 자동적인 퍼지 규칙을 생성하도록 한다. 자동차 MPG 예측문제에 대한 시뮬레이션 결과는 제안된 방법이 기존 문헌에서 제시한 예측성능보다 더 좋은 특성을 보임을 알 수 있었다.

  • PDF