• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.3
• /
• pp.105-122
• /
• 1995

Based on linear models, the inference about the true measurement x$_{f}$ and the optimal designs x (nx1) for the calibration experiments are considered via Baysian statistical decision analysis. The posterior distribution of x$_{f}$ given the observation y$_{f}$ (qxl) and the calibration experiment is obtained with normal priors for x$_{f}$ and for themodel parameters (.alpha., .betha.). This posterior distribution is not in the form of any known distributions, which leads to the use of a numerical integration or an approximation for the calculation of the overall expected loss. The general structure of the expected loss function is characterized in the form of a conjecture. A near-optimal design is obtained through the approximation nof the conditional covariance matrix of the joint distribution of (x$_{f}$ , y$_{f}$ $^{T}$ )$^{T}$ . Numerical results for the univariate case are given to demonstrate the conjecture and to evaluate the approximation.n.

• Information and Communications Magazine
• /
• v.31 no.11
• /
• pp.27-34
• /
• 2014

본 리뷰 논문에서는 많은 데이터 환경에서 얻어진 k-최근접 이웃들(k-nearest neighbors)의 이론적 성질로부터 어떻게 분류를 위한 알고리즘을 만들어낼 것인가에 대한 여러 가지 방법들을 설명한다. 많은 데이터 환경에서의 최근접 이웃 데이터의 정보는 다양한 기계학습 문제를 푸는데 아주 좋은 이론적인 성질을 가지고 있다. 하지만, 이런 이론적인 특성들이 데이터가 많지 않은 환경에서는 전혀 나타나지 않을 뿐 아니라 오히려 다른 다양한 알고리즘들에 비해 성능이 많이 뒤쳐지는 결과를 보여주고 있다. 본 리뷰 논문에서는 많은 데이터 환경 하에서 k-최근접 이웃들의 정보가 어떤 이론적인 특성을 가지는지 설명하고, 특별히 이런 특성들을 가지고 k-최근접 이웃을 이용한 분류 문제를 어떻게 베이지안 추론(Baysian inference) 문제로 수식화 할 수 있는지 보인다. 마지막으로 현재의 빅데이터 환경에서 실용적으로 사용할 수 있는 알고리즘들을 소개한다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.113-143
• /
• 1997

Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.

• Annual Conference on Human and Language Technology
• /
• 2012.10a
• /
• pp.84-87
• /
• 2012

대분분의 검색 엔진에서 색인어의 추출 및 가중치의 부여방법은 매우 중요한 연구주제로, 검색 엔진의 성능에 큰 영항을 미친다. 일반적으로, 불용어 리스트를 통해 성능에 긍정적인 영향을 미치지 않는 색인어를 제거하거나, 핵심어 또는 전문용어 등 상대적으로 중요한 색인어를 강조하는 방식을 사용하여 검색엔진의 성능을 향상시킨다. 하지만, 어절 분리, 형태소 분석, 불용어 처리 등 검색엔진의 단계열 처리 과정에서, 개별적인 색인어가 검색엔진에 미치는 영향을 분석하고 이를 반영한 검색 엔진 성능 향상 기법은 제시되지 않고 있다. 따라서 본 연구에서는 각 단계별 처리 과정에서 생성된 색인어가 미치는 영항을 계랑화하여 긍정적/부정적 색인어를 분류하는 방법론을 소개하고, 이를 기반으로 색인어 가중치를 조절함으로써 검색 엔진의 성능 또한 향상 가능한 방법을 소개한다.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.145-155
• /
• 2007

The objectives of this study aye to develop an on-line departure time-based travel time estimation method and to determine an optimal link length for the estimation. This study developed a link-based rolling horizon logic as the travel time estimation method. In order to determine an optimal link length, the information error of the travel time provision from the user's perspective was defined and employed as a selection criterion. It was found that, when the travel time aggregation size was set as five minutes, a link length of four kilometers gave the most accurate result.

• Journal of Korean Society of Transportation
• /
• v.24 no.2 s.88
• /
• pp.157-168
• /
• 2006

Spatial detection system such as AVI, GPS, and Beacon etc. can provide spatial travel time only after a vehicle Passes through a road section. In this context, majority of the existing studies on the link travel time estimation area has focused on the arrival time-based link travel time estimation. rather than departure time-based link travel time estimation. Even if some of the researches on this area have developed departure time-based link travel time estimation algorithms, they are limited in that they are not applicable in a real-time mode. The objective of this study is to develop an departure time-based link travel time estimation algorithm which is applicable in a real-tine mode. Firstly, this study discussed the tradeoff between accuracy and timeliness of the departure time-based on-line link travel time estimates. Secondly, this study developed an departure time-based on-line link travel time estimation algorithm which utilizes the Baysian inference logic. It was found that the proposed approach could estimate departure time-based link travel times in a real-time context with an acceptable accuracy and timeliness.