• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2017.05a
• /
• pp.1104-1107
• /
• 2017

In this paper, we focused on Analytic Hierarchy Process(AHP) as an efficient means of decision-making on the major issues that may arise during the liquid rocket engine development, reviewed the validity and applicability of the AHP through the problem of selecting the propellant of the liquid rocket engine.

• Communications of Mathematical Education
• /
• v.22 no.4
• /
• pp.459-469
• /
• 2008

We give a mathematical approach using Linear Algebra, especially largest eigenvalue and eigenvector on decision making support system. We find a mathematical modeling on decision making problem which could be solved by AHP(Analytic Hierarchy Process) method. Especially, we give a new approach to change evaluation indicator weight on assessing research proposals.

• Journal of Intelligence and Information Systems
• /
• v.2 no.2
• /
• pp.1-15
• /
• 1996

전문가의 지식을 지식베이스화하여 의사결정지원시스템으로 사용하려는 노력이 증대하고 있다. 특히 투자의사결정과 같은 원인결과의 관계를 명확히 규정할 수 없는 복작한 영역에서 전문가의 지식베이스는 비전문가의 의사결정에 중요한 조언을 제공할 수 있다. 불확실한 지식을 지식베이스화하는 한 방법으로 퍼지프러덕션시스템이 널리 사용되고 있다. 주식시장과 같은 동태적인 시스템에서 어떤 정보의 중요성은 상황에 따라 변화하는데 이를 정태적인 프로덕션시스템의 규칙으로 지식베이스화하는 것은 불가능하다. 그러나 추론을 수행하는 과정에서 수행당시 각 정보의 중요도에 부응하는 가중치를 부여하여 평가함으로써 정태적인 지식베이스에 동태적인 실제시스템의 특성을 반영할 수 있다. 이는 가중치가 높은 정보에 해당하는 조건명제의 충족정도가 해당규칙의 전체평가결과에 더욱 중요하게 반영되게 하여 좀더 현실성 있는 추론 결과를 얻게 한다. AHP(Analytic Hierachy Process) 방법에 의하여 얻어진 정보의 상대적 중요도에 따른 가중치 (w)를 해당 정보와 조건명제의 합치정도(Degree of Match : DM)에 (DM)w 의 형식으로 적용함으로써 퍼지프러덕션시스템에서 정보의 중요도를 반영하여 프러덕션규칙을 평가하는 방법을 제시한다.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.97-106
• /
• 2012

In the past, executive managers made a decision based on personal experience and knowledge due to lack of the appropriate and timely information. With the development of information systems and technologies, efficiency and productivity of business operation has been enhanced. In this study, we propose a system design and architecture blue-print related to strategic decision making support system. The proposed system consists of 3 key parts; individual business feasibility test, business portfolio feasibility test, business portfolio management. The three key parts are comprised of 11 components to generate information and knowledge based on various data input from inside and outside of firm. This system is expected to provide objective and reliable output to users. In addition, the proposed strategic decision support system would help respond to a rapidly changing business environment.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.327-331
• /
• 2009

In fuzzy logic, aggregating uncertainties is generally achieved by means of operators such as t-norms and t-conorms. However, existing aggregation operators have some disadvantages as follows : First, they are situation-independent. Thus, they may not be properly applied to dynamic aggregation process. Second, they do not give an intuitional sense to decision making process. To solve these problems, we propose a new $\varepsilon$-AMDA (Aggregation based on the fuzzy Multidimensional Decision Analysis) algorithm to reflect degrees of strength for option i (i = 1, 2, ..., n) in the decision making process. The $\varepsilon$-AMDA algorithm makes adaptive aggregation results between min (the most weakness for an option) and max (the most strength for an option) according to the values of the parameter representing degrees of strength for an option. In this respect, it may be applied to dynamic aggregation process. In addition, it provides a mechanism of the fuzzy multidimensional decision analysis for decision making, and gives an intuitional sense to decision making process. Thus, the proposed method aids the decision maker to get a suitable decision according to the degrees of strength for options (or alternatives).

• Journal of the military operations research society of Korea
• /
• v.32 no.2
• /
• pp.212-222
• /
• 2006

The defense innovation 2020 advanced topics which have to establish robust milatary are based on archiving defense innovation by selecting twenty-one main topics and eighties' sub-topics whose topics focus on defense innovation and defense circumstance in 2020. Although defense innovation 2020 which is to be advanced with defense basic policy need to decision making, it is specified in programming step by merging budget with plan. If the Defense Ministry archives decision making from initial plan step, although it archives group decision making in programming step at present, it will archive efficient affair. This study archives a group decision making of defense innovation 2020 advanced topics which were published in the Defense Ministry by applying Analytic Hierarchy Process in plan step. In addition, if the weights of the main topics are equal, the sub topics analyze how to be changed throughout sensitivity analysis and suggest the topics' priority rank throughout group decision making.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.5
• /
• pp.877-884
• /
• 2011

The decision tree is a representative algorithm of data mining and used in many domains such as retail target marketing, fraud detection, data reduction, variable screening, category merging, etc. This method is most useful in classification problems, and to make predictions for a target group after dividing it into several small groups. When we create a model of decision tree with a large number of input variables, we suffer difficulties in exploration and analysis of the model because of complex trees. And we can often find some association exist between input variables by external variables despite of no intrinsic association. In this paper, we study on the removal method of unnecessary input variables using multiple external association rules. And then we apply the removal method to actual data for its efficiencies.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.4
• /
• pp.671-678
• /
• 2011

Data mining searches for interesting relationships among items in a given database. The methods of data mining are decision tree, association rules, clustering, neural network and so on. The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, customer classification, etc. When create decision tree model, complicated model by standard of model creation and number of input variable is produced. Specially, there is difficulty in model creation and analysis in case of there are a lot of numbers of input variable. In this study, we study on decision tree using intervening variable. We apply to actuality data to suggest method that remove unnecessary input variable for created model and search the efficiency.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.2
• /
• pp.299-307
• /
• 2012

Data mining is a method of searching for an interesting relationship among items in a given database. The decision tree is a typical algorithm of data mining. The decision tree is the method that classifies or predicts a group as some subgroups. In general, when researchers create a decision tree model, the generated model can be complicated by the standard of model creation and the number of input variables. In particular, if the decision trees have a large number of input variables in a model, the generated models can be complex and difficult to analyze model. When creating the decision tree model, if there are marginally conditional variables (intervening variables, external variables) in the input variables, it is not directly relevant. In this study, we suggest the method of creating a decision tree using marginally conditional variables and apply to actual data to search for efficiency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.63-66
• /
• 2005

분류란 여러 분야에서 쌓인 정보 데이터를 분석하여, 결과값에 대한 공통속성을 찾아내어 새로운 입력 데이터에 대해 보다 보편적인 결과를 분석하거나 예측하는 기법이다. 의사 결정 트리는 이러한 분류의 한 형태로 저장된 데이터를 활용하여 선험적 지식을 취득하고, 새로운 데이터에 대한 예측을 발생시키는 데이터 분석 방법이다. 그러나, 의사 결정 트리의 여러 가지 장점에도 불구하고 트리 구성에 많은 비용이 소요되는 단점이 존재한다. 점점 대량의 데이터를 다루어야 하는 현대 사회에서는 이러한 단점이 더욱더 커질 수 밖에 없다. 본 논문에서는 이러한 문제점을 해결하고자 비트맵을 활용한 의사 결정 트리의 구현을 제안한다. 비트맵을 사용하게 되면 의사 결정 트리 생성의 가장 큰 비용인 속성값 측정에서 높은 효율을 유지할 수 있게 된다. 또한 보다 효율적이고, 확장성이 높은 의사 결정 트리를 구현할 수가 있다.