• Title/Summary/Keyword: rule extraction

Search Result 200, Processing Time 0.025 seconds

Extraction of Classification Boundary for Fuzzy Partitions and Its Application to Pattern Classification (퍼지 분할을 위한 분류 경계의 추출과 패턴 분류에의 응용)

  • Son, Chang-S.;Seo, Suk-T.;Chung, Hwan-M.;Kwon, Soon-H.
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.685-691
    • /
    • 2008
  • The selection of classification boundaries in fuzzy rule- based classification systems is an important and difficult problem. So various methods based on learning processes such as neural network, genetic algorithm, and so on have been proposed for it. In a previous study, we pointed out the limitation of the methods and discussed a method for fuzzy partitioning in the overlapped region on feature space in order to overcome the time-consuming when the additional parameters for tuning fuzzy membership functions are necessary. In this paper, we propose a method to determine three types of classification boundaries(i.e., non-overlapping, overlapping, and a boundary point) on the basis of statistical information of the given dataset without learning by extending the method described in the study. Finally, we show the effectiveness of the proposed method through experimental results applied to pattern classification problems using the modified IRIS and standard IRIS datasets.

On Robust Principal Component using Analysis Neural Networks (신경망을 이용한 로버스트 주성분 분석에 관한 연구)

  • Kim, Sang-Min;Oh, Kwang-Sik;Park, Hee-Joo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.7 no.1
    • /
    • pp.113-118
    • /
    • 1996
  • Principal component analysis(PCA) is an essential technique for data compression and feature extraction, and has been widely used in statistical data analysis, communication theory, pattern recognition, and image processing. Oja(1992) found that a linear neuron with constrained Hebbian learning rule can extract the principal component by using stochastic gradient ascent method. In practice real data often contain some outliers. These outliers will significantly deteriorate the performances of the PCA algorithms. In order to make PCA robust, Xu & Yuille(1995) applied statistical physics to the problem of robust principal component analysis(RPCA). Devlin et.al(1981) obtained principal components by using techniques such as M-estimation. The propose of this paper is to investigate from the statistical point of view how Xu & Yuille's(1995) RPCA works under the same simulation condition as in Devlin et.al(1981).

  • PDF

Mention Detection with Pointer Networks (포인터 네트워크를 이용한 멘션탐지)

  • Park, Cheoneum;Lee, Changki
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.774-781
    • /
    • 2017
  • Mention detection systems use nouns or noun phrases as a head and construct a chunk of text that defines any meaning, including a modifier. The term "mention detection" relates to the extraction of mentions in a document. In the mentions, a coreference resolution pertains to finding out if various mentions have the same meaning to each other. A pointer network is a model based on a recurrent neural network (RNN) encoder-decoder, and outputs a list of elements that correspond to input sequence. In this paper, we propose the use of mention detection using pointer networks. Our proposed model can solve the problem of overlapped mention detection, an issue that could not be solved by sequence labeling when applying the pointer network to the mention detection. As a result of this experiment, performance of the proposed mention detection model showed an F1 of 80.07%, a 7.65%p higher than rule-based mention detection; a co-reference resolution performance using this mention detection model showed a CoNLL F1 of 52.67% (mention boundary), and a CoNLL F1 of 60.11% (head boundary) that is high, 7.68%p, or 1.5%p more than coreference resolution using rule-based mention detection.

Workflow Pattern Extraction based on ACTA Formalism (ACTA 형식론에 기반한 워크플로우 패턴추출)

  • Lee Wookey;Bae Joonsoo;Jung Jae-yoon
    • Journal of KIISE:Databases
    • /
    • v.32 no.6
    • /
    • pp.603-615
    • /
    • 2005
  • As recent business environments are changed and become complex, a more efficient and effective business process management are needed. This paper proposes a new approach to the automatic execution of business processes using Event-Condition-Action (ECA) rules that can be automatically triggered by an active database. First of all, we propose the concept of blocks that can classify process flows into several patterns. A block is a minimal unit that can specify the behaviors represented in a process model. An algorithm is developed to detect blocks from a process definition network and transform it into a hierarchical tree model. The behaviors in each block type are modeled using ACTA formalism. This provides a theoretical basis from which ECA rules are identified. The proposed ECA rule-based approach shows that it is possible to execute the workflow using the active capability of database without users' intervention.

Optimal Placement of Sensors for Damage Detection in a Structure and its Application (구조물의 손상탐지를 위한 센서 위치 최적화 및 적용)

  • 박수용
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.7 no.4
    • /
    • pp.81-87
    • /
    • 2003
  • In this paper, the feasibility of using Shannon's sampling theorem to reconstruct exact mode shapes of a structural system from a limited number of sensor points and localizing damage in that structure with reconstructed mode shapes is investigated. Shannon's sampling theorem for the time domain is reviewed. The theorem is then extended to the spatial domain. To verify the usefulness of extended theorem, mode shapes of a simple beam are reconstructed from a limited amount of data and the reconstructed mode shapes are compared to the exact mode shapes. On the basis of the results, a simple rule is proposed for the optimal placement of accelerometers in modal parameter extraction experiments. Practicality of the proposed rule and the extended Shannon's theorem is demonstrated by detecting damage in laboratory beam structure with two-span via applying to mode shapes of pre and post damage states.

Video Event Detection according to Generating of Semantic Unit based on Moving Object (객체 움직임의 의미적 단위 생성을 통한 비디오 이벤트 검출)

  • Shin, Ju-Hyun;Baek, Sun-Kyoung;Kim, Pan-Koo
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.2
    • /
    • pp.143-152
    • /
    • 2008
  • Nowadays, many investigators are studying various methodologies concerning event expression for semantic retrieval of video data. However, most of the parts are still using annotation based retrieval that is defined into annotation of each data and content based retrieval using low-level features. So, we propose a method of creation of the motion unit and extracting event through the unit for the more semantic retrieval than existing methods. First, we classify motions by event unit. Second, we define semantic unit about classified motion of object. For using these to event extraction, we create rules that are able to match the low-level features, from which we are able to retrieve semantic event as a unit of video shot. For the evaluation of availability, we execute an experiment of extraction of semantic event in video image and get approximately 80% precision rate.

  • PDF

Korean Coreference Resolution using the Multi-pass Sieve (Multi-pass Sieve를 이용한 한국어 상호참조해결)

  • Park, Cheon-Eum;Choi, Kyoung-Ho;Lee, Changki
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.992-1005
    • /
    • 2014
  • Coreference resolution finds all expressions that refer to the same entity in a document. Coreference resolution is important for information extraction, document classification, document summary, and question answering system. In this paper, we adapt Stanford's Multi-pass sieve system, the one of the best model of rule based coreference resolution to Korean. In this paper, all noun phrases are considered to mentions. Also, unlike Stanford's Multi-pass sieve system, the dependency parse tree is used for mention extraction, a Korean acronym list is built 'dynamically'. In addition, we propose a method that calculates weights by applying transitive properties of centers of the centering theory when refer Korean pronoun. The experiments show that our system obtains MUC 59.0%, $B_3$ 59.5%, Ceafe 63.5%, and CoNLL(Mean) 60.7%.

T Wave Detection Algorithm based on Target Area Extraction through QRS Cancellation and Moving Average (QRS구간 제거와 이동평균을 통한 대상 영역 추출 기반의 T파 검출 알고리즘)

  • Cho, Ik-sung;Kwon, Hyeog-soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.450-460
    • /
    • 2017
  • T wave is cardiac parameters that represent ventricular repolarization, it is very important to diagnose arrhythmia. Several methods for detecting T wave have been proposed, such as frequency analysis and non-linear approach. However, detection accuracy is at the lower level. This is because of the overlap of the P wave and T wave depending on the heart condition. We propose T wave detection algorithm based on target area extraction through QRS cancellation and moving average. For this purpose, we detected Q, R, S wave from noise-free ECG(electrocardiogram) signal through the preprocessing method. And then we extracted P, T target area by applying decision rule for four PAC(premature atrial contraction) pattern another arrhythmia through moving average and detected T wave using RT interval and threshold of RR interval. The performance of T wave detection is evaluated by using 48 record of MIT-BIH arrhythmia database. The achieved scores indicate the average detection rate of 95.32%.

A Weighted FMM Neural Network and Feature Analysis Technique for Pattern Classification (가중치를 갖는 FMM신경망과 패턴분류를 위한 특징분석 기법)

  • Kim Ho-Joon;Yang Hyun-Seung
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.1
    • /
    • pp.1-9
    • /
    • 2005
  • In this paper we propose a modified fuzzy min-max neural network model for pattern classification and discuss the usefulness of the model. We define a new hypercube membership function which has a weight factor to each of the feature within a hyperbox. The weight factor makes it possible to consider the degree of relevance of each feature to a class during the classification process. Based on the proposed model, a knowledge extraction method is presented. In this method, a list of relevant features for a given class is extracted from the trained network using the hyperbox membership functions and connection weights. Ft)r this purpose we define a Relevance Factor that represents a degree of relevance of a feature to the given class and a similarity measure between fuzzy membership functions of the hyperboxes. Experimental results for the proposed methods and discussions are presented for the evaluation of the effectiveness and feasibility of the proposed methods.

A Rule Generation Technique Utilizing a Parallel Expansion Method (병렬확장을 활용한 규칙생성 기법)

  • Lee, Kee-Cheol;Kim, Jin-Bong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.942-950
    • /
    • 1998
  • Extraction of knowledge, especially in the form of rules, from raw data is very important in data mining, the aim of which is to help users who feel the lack of knowledge in spite of the abundance of data. Logic minimization tools are ones which derive optimized knowledge given ON set and DC set. First, the parallel expansion scheme of logic minimization is extracted and used to obtain intial knowledge to get final rules, which are successfully applicable to real world data. The prototype system based on this new approach has been experimented with real world data to show that it is as practical as conventional long studied decision tree methods like C4.5 system.

  • PDF