• Title/Summary/Keyword: Decision boundary

Search Result 210, Processing Time 0.03 seconds

A Study on The Feature Selection and Design of a Binary Decision Tree for Recognition of The Defect Patterns of Cold Mill Strip (냉연 표면 흠 분류를 위한 특징선정 및 이진 트리 분류기의 설계에 관한 연구)

  • Lee, Byung-Jin;Lyou, Kyoung;Park, Gwi-Tae;Kim, Kyoung-Min
    • Proceedings of the KIEE Conference
    • /
    • 1998.07g
    • /
    • pp.2330-2332
    • /
    • 1998
  • This paper suggests a method to recognize the various defect patterns of cold mill strip using binary decision tree automatically constructed by genetic algorithm. The genetic algorithm and K-means algorithm were used to select a subset of the suitable features at each node in binary decision tree. The feature subset with maximum fitness is chosen and the patterns are classified into two classes by a linear decision boundary. This process was repeated at each node until all the patterns are classified into individual classes. The final recognizer is accomplished by neural network learning of a set of standard patterns at each node. Binary decision tree classifier was applied to the recognition of the defect patterns of cold mill strip and the experimental results were given to demonstrate the usefulness of the proposed scheme.

  • PDF

A rotational decision-directed AFC algorithm for QPSK demodulation (회전결정경계를 이용한 QPSK 복조용 자동주파수 제어 알고리즘)

  • 황유모;박경배
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.11
    • /
    • pp.16-24
    • /
    • 1997
  • In order to prevent the presence of the residual phase difference at the discriminator output by the existing AFC techniques, we propose a new automatic frequency control(AFC) tracking algorithm for QPSK demodulation at the digital direct broadcasting satellite(DBS) receiver, which we call a rotational decision-directed AFC(RDDAFC). The RDDAFC rotates the decision boundary for the kth received symbol by the frequency deterctor output of the (k-1)th received symbol. Tracking performances of carrier frequency offset by the proposed RDDAFC algorithm are evaluated through computer simulations under the practical DBS channel conditions with a carrier frequency offset of 2.3MHz when S/N equals 2dB. Test results show that the total pull-in time of the RDDAFC is 1.697msec for 10$^{-3}$ SER before forwared error correction at the receiver.

  • PDF

Development of Automatic ALC Block Measurement System Using Machine Vision (머신 비전을 이용한 ALC 블록 생산공정의 자동 측정 시스템 개발)

  • 엄주진;허경무
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.6
    • /
    • pp.494-500
    • /
    • 2004
  • This paper presents a machine vision system, which inspects the measurement of the ALC block on a real-time basis in the production process. The automatic measurement system was established with a CCD camera, an image grabber, and a personal computer without using assembled measurement equipment. Images obtained by this system was processed by an algorithm, specially designed for an enhanced measurement accuracy. For the realization of the proposed algorithm, a preprocessing method that can be applied to overcome uneven lighting environment, boundary decision method, unit length decision method in uneven condition with rocking objects, and a projection of region using pixel summation are developed. From our experimental results, we could find that the required measurement accuracy specification is sufficiently satisfied by using the proposed method.

Radioactive waste sampling for characterisation - A Bayesian upgrade

  • Pyke, Caroline K.;Hiller, Peter J.;Koma, Yoshikazu;Ohki, Keiichi
    • Nuclear Engineering and Technology
    • /
    • v.54 no.1
    • /
    • pp.414-422
    • /
    • 2022
  • Presented in this paper is a methodology for combining a Bayesian statistical approach with Data Quality Objectives (a structured decision-making method) to provide increased levels of confidence in analytical data when approaching a waste boundary. Development of sampling and analysis plans for the characterisation of radioactive waste often use a simple, one pass statistical approach as underpinning for the sampling schedule. Using a Bayesian statistical approach introduces the concept of Prior information giving an adaptive sample strategy based on previous knowledge. This aligns more closely with the iterative approach demanded of the most commonly used structured decision-making tool in this area (Data Quality Objectives) and the potential to provide a more fully underpinned justification than the more traditional statistical approach. The approach described has been developed in a UK regulatory context but is translated to a waste stream from the Fukushima Daiichi Nuclear Power Station to demonstrate how the methodology can be applied in this context to support decision making regarding the ultimate disposal option for radioactive waste in a more global context.

Does Happiness Always Lead to Reliance on Feelings in Decision Making?

  • Moon-Yong Kim
    • International journal of advanced smart convergence
    • /
    • v.12 no.4
    • /
    • pp.370-377
    • /
    • 2023
  • Previous research has demonstrated that happy moods are known to promote feeling-based processing, whereas sad moods promote reason-based processing. The current research investigates a boundary condition for the effects of a happy mood on feeling-based decision making. This research proposes that the level of control (low vs. high) one exercises in a happy situation can promote a greater reliance on feelings (vs. reasons) in making judgments and decisions. Specifically, we hypothesize that (1) a happy individual in a situation where control level is low (vs. high) will be more likely to choose a cognitively (vs. affectively) superior option (hypothesis 1), and (2) a happy individual in a situation where control level is low (vs. high) will exert reason- (vs. feeling-) based processing (hypothesis 2). Consistent with the hypothesis 1, the results of two experiments show that happy individuals are more likely to choose cognitively versus affectively superior options in a situation where control level is low (vs. high). Moreover, the mediation analysis confirms that happy individuals are more likely to rely on cognitive, reason-based decision making when their control level is low, which supports the hypothesis 2.

Ground Target Classification Algorithm based on Multi-Sensor Images (다중센서 영상 기반의 지상 표적 분류 알고리즘)

  • Lee, Eun-Young;Gu, Eun-Hye;Lee, Hee-Yul;Cho, Woong-Ho;Park, Kil-Houm
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.2
    • /
    • pp.195-203
    • /
    • 2012
  • This paper proposes ground target classification algorithm based on decision fusion and feature extraction method using multi-sensor images. The decisions obtained from the individual classifiers are fused by applying a weighted voting method to improve target recognition rate. For classifying the targets belong to the individual sensors images, features robust to scale and rotation are extracted using the difference of brightness of CM images obtained from CCD image and the boundary similarity and the width ratio between the vehicle body and turret of target in FLIR image. Finally, we verity the performance of proposed ground target classification algorithm and feature extraction method by the experimentation.

An Interval Type-2 Fuzzy Perceptron for Finding Linear Decision Boundaries (선형분류 경계면을 찾기위한 Interval 제2종 퍽지퍼셉트론)

  • Hwang, Cheul;Rhee, Frank Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.294-299
    • /
    • 2002
  • This paper presents an interval type-2 fuzzy perceptron algorithm that is an extension of the type-1 fuzzy perceptron algorithm proposed in [1]. In our proposed method, the membership values for each pattern vector are extended as interval type-2 fuzzy memberships by assigning uncertainty to the type-1 memberships. By doing so, the decision boundary obtained by interval type-2 fuzzy memberships can converge to a more desirable location than the boundary obtained by crisp and type-1 fuzzy perceptron methods. Experimental results are given to show the effectiveness of our method.

Fuzzy Learning Rule Using the Distance between Datum and the Centroids of Clusters (데이터와 클러스터들의 대표값들 사이의 거리를 이용한 퍼지학습법칙)

  • Kim, Yong-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.4
    • /
    • pp.472-476
    • /
    • 2007
  • Learning rule affects importantly the performance of neural network. This paper proposes a new fuzzy learning rule that uses the learning rate considering the distance between the input vector and the prototypes of classes. When the learning rule updates the prototypes of classes, this consideration reduces the effect of outlier on the prototypes of classes. This comes from making the effect of the input vector, which locates near the decision boundary, larger than an outlier. Therefore, it can prevents an outlier from deteriorating the decision boundary. This new fuzzy learning rule is integrated into IAFC(Integrated Adaptive Fuzzy Clustering) fuzzy neural network. Iris data set is used to compare the performance of the proposed fuzzy neural network with those of other supervised neural networks. The results show that the proposed fuzzy neural network is better than other supervised neural networks.

Efficient Incremental Learning using the Preordered Training Data (미리 순서가 매겨진 학습 데이타를 이용한 효과적인 증가학습)

  • Lee, Sun-Young;Bang, Sung-Yang
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.2
    • /
    • pp.97-107
    • /
    • 2000
  • Incremental learning generally reduces training time and increases the generalization of a neural network by selecting training data incrementally during the training. However, the existing methods of incremental learning repeatedly evaluate the importance of training data every time they select additional data. In this paper, an incremental learning algorithm is proposed for pattern classification problems. It evaluates the importance of each piece of data only once before starting the training. The importance of the data depends on how close they are to the decision boundary. The current paper presents an algorithm which orders the data according to their distance to the decision boundary by using clustering. Experimental results of two artificial and real world classification problems show that this proposed incremental learning method significantly reduces the size of the training set without decreasing generalization performance.

  • PDF

Robustness Analysis of Support Vector Machines against Errors in Input Data (Support Vector Machine의 입력데이터 오류에 대한 Robustness분석)

  • Lee Sang-Kyun;Zhang Byoung-Tak
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.715-717
    • /
    • 2005
  • Support vector machine(SVM)은 최근 각광받는 기계학습 방법 중 하나로서, kernel function 이라는 사상(mapping)을 이용하여 입력 공간의 벡터를 classification이 용이한 특징 (feature) 공간의 벡터로 변환하는 것을 근간으로 한다. SVM은 이러한 특징 공간에서 두 클래스를 구분 짓는 hyperplane을 일련의 최적화 방법론을 사용하여 찾아내며, 주어진 문제가 convex problem 인 경우 항상 global optimal solution 을 보장하는 등의 장점을 지닌다. 한편 bioinformatics 연구에서 주로 사용되는 데이터는 측정 오류 등 일련의 오류를 포함하고 있으며, 이러한 오류는 기계학습 방법론이 어떤 decision boundary를 찾아내는가에 영향을 끼치게 된다. 특히 SVM의 경우 이러한 오류는 특징 공간 벡터간의 관계를 나타내는 Gram matrix를 변화로 나타나게 된다. 본 연구에서는 입력 공간에 오류가 발생할 때 그것이 SVM 의 decision boundary를 어떻게 변화시키는가를 대표적인 두 가지 kernel function, 즉 linear kernel과 Gaussian kernel에 대해 분석하였다. Wisconsin대학의 유방암(breast cancer) 데이터에 대해 실험한 결과, 데이터의 오류에 따른 SVM 의 classification 성능 변화 양상을 관찰하여 커널의 종류에 따라 SVM이 어떠한 특성을 보이는가를 밝혀낼 수 있었다. 또 흥미롭게도 어떤 조건 하에서는 오류가 크더라도 오히려 SVM 의 성능이 향상되는 것을 발견했는데, 이것은 바꾸어 생각하면 Gram matrix 의 일부를 변경하여 SVM 의 성능 향상을 꾀할 수 있음을 나타낸다.

  • PDF