• Title/Summary/Keyword: 가중치 함수

Search Result 540, Processing Time 0.028 seconds

An Information-theoretic Approach for Value-Based Weighting in Naive Bayesian Learning (나이브 베이시안 학습에서 정보이론 기반의 속성값 가중치 계산방법)

  • Lee, Chang-Hwan
    • Journal of KIISE:Databases
    • /
    • v.37 no.6
    • /
    • pp.285-291
    • /
    • 2010
  • In this paper, we propose a new paradigm of weighting methods for naive Bayesian learning. We propose more fine-grained weighting methods, called value weighting method, in the context of naive Bayesian learning. While the current weighting methods assign a weight to an attribute, we assign a weight to an attribute value. We develop new methods, using Kullback-Leibler function, for both value weighting and feature weighting in the context of naive Bayesian. The performance of the proposed methods has been compared with the attribute weighting method and general naive bayesian. The proposed method shows better performance in most of the cases.

Transfer Function Optimization Using Crowd Sourcing (크라우드 소싱을 이용한 변환함수 최적화)

  • Nam, Jinhyun;Nam, Doohee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.107-112
    • /
    • 2014
  • This Study is Transfer function optimization plan of volume rendering of multi user environment. Each volume data, for appropriate transfer function, they should be adjusted parameter many times. To prevent this, we propose transfer function optimization plan using crowd sourcing. In multi user environment, we use weight value for reliability level for each user. Because transfer function parameter used previous users is provided next users, they can be used effectively optimized transfer function and can reduce attempts.

Learning Heuristics for Tactical Path-finding in Computer Games (컴퓨터 게임에서 전술적 경로 찾기를 위한 휴리스틱 학습)

  • Yu, Kyeon-Ah
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1333-1341
    • /
    • 2009
  • Tactical path-finding in computer games is path-finding where a path is selected by considering not only basic elements such as the shortest distance or the minimum time spend but also tactical information of surroundings when deciding character's moving trajectory. One way to include tactical information in path-finding is to represent a heuristic function as a sum of tactical quality multiplied by a weighting factor which is.. determined based on the degree of its importance. The choice of weighting factors for tactics is very important because it controls search performance and the characteristic of paths found. In this paper. we propose a method for improving a heuristic function by adjusting weights based on the difference between paths on examples given by a level designer and paths found during the search process based on the CUITent weighting factors. The proposed method includes the search algorithm modified to detect search errors and learn heuristics and the perceptron-like weight updating formular. Through simulations it is demonstrated how different paths found by tactical path-finding are from those by traditional path-finding. We analyze the factors that affect the performance of learning and show the example applied to the real game environments.

  • PDF

Study on Classification Algorithm based on Weight of Support and Confidence Degree (지지도와 신뢰도의 가중치에 기반한 분류알고리즘에 관한 연구)

  • Kim, Keun-Hyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.700-713
    • /
    • 2009
  • Most of any existing classification algorithm in data mining area have focused on goals improving efficiency, which is to generate decision tree more rapidly by utilizing just less computing resources. In this paper, we focused on the efficiency as well as effectiveness that is able to generate more meaningful classification rules in application area, which might consist of the ontology automatic generation, business environment and so on. For this, we proposed not only novel function with the weight of support and confidence degree but also analyzed the characteristics of the weighted function in theoretical viewpoint. Furthermore, we proposed novel classification algorithm based on the weighted function and the characteristics. In the result of evaluating the proposed algorithm, we could perceive that the novel algorithm generates more classification rules with significance more rapidly.

Development of hybrid activation function to improve accuracy of water elevation prediction algorithm (수위예측 알고리즘 정확도 향상을 위한 Hybrid 활성화 함수 개발)

  • Yoo, Hyung Ju;Lee, Seung Oh
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.363-363
    • /
    • 2019
  • 활성화 함수(activation function)는 기계학습(machine learning)의 학습과정에 비선형성을 도입하여 심층적인 학습을 용이하게 하고 예측의 정확도를 높이는 중요한 요소 중 하나이다(Roy et al., 2019). 일반적으로 기계학습에서 사용되고 있는 활성화 함수의 종류에는 계단 함수(step function), 시그모이드 함수(sigmoid 함수), 쌍곡 탄젠트 함수(hyperbolic tangent function), ReLU 함수(Rectified Linear Unit function) 등이 있으며, 예측의 정확도 향상을 위하여 다양한 형태의 활성화 함수가 제시되고 있다. 본 연구에서는 기계학습을 통하여 수위예측 시 정확도 향상을 위하여 Hybrid 활성화 함수를 제안하였다. 연구대상지는 조수간만의 영향을 받는 한강을 대상으로 선정하였으며, 2009년 ~ 2018년까지 10년간의 수문자료를 활용하였다. 수위예측 알고리즘은 Python 내 Tensorflow의 RNN (Recurrent Neural Networks) 모델을 이용하였으며, 강수량, 수위, 조위, 댐 방류량, 하천 유량의 수문자료를 학습시켜 3시간 및 6시간 후의 수위를 예측하였다. 예측정확도 향상을 위하여 입력 데이터는 정규화(Normalization)를 시켰으며, 민감도 분석을 통하여 신경망모델의 은닉층 개수, 학습률의 최적 값을 도출하였다. Hybrid 활성화 함수는 쌍곡 탄젠트 함수와 ReLU 함수를 혼합한 형태로 각각의 가중치($w_1,w_2,w_1+w_2=1$)를 변경하여 정확도를 평가하였다. 그 결과 가중치의 비($w_1/w_2$)에 따라서 예측 결과의 RMSE(Roote Mean Square Error)가 최소가 되고 NSE (Nash-Sutcliffe model Efficiency coefficient)가 최대가 되는 지점과 Peak 수위의 예측정확도가 최대가 되는 지점을 확인할 수 있었다. 본 연구는 현재 Data modeling을 통한 수위예측의 정확도 향상을 위해 기초가 되는 연구이나, 향후 다양한 형태의 활성화 함수를 제안하여 정확도를 향상시킨다면 예측 결과를 통하여 침수예보에 대한 의사결정이 가능할 것으로 기대된다.

  • PDF

A Study on Off-Line Signature Verification using Directional Density Function and Weighted Fuzzy Classifier (가중치 퍼지분류기와 방향성 밀도함수를 이용한 오프라인 서명 검증에 관한 연구)

  • 한수환;이종극
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.6
    • /
    • pp.592-603
    • /
    • 2000
  • This paper is concerning off-line signature verification using a density function which is obtained by convolving the signature image with twelve-directional $5\times{5}$ gradient masks and the weighted fuzzy mean classifier. The twelve-directional density function based on Nevatia-Babu template gradient is related to the overall shape of a signature image and thus, utilized as a feature set. The weighted fuzzy mean classifier with the reference feature vectors extracted from only genuine signature samples is evaluated for the verification of freehand forgeries. The experimental results show that the proposed system can classify a signature whether it is genuine or forged with more than 98% overall accuracy even without any knowledge of varied freehand forgeries.

  • PDF

Robustness to Impulsive Noise of Algorithms based on Cross-Information Potential and Delta Functions (상호 정보 에너지와 델타함수를 이용한 알고리즘의 충격성 잡음에 대한 강인성)

  • Kim, Namyong
    • Journal of Internet Computing and Services
    • /
    • v.17 no.2
    • /
    • pp.11-17
    • /
    • 2016
  • In this paper, the optimum weight of the algorithm based on the cross information-potential with the delta functions (CIPD) is derived and its robustness against impulsive noise is studied. From the analysis of the behavior of optimum weight, it is revealed that the magnitude controlling operation for input plays the main role of keeping optimum weight of CIPD stable from the impulsive noise. The simulation results show that the steady state weight of CIPD is equivalent to that of MSE criterion. Also in the simulation environment of impulsive noise, unlike the LMS algorithm based on MSE, the steady state weight of CIPD is shown to be kept stable.

A Cost Sensitive Part-of-Speech Tagging: Differentiating Serious Errors from Minor Errors (태깅 오류 간 중요도 차별화에 기반한 비용 의존 품사 태깅)

  • Son, Jeong-Woo;Noh, Tae-Gil;Park, Seong-Bae;Go, Jun-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.236-239
    • /
    • 2011
  • 품사 태깅에서 오류는 같은 가중치를 가지는 것으로 간주되어 왔다. 하지만 품사 태깅의 결과를 활용하는 다른 자연어 처리 기술에 태깅 오류가 얼마나 영향을 미칠 수 있는가에 따라 품사 태깅 시 발생하는 오류가 가지는 가중치를 다르게 보아야 한다. 심각한 오류는 이를 활용하는 자연어 처리 기술의 성능 저하를 크게 야기하지만, 사소한 오류는 성능의 저하를 야기하지 않거나 그 영향이 미미하다. 본 논문에서는 품사 태깅 시, 전체적인 성능을 유지하면서 심각한 오류를 줄이는 것을 목표로 한다. 이를 위해 두 가지 점진적 손실 함수(gradient loss function)를 제안한다. 제안한 손실 함수는 심각한 오류에 사소한 오류보다 더 큰 가중치를 줌으로써 품사 태깅 모델이 심각한 오류에 더 집중하여 성능을 최적화하도록 한다. 실험에서 제안한 손실 함수를 활용한 태깅 모델은 기존의 방법에 비해 심각한 오류를 효과적으로 줄일 뿐만 아니라 전체적으로 더 높은 정확도를 보였다.

Shape design of conformal array using the beam pattern synthesis (빔 패턴 성능 분석을 이용한 곡면 배열 형상 설계)

  • Lee, Keunhwa;Shin, Donghoon;Lim, Jun-Seok;Hong, Wooyoung;Ha, Younghoon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.4
    • /
    • pp.347-358
    • /
    • 2021
  • The objective of this study is to optimize the shape of doubly curved surface where a conformal array is equipped. That surface is modeled with a double-ellipsoid solid controlled by four parameters. By analyzing the performance of the conformal array beams with the beam pattern synthesis, two design parameters are determined. Then, we define the weighted object function which is formulated as the sum of sharp indexes for directivity index, the elevation resolution, and the bearing resolution. The direct calculation on all grids is used to evaluate the weighted object function and seek the optimal value of two design parameters when the weightings are given. In the simulation, four kinds of weighting cases are respectively applied to evaluate the weighted object function. The optimal shapes of double-ellipsoid solid are shown in each case. Especially, when the uniform weightings are used, the double-ellipsoid solid with more smooth surface is obtained.

Acceleration of Learning speed Neural Networks by Reducing Weight Oscillations (가중치 진동의 감소를 이용한 신경회로망의 학습속도 향상)

  • 임빈철;박동조
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.251-254
    • /
    • 1998
  • 본 논문에서는 신경회로망의 수렴속도를 높이기 위한 알고리즘을 제안한다. 전형적인 역전파 학습방식은 느린 수렴속도가 단점으로 제기되는데 이는 비용함수의 계곡부근에서 가중치의 궤적이 심한 진동현상을 보이기 때문이다. 이 문제를 해결하기 위해서 본 논문에서는 경사법에서 사용되는 갱신방향을 계곡의 진행방향을 이용하여 변경한다. 모의실험을 통하여 제안된 방법으로 가중치의 궤적에 나타나는 진동을 줄이고 수렴속도를 향상시킬 수 있음을 보인다.

  • PDF