• 한국항만학회지
• /
• 제7권1호
• /
• pp.5-12
• /
• 1993

In complex decision making such as ill-defined system, one of the main problem is how to treat ambiguous aspect of the decision making. According to the complexity and ambiguity of the objective systems, many types of evaluation attributes are necessary for the rational decision and the relationship among the attributes become complex and fuzzy. Fuzzy integral is very effective to evalute the complex system with interaction between attributes but how to save the evaluation efforts in the decision making process of grading the membership of the objects or alternative is the problem to be tackled. Because the more object there are to evaluate, the number of decisions to made increase exponentially. Therefore, this paper aimes to propose a new evaluation algorithm based on fuzzy integral which can save the evaluator's efforts in decision making process. The proposed algorithm is constructed as follows : First, compose the fuzzy measure by introducing AHP(Analytical Hierachy Process) & mutual interaction coefficient. Second, generate fuzzy measure value of monotone family set for calculating the fuzzy integral. The effectiveness of the proposed algorithm is investigated through the example and sensitivity of interaction coefficient is illustrated.

• 한국인공지능학회지
• /
• 제10권1호
• /
• pp.9-14
• /
• 2022

The demand for public bicycles operated by the Seoul Metropolitan Government is increasing every year. The size of the Seoul public bicycle project, which first started with about 5,600 units, increased to 3,7500 units as of September 2021, and the number of members is also increasing every year. However, as the size of the project grows, excessive budget spending and deficit problems are emerging for public bicycle projects, and new bicycles, rental office costs, and bicycle maintenance costs are blamed for the deficit. In this paper, the Azure Machine Learning Studio program and the Boosted Decision Tree Regression technique are used to predict the number of public bicycle rental over environmental factors and time. Predicted results it was confirmed that the demand for public bicycles was high in the season except for winter, and the demand for public bicycles was the highest at 6 p.m. In addition, in this paper compare four additional regression algorithms in addition to the Boosted Decision Tree Regression algorithm to measure algorithm performance. The results showed high accuracy in the order of the First Boosted Decision Tree Regression Algorithm (0.878802), second Decision Forest Regression (0.838232), third Poison Regression (0.62699), and fourth Linear Regression (0.618773). Based on these predictions, it is expected that more public bicycles will be placed at rental stations near public transportation to meet the growing demand for commuting hours and that more bicycles will be placed in rental stations in summer than winter and the life of bicycles can be extended in winter.

• 정보처리학회논문지B
• /
• 제16B권4호
• /
• pp.327-331
• /
• 2009

퍼지 논리에서 불확실성의 병합은 일반적으로 t-norm 과 t-conorm 같은 연산자에 의해 수행된다. 그러나 기존의 병합 연산자는 다음과 같은 단점을 가지고 있다 : 첫째, 그들은 상황에 독립적이다. 결과적으로 동적 병합 과정에 적절히 적용하기 어렵다. 둘째, 의사결정 과정에의 직관적 연결성을 제공하지 못한다. 이러한 문제점을 해결하기 위해 의사결정 과정에서 옵션들의 강점 정도를 반영해 주는 퍼지 다차원 의사결정분석에 기반을 둔 $\varepsilon$-AMDA 알고리즘을 제안한다. $\varepsilon$-AMDA 알고리즘은 옵션의 강점 정도를 나타내 주는 매개변수의 값에 따라 최소값(옵션의 최약점)과 최대값(옵션의 최강점) 사이에서 적응적인 병합 결과를 생성한다. 이러한 관점에서 이는 동적 병합에 적용될 수 있다. 또한, 의사결정을 위한 퍼지 다차원 의사결정 분석에 대한 메커니즘을 제공하고 의사결정 과정에의 직관적 연결성을 제공한다. 결과적으로 제안된 방법은 의사결정자가 옵션의 강점 정도에 따라 적절한 의사결정을 하도록 지원할 수 있다.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.163-175
• /
• 1997

This paper presents the algorithm for finding the compensatory solution for fuzzy multiobjective nonlinear programming problem using $\gamma$-operator. The proposed algorithm can be applied to all cases with multiobjective problems since the interactive process with a decision maker is simple, various uncertainties involved on decision making are eliminated and all the objectives are well balanced. On the basis of proposed algorithm, an illustrative numerical example is presented.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• pp.218-223
• /
• 1995

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature or feature subset among all the available features is selected based on fitness function in genetic algorithm which is inversely proportional to classification error, balance between cluster, number of feature used. The proposed design scheme is applied to the handwtitten alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• 제어로봇시스템학회논문지
• /
• 제6권1호
• /
• pp.98-103
• /
• 2000

This paper suggests a method to recognize the various defect patterns of a cold mill strip using a binary decision tree automatically constructed by a genetic algorithm(GA). In classifying complex patterns with high similarity like the defect patterns of a cold mill stirp, the selection of an optimal feature set and an appropriate recognizer is important to achieve high recognition rate. In this paper a GA is used to select a subset of the suitable features at each node in the binary decision tree. The feature subset with maximum fitness is chosen and the patterns are classified into two classes using a linear decision function. This process is repeated at each node until all the patterns are classified into individual classes. In this way, the classifier using the binary decision tree is constructed automatically. After constructing the binary decision tree, the final recognizer is accomplished by having neural network learning sits of standard patterns at each node. In this paper, the classifier using the binary decision tree is applied to the recognition of defect patterns of a cold mill strip, and the experimental results are given to demonstrate the usefulness of the proposed scheme.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제2권1호
• /
• pp.43-48
• /
• 2013

Adaboost 알고리즘은 얼굴인식을 위한 Haar-like feature들을 이용하기 위해 가장 널리 쓰이고 있는 알고리즘이다. 매우 빠르며 효율적인 성능을 보이고 있으며 하나의 모델이미지가 존재하는 단일분포 데이터에 대해 매우 효율적이다. 그러나 정면 얼굴과 측면 얼굴을 혼합한 인식 등 둘 이상의 모델이미지를 가진 다중 분포모델에 대해서는 그 성능이 저하된다. 이는 단일 학습 알고리즘의 선형결합에 의존하기 때문에 생기는 현상이며 그 응용범위의 한계를 지니게 된다. 본 연구에서는 이를 해결하기 위한 제안으로서 Decision Tree를 Harr-like Feature와 결합하는 기법을 제안한다. Decision Tree를 사용 함으로서 보다 넓은 분야의 문제를 해결하기 위해 기존의 Decision Tree를 Harr-like Feature에 적합하도록 개선한 HDCT라고 하는 Harr-like Feature를 활용한 Decision Tree를 제안하였으며 이것의 성능을 Adaboost와 비교 평가하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.22-25
• /
• 2003

It is usually difficult for a single user to have all the essential knowledge on various Rapid Prototyping processes and techniques. It is therefore necessary to capture knowledge and experience of users of expert level into a decision-support system which provides quicker and more interactive way to select proper RP process and/or machine. rather than reading reports on benchmarking studies and comparing tables and graphs. In this paper two algorithms are presented, which may be used in such a decision-support system. together with its applications. The one is an extended PRES(Project Evaluation and Selection) algorithm which applies weighting factors of each attribute. The other is a LCE(Linear Confidence Equation) algorithm which is proposed to apply user's input requirements as well as weighting factors.

• 한국정밀공학회지
• /
• 제22권11호
• /
• pp.202-209
• /
• 2005

In this paper, benchmark tests of Rapid Prototyping(RP) are presented to evaluate characteristics of various RP Systems and Processes, and several decision-support systems are developed to select RP Machine/Process suitable to user's requirements. Results of the RP benchmark tests are applied to the recently developed RP machines for the purpose of analyzing attributes such as dimensional accuracy, surface roughness, build cost, build time, and etc. Decision-making support systems are also developed, which contain not only new LCE (Linear Confidence Equation) algorithm but also modified PRES and MDS algorithm. Those algorithms are proved to be effective in that reasonably acceptable results are obtained on several cases of different inputs.

• 음성과학
• /
• 제10권1호
• /
• pp.71-84
• /
• 2003

In the acoustic modeling for large vocabulary speech recognition, a sparse data problem caused by a huge number of context-dependent (CD) models usually leads the estimated models to being unreliable. In this paper, we develop a new clustering method based on the C45 decision-tree learning algorithm that effectively encapsulates the CD modeling. The proposed scheme essentially constructs a supervised decision rule and applies over the pre-clustered triphones using the C45 algorithm, which is known to effectively search through the attributes of the training instances and extract the attribute that best separates the given examples. In particular, the data driven method is used as a clustering algorithm while its result is used as the learning target of the C45 algorithm. This scheme has been shown to be effective particularly over the database of low unknown-context ratio in terms of recognition performance. For speaker-independent, task-independent continuous speech recognition task, the proposed method reduced the percent accuracy WER by 3.93% compared to the existing rule-based methods.