International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 2, July August 2012 ISSN 2278-6856

Graph based framework for designing Modern Decision Support Systems

Prof (Dr.) M. P. Thapliyal1, Sandeep Kautish2
1

Associate Professor, H.N.B.Garhwal University Srinagar, Dist.Pauri Garhwal (Uttarakhand) India 246174
2

Research Scholar

Abstract: As the business world growing at rapid pace,

Decision Support Systems are the most talked topic since past decade. Data contained on Information Systems are used to derive analytical models which help decision makers in terms of simplifying semi-structured problems and suggesting suitable solutions. The most widely used approach to solve semi-structured problems is to combine the expertise of a decision maker and analytical capabilities of Decision Support Systems (DSS), empowered by a model database. This paper aims to frame modern and flexible DSS which supports knowledge sharing among users and offers improved cognitive user profile with desired customization. Methodology used to design such system is constructing customized graph based framework of model section for DSS. Results suggest that the proposed approach would be viable for use in real world problems.

between model subsystem [3].

subsystem

and model deployment

In against any user query, search will be made in database and will be retrieved if information available. Otherwise, the model database will be searched for seeking models which can produce desired information. If model available then there will be another check for its required inputs (Liang 1985). If no desired model is available, there will be attempt to develop composite model. This implementation will be based on graph theory.

2. DECISION SUPPORT SYSTEMS (DSS)

The term decision support system (DSS) can be broadly defined as a class of computer based information systems that support decision-making activities. Turban (1995) defines it as "an interactive, flexible, and adaptable computer-based information system, especially developed for supporting the solution of a non-structured management problem for improved decision making. It utilizes data, provides an easy-to-use interface, and allows for the decision maker's own insights". DSS are usually context and task-specific and this is the reason why it is impossible to give a precise definition including all the facets of the DSS. The only thing that can be said for sure about a DSS is that it includes a decision-making process, which has a more widely accepted definition [5]/ Decision-making is the cognitive process with psychological construct in which users select one course of action from among multiple alternatives. Only the result of the process can be observed in the form of a commitment to take action. Decision-making is an important part of many professions, where specialists apply their expertise in a given area to making informed decisions. Decision support systems operate in a multidisciplinary environment, including among others database research, artificial intelligence, human-computer interaction, simulation methods, and software engineering. Figure 1 shows an overview of a typical DSS, comprising five key elements: (i) access to external databases, (ii) a Database Manager, (iii) a Model Database Manager, (iv) a Dialogue Manager and (v) the Decision Maker.

Keywords: Decision Support Systems, Model Management Systems, Graph Framework, Modeling

1. INTRODUCTION
Researchers are always been trying to find new techniques to help decision makers for decision making problems of real world scenario. The Decision Support Systems (DSS) is the domain area in which such semistructured problems are dealt and since evolution of DSS, it has been emerging topic in computer science study. This section describes the concept of Decision Support Systems and intelligent computing techniques i.e. Graph based approach for model selection and determination. The architecture consists of four main components: a database, a model management subsystem, dialogue system and knowledge management subsystem. Since the approach used in the study is based on reasoning and judgment, a different Model base management system is proposed in the study. The new architecture of model management system is presented which consists of 3 modules: a modeling subsystem, a modeling deployment subsystem and an inference engine. The proposed framework includes two major subsystems: modeling and model deployment system out of which modeling system concentrates on improving effectiveness of models and model deployment subsystem focuses on proper utilization of models. Another important component of framework is inference engine which makes connectivity Volume 1, Issue 2 July-August 2012

Page 45

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 2, July August 2012 ISSN 2278-6856
Decision making is the process of getting final state (output information) from initial state (input information). The models in model base have two core elements: nodes and edges. The modeling process based on graph is a process which creates a directed graph and selects a path which is best or optimum suitable in order to for getting desired output. The directed graph or model graph consists of all possible alternatives for solving the problem by mean of one path for each alternative which is called a model. Now, various definitions are described for better understanding of the terminology used in framework. A) Node A node represents a state or data attributes.

Figure 1 Overview of a Decision Support System; adapted from (Laudon & Laudon, 2004) The access to External Databases is used to obtain data from outside of systems i.e. other information systems. Raw data can be processed to be converted in information, which in turn can be stored in the Internal Database for later use. The Database Manager takes responsibility to acquire external data and mediating the access to Internal Database. The Model Database Manager stores meta-data about analytical models contained in Model Database and is used to manipulate these models during decision making processes [4]. The Dialogue Manager provides the user interface layer that combines the expertise of Decision Makers and system analytical capabilities comprised both in Model and Internal Databases, providing the greatly needed interactivity to DSS.

Figure 2 depicts a node named A, which represents a set of data related to supply. B) Edge An edge represents a set of functionality that transforms a set of input data to their output. In figure 3, E1 represents an edge represents the function of price on demand. There must be connectivity via an edge between two nodes. In this case only, we can call it a basic model. In short, an edge makes a model by connecting two nodes in particular. Figure 3, as a whole is a basic model as it has 2 nodes (A & B) with one edge (E1). We can represent this basic model as a triple (A, E1, B). C) Node An AND node is the ending node of more than one basic model. An AND node is true only if all edges ending on that node are true. Figure 3 represents a AND Node as node A & B are resulting into node C.

3. GRAPH THEORY BASED FRAMEWORK FOR DSS DESIGNING

Research on DSS has increased since past decade but very few research attempts are made on inclusion of knowledge sharing concepts. Structured modeling (Geoffrion 1985) was the theory which focused on functional relationship among the models during modeling process [2]. Structure modeling considers each model of model base as single entity. Geoffrions work is the base of graph based approach presented here. The only difference between framework presented here and structuring modeling is the latter focuses on functional relationships among different models and consider high level of cohesion among these models. The proposed framework deals not only with representation of model, method of integrating and selecting models. 3.1 GRAPH BASED REPRESENTATION OF FRAMEWORK Volume 1, Issue 2 July-August 2012

Figure 3: AND Node D) OR Node - An OR node is the ending node of more than one basic model. An OR node is true only if at least one edge ending at the node is true. In this research work, OR node is depicted as ellipse. E) Path A path is a finite sequence of edges of the form that a. These edges are connected. b. Only one edge is true out of all that enters at each OR node. c. All edges are true that enters at each AND node. Page 46

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 2, July August 2012 ISSN 2278-6856
depth-first search, breadth-first search and best-first search [9]. For the purpose of formulation of our model graph, the depth-first and best-first search are more suitable as they both support modeling concepts. The basic techniques of modeling are optimization and satisficing. The depth-first search strategy picks an alternative at one node arbitrary and work forward. As long as any hope of reaching the destination using first alternative, the other alternatives remains ignored. In case of the first alternative gets proved wrong in desired solution, the process starts again with another alternative. A typical process of handling user query using depthsearch technique is as follows
Step 1: Search for an OUTPUT relation in the model base to see whether there is model that produce desired output. Step 2: If no such model is found, then stop searching and report about same. The system may ask user to develop new model. Step 3: If a model is available, search INPUT relation to get input data for execution of the model. Step 4: Repeat the following sequence until all inputs are found or one/more input data is not available 4.1 Take one input and check whether its an output of its preceding model. a. If it is true then drop this model and move to step 3. b. If it is not true then skip this procedure. 4.2 Search the database for availability. a. If the input is available in the database, then retrieve its value and go to step 4.1 b. If the input not available, then go to step 4.3. 4.3 Search the OUTPUT relation of the model to see whether it can be produced by a model. a. If no model is available, go to step 4.4 b. If a model is found, go to step 4.5. 4.4 Prompt the user for the input. a. If it is provided by the user, obtain the value and go to step 4.1 b. If not so, then drop the model. 4.5 Search the INPUT relation of the model to find input data required for execution. Repeat step 4 until all input data have been obtained or one input in proved unavailable. Step 5: If all input data for model execution is available, the check integrity constraints. 5.1 If any of integrity constraint is not satisfied, then drop the model. 5.2 If all constraints are satisfied, then add the model to the model graph. Step 6: Check whether any other model producing the desired information. 6.1 If there is another model then go to step 3. 6.2 Otherwise, stop the process.

Figure 4: OR Node F) Composite Model A composite model is an integrated set of set of basic models. G)Model graph - A model graph is a graph that represents all possible models i.e. basic model and composite models. In a model graph, each path represents a model. One of the most important properties of model graph is its acyclic nature. 3.2 BASIC MODEL After understanding the graph representation of the model, now, we can portray our basic model. The model is built upon 5 basic types of information: the output of the model, inputs required, and computational methods used in the model, integrity constraints and validity of model. All models have 5 basic relations and our model also has same as follows INPUT (Model#, Inputs) OUTPUT (Model#, Outputs) OPERATIONS (Model#, Functions) INTEGRITY (Model#, Constraints) VALIDITY (Model#, Validation) Here, Inputs and Outputs may have N number of parameters i.e. input1, input2..input n and so forth. The context free model presented above can be mounted on the graph based implementation described in previous section. The Inputs and Outputs relations are formulating a model graph. The Operations relation is represented as an edge. The integrity relation of the model specifies constraints which must be satisfied before considering the model as applicable. The validity relation is essential for measuring the fitness of the model for a particular type of problem. Validity of a model gives it a subjective confidence about the proposed successful implementation of the model [6]. 3.3 MODEL FORMULATION Formulation of model graph requires an extensive search in database and the model base as well. Many approaches are developed for creating and traversing a search tree i.e. Volume 1, Issue 2 July-August 2012

3.4 MODEL SELECTION TECHNIQUES In the previous section, we have devised formulation of model graph. In this section, we will discuss the strategies for providing necessary advice. There are two different strategies for this: optimizing and satisficing [8].

Page 47

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 2, July August 2012 ISSN 2278-6856
The optimizing strategy requires a complete model graph and then evaluation will take place to find the best alternative. Given the validities of all models are available; the optimizing strategy will maximize the validity of the selected alternative. Although the optimization strategy ensures that, given the criteria, the formulated model is the best available alternative, sometimes it becomes unreal to for a system to develop complete model graph. For example, if a model has b branches with d level of depth, depth-first search technique will raise O (bd) time complexity to find the optimized solution (Korf 1987). Hence, in such kind of situations, we need to adapt satisficing strategy which requires evaluation of each path as soon as it is found and accept it if it satisfactory. Hence, formulation of complete model graph may not be mandatory [11]. The satisficing strategy is not much different from others except it evaluates each path at same time of its formulation. The process of formulating model graph is terminated immediately after finding a satisfactory path. The selected path will be developed further to produce the desired output. Figure 5 depicts the process of modeling to implement the satisficing strategy. problem. We need one quantitative measure of validity in order to select best model in model graph [6]. Therefore, we need a model evaluation function which will determine the validity of model on the basis of some predefined criteria. There are three points need to be taken into consideration while developing model evaluation function. First is, the criteria for determining validity values. We can have four possible criteria as 1) degree of accuracy of model, 2) users preference, 3) costs incurred, and 4) numbers of models integrated in (Liang & Jones, 1988). The following is the roadmap in order to reduce complexity of the model evaluation function. Step 1: Determine the validity of each model. VALIDITY function will validate each model. Step 2: Remove dominated alternatives and simplify the problem i.e. if more than one model produces desired output then select the one with highest validity. Step 3: Calculate validities of all alternative paths from initial state to the final state. Step 4: Select the model with highest validity. In case of a complete model graph has been formulated and validities of more than one model are equal then we can select model on the basis of some other non technical constraints i.e. modeling time or machine time. If the satisficing strategy has been implemented and complete model graph is not available then selection can be made on the basis of predetermined cutoff value.

4. ANALYSIS
We have devised one framework for creating and utilizing Model Base management system. The process starts with presenting notions used in the formulation i.e. node, graph. After this, the basic model is being defined with five kinds of basic operations. Model formulation is the next task in the process in which an appropriate model is being searched which suits requirements of the particular problem. Depth first search algorithm is used to formulate the model graph which handles user queries. The last section presents the model selection techniques for which satisficing technique is used. One model evaluation function is being incorporated to validate the usefulness of the model in case of multiple models suits to one given problem.

5. CONCLUSION
This paper has presented an approach to provide DSS with flexibility to problem characteristics and adaption to user cognitive profile. This approach was comprised by a method that employs user cognitive profile information for decision models creation The current version of the modern DSS employed only Decision Trees to solve classification databases. It is important to highlight that the proposed approach is abstract and thus independent of technique and class of problem. Results shown could be further improved by fine tuning algorithmic parameters Also, other classification Page 48

Figure 5: Modeling with satisficing Strategy One of the major issues involved in implementation of satisficing strategy is the development of model evaluation functions. This need arises when more than one model is suitable for some specific problem. The Model Management System needs validity values of all models to determine which model is best for given Volume 1, Issue 2 July-August 2012

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 1, Issue 2, July August 2012 ISSN 2278-6856
techniques could be employed to further improve system accuracy and capability to deal with different problems. For example, even though not eloquent regarding explanations about classifications performed by Artificial Neural Networks (Haykin, 1994) they could be used to double check if a classification is correct. of International Joint Conference on Neural Networks-IJCNN, 2008, Hong Kong, China. [13] Quinlan, R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers, San Mateo, CA. [14] Zitzler, E.; Laumanns, M & Thiele, L. (2008). SPEA2: Improving the strength pareto evolutionary algorithm, Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), 2001. AUTHORS Prof. Dr. M. P Thapliyal is M.Sc in Electronics and Ph.D in Physics. He is working as Associate Professor in Computer Science Department of HNB Garhwal University, Srinagar Garhwal, Uttrakhand. He has more than 15 years of teaching experience. Sandeep Kautish has M.Sc in Computer Science, MCA with over 08 years of experience in teaching. He is research scholar for Ph.D. in Computer Scinece.

REFERENCES
[1] Aitkenhead, M. (2008). A Co-evolving Decision Tree Classification Method, Expert Systems with Applications, n. 34, 2008, p. 18-25. [2] Breiman, L.; Friedman, J.; Olshen, R. & Stone, C. (1984). Classification and regression trees, Wadsworth, 1984. [3] Chacrkaborty,I; Hub, J. & Cuid, D. (2008). Examining the effects of cognitive style in individuals' technology use decision making, Decision Support Systems, Vol. 45, 2008, pp. 228241. Decision Support Systems, Advances in 290 [4] Chiavenato, I. (2004). Administrao nos novos tempos, 2nd Ed., Elsevier, Rio de Janeiro, 2004. [5] Deb, K.; Pratap, A.; Agarwal, S. & Meyarivan, T. (2000). A fast and elist multi-objective Genetic algorithm: NSGA-II, KanGAL technical report, Indian Institute of Technology, Kanpur, India, 2000. [6] Djamasbi, S. & Stronga, D. (2008). The effect of positive mood on intention to use computerized decision aids, Information & Management,Vol. 45, 2008, pp. 43-51. [7] Eberhart, R. & Kennedy, J. (1995). A new optimizer using particle swarm theory, Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan. p. 39-43, 1995. [8] Laudon, K. & Laudon, J. (2004). Sistemas de informao gerenciais: administrando a empresa digital, 5 Ed., Pearson Prentice Hall, 2004. [9] Moreau, E. (2006). The impact of intelligent decision support systems on intellectual task success: An empirical investigation, Decision Support Systems, n. 42, p. 593-607, 2006. [10] Newman, D.; Hettich, S.; Blake, C. & Merz, C. (1998). UCI Repository of machine learning databases, University of California, Irvine, Dept. of Information and Computer Sciences. USA, 1998. [11] Oliveira, F. & Lima Neto, F. (2008). An Evolutionary Approach to Provide Flexible Decision Dialogues in Intelligent Decision Support Systems, Proceedings of the 8th International Conference on Hybrid Intelligent Systems (HIS 2008), Barcelona, Spain, 2008. [12] Pacheco, D.; Oliveira, F. & Lima Neto, F. (2008). Including Multi-objective Abilities in the Hybrid Intelligent Suite for Decision Support, Proceedings

Volume 1, Issue 2 July-August 2012

Page 49