Application of Fuzzy Soft Set Theory in Day to Day Problems

Similar documents
On the Algebraic Structures of Soft Sets in Logic

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

Types of Degrees in Bipolar Fuzzy Graphs

A FUZZY LOGIC APPROACH FOR SALES FORECASTING

An Evaluation Model for Determining Insurance Policy Using AHP and Fuzzy Logic: Case Studies of Life and Annuity Insurances

Continued Fractions and the Euclidean Algorithm

Performance Appraisal System using Multifactorial Evaluation Model

Credit Risk Comprehensive Evaluation Method for Online Trading

Enhanced data mining analysis in higher educational system using rough set theory

THE ANALYTIC HIERARCHY PROCESS (AHP)

High-Mix Low-Volume Flow Shop Manufacturing System Scheduling

EMPLOYEE PERFORMANCE APPRAISAL SYSTEM USING FUZZY LOGIC

OBJECT ORIENTED SOFTWARE SYSTEM BASED ON AHP

A FUZZY BASED APPROACH TO TEXT MINING AND DOCUMENT CLUSTERING

How to do AHP analysis in Excel

DATA ANALYSIS II. Matrix Algorithms

Comparative Analysis of FAHP and FTOPSIS Method for Evaluation of Different Domains

ROUGH SETS AND DATA MINING. Zdzisław Pawlak

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Similarity and Diagonalization. Similar Matrices

Two classes of ternary codes and their weight distributions

Optimization under fuzzy if-then rules

1 Solving LPs: The Simplex Algorithm of George Dantzig

Big Data with Rough Set Using Map- Reduce

Decision Making on Project Selection in High Education Sector Using the Analytic Hierarchy Process

What is Linear Programming?

Solving simultaneous equations using the inverse matrix

Linear Programming. March 14, 2014

4 UNIT FOUR: Transportation and Assignment problems

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

Product Selection in Internet Business, A Fuzzy Approach

Optimization of Fuzzy Inventory Models under Fuzzy Demand and Fuzzy Lead Time

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

1.2 Solving a System of Linear Equations

Just the Factors, Ma am

Klaus D. Goepel No 10 Changi Business Park Central 2 Hansapoint@CBP #06-01/08 Singapore drklaus@bpmsg.com ABSTRACT

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices

Project Management Efficiency A Fuzzy Logic Approach

Selection of Database Management System with Fuzzy-AHP for Electronic Medical Record

Recall that two vectors in are perpendicular or orthogonal provided that their dot

Adopting an Analytic Hierarchy Process to Select Internet Advertising Networks

Keywords Evaluation Parameters, Employee Evaluation, Fuzzy Logic, Weight Matrix

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Linear Algebra Notes for Marsden and Tromba Vector Calculus

1 Review of Least Squares Solutions to Overdetermined Systems

The Application of ANP Models in the Web-Based Course Development Quality Evaluation of Landscape Design Course

The BBP Algorithm for Pi

CURVE FITTING LEAST SQUARES APPROXIMATION

How To Understand And Solve A Linear Programming Problem

Introduction to Matrix Algebra

Data Mining: Algorithms and Applications Matrix Math Review

Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

Intuitionistic fuzzy load balancing in cloud computing

DEA implementation and clustering analysis using the K-Means algorithm

Portfolio selection based on upper and lower exponential possibility distributions

CSP Scheduling on basis of Priority of Specific Service using Cloud Broker

METHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS.

11 Multivariate Polynomials

Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level

MISSING DATA IMPUTATION IN CARDIAC DATA SET (SURVIVAL PROGNOSIS)

Introductory Notes on Demand Theory


Decision-making with the AHP: Why is the principal eigenvector necessary

Linear Algebra Notes

CS 3719 (Theory of Computation and Algorithms) Lecture 4

LEAF COLOR, AREA AND EDGE FEATURES BASED APPROACH FOR IDENTIFICATION OF INDIAN MEDICINAL PLANTS


Direct Methods for Solving Linear Systems. Matrix Factorization

QOS Based Web Service Ranking Using Fuzzy C-means Clusters

An interval linear programming contractor

24. The Branch and Bound Method

A Method for Solving Linear Programming Problems with Fuzzy Parameters Based on Multiobjective Linear Programming Technique

Mathematical finance and linear programming (optimization)

MULTICRITERIA MAKING DECISION MODEL FOR OUTSOURCING CONTRACTOR SELECTION

Matrix Differentiation

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

4.6 Linear Programming duality

A Novel Fuzzy Clustering Method for Outlier Detection in Data Mining

Manufacturing and Fractional Cell Formation Using the Modified Binary Digit Grouping Algorithm

Math Content by Strand 1

A simple analysis of the TV game WHO WANTS TO BE A MILLIONAIRE? R

The fundamental question in economics is 2. Consumer Preferences

INTERNATIONAL JOURNAL FOR ENGINEERING APPLICATIONS AND TECHNOLOGY. Ameet.D.Shah 1, Dr.S.A.Ladhake 2.

14.1 Rent-or-buy problem

Implementation of Data Mining Techniques to Perform Market Analysis

Greatest Common Factors and Least Common Multiples with Venn Diagrams

A Robust Formulation of the Uncertain Set Covering Problem

1 Nonzero sum games and Nash equilibria

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Data Mining Project Report. Document Clustering. Meryem Uzun-Per

A Comparative Study of the Pickup Method and its Variations Using a Simulated Hotel Reservation Data

1 Introduction to Matrices

Word Problems Involving Systems of Linear Equations

Transcription:

pplication of uzzy Soft Set Theory in Day to Day Problems Krishna ogoi Devicharan Barua irls College, Jorhat, ssam lock Kr. Dutta Bahona College, Bahona, Jorhat, ssam Chandra Chutia Jorhat Institute of Science and Technology, Jorhat, ssam BSTRCT In our daily life we often face some problems in which the right decision making is highly essential.but most of these cases we become confused about the right solution.to obtain the best feasible solution of these problems we have to consider various parameters relating to the solution.or this we can use the best mathematical tool called uzzy soft set theory.in this paper we select a burning problem for the parents and successfully applied the uzzy soft set theory in decision making.. KEYWORDS uzzy set_1, uzzy Softset, Decision Matrix 1. INTRODUCTION The most appropriate theory for dealing with uncertainty in the theory of uzzy Sets developed by Zedeh [ 1 ] in 1965. uzzy Set is defined by its membership function, whose values are defined on the interval [0,1]. Pawlak introduced rough set theory [ 3 ] in 1982, which is another significant approach to modeling vagueness. This theory has been successfully applied to many field such as machine learning, data mining, data analysis, medicine etc. Presently work on the Soft Set theory is progressing rapidly. Maji et al. [4] described the application of Soft Set theory for decision-making problems by using rough sets. Chen et al., [ 13 ] introduce a new definition of Soft Set parameterization reduction and compare his definition to the related concept of attributes reduction in rough set theory. Rosenfeld [14] proposed the concept of uzzy group in order to establish the algebraic structure of uzzy Sets. Rough groups were defined by Biswas et al. [15] and have studied the algebraic properties of rough sets. Before going to the main objectives of our study we need the following notations for better understanding the topic 1.1 Important Notations Let us recall the notation of uzzy Sets as follows : or every set X, define its indicator function 1, if x 0, if x uzzy Set is described by its membership function. x X or every, this function associates a real number (x) (x) in the internal [0,1]. The number is interpreted for the point as a degree of belonging x to the uzzy Set., Let and be two uzzy Set and are their membership functions. The complement C is defined by its membership functions as C 1 The union following membership functions. can be defined by any one of the max{, }. min{1,, } The intersection following membership function. can be defined by any one of the min{, }. max{0, 1} Though the uzzy Set is progressing rapidly, but there exists a difficulty; how to set the membership function in each particular case. To avoid such difficulties, Molodtsov [ 2 ] use an adequate parameterization. U be an initial universal set and E be a set of parameters. The pair (, E) is called a Soft Set (over U) if and only if is a mapping of E into the set of all subsets of U. Hence the Soft Set is a parameterized family of subsets of the (), E set U. Every set, from this family may be considered as the set of - element of the Soft Set (, E). 2. PPLICTION O SOT SET THEORY Molodtsov [ 2 ] presented some applications of the soft set theory in several directions viz. study of smoothness of functions, game theory, operations research, Riemannintegration, Perron integration, probability, theory of measurement, etc. In this section, we present an application of soft set theory in a decision making problem with the help of rough approach [3].Let us now formulate our problem as follows: Problem: Let U= {c 1,c 2,c 3,c 4,c 5,c 6,c 7 } be the set of seven cars and E={ expensive, fuel efficiency, spacious, maintenance free, ecofriendly, high security measure } are set of parameters.let (,P) be a soft set representing the suitable cars given by (,P) ={ expensive cars= { c 2,c 3,c 5,c 7 }, fuel efficiency= {c 1,c 2,c 3,c 4 } spacious={c 4,c 5,c 6,c 7 },maintenance free= {c 2, c 4, c 6,c 7 } ecofriendly = {c 1,c 2,c 3,c 4,c 5,c 6 }, high security measure = { c 3,c 4,,c 6,c 7 } } Suppose that Mr X wants to buy a car consisting the parameter fuel efficiency, spacious, ecofriendly,high security measure which forms the subset 27

P={ fuel efficiency, spacious, ecofriendly,high security measure }of the set E. The problem is to select the car which is suitable with the choice parameters set by Mr X. Solution: Let us first make a tabular representation of the problem: Consider the soft set (, P) where P is the choice parameter of Mr X. Suppose h ij = 1 if h i Є ( Є) = 0 if hi Є ( Є) e 1 e 2 e 4 choice value c 1 1 0 0 p 1 =1 c 2 1 0 0 p 2 =1 c 3 1 0 1 p 3 =2 c 4 1 1 1 p 4 =3 c 5 0 1 0 p 5 =1 e 1 e 2 e 3 e 4 C 1 1 0 1 0 C 2 1 0 1 0 c 6 0 1 1 p 6 =2 c 7 0 0 1 p 7 =1 C 3 1 0 1 1 Where e i ЄP, i= 1,2,3,4 C 4 1 1 1 1 C 5 0 1 1 0 C 6 0 1 1 1 C 7 0 0 1 1 REDUCT TBLE O SOT SET: Here P is subset of E so, (,P) is a soft subset of (,E) Let Q be a reduct of P. Then soft set(,q) is called reduct softest of the softest(,p) Choice value of an object C i The choice value of an object Ci U is pi where P i = c ij, where c ij is the entries in the table of reduct-softset. j Where C i, in the entries in the table of reduct softest.( [13],) LORITHM OR SELECTION O CR To select the car for Mr. X, the following algorithm may be followed- 1. Input the softest (,E). 2. Input the set P of the choice parameter for Mr. X, 3. ind all reduced soft sets of(,p). 4. Choose one reduced-softset say(,q) of (,P) 5. ind k for which P k =max p i Then C k in the optional choice object of K has more than one value, than any one of them could be chosen by Mr. X. Using the above algorithm we try to solve the above problem. Here P={e 1,e 2,e 3,e 4 }. rom table we see that { e 1,e 2,e 4..} is the reduct of P. Using choice value the reduct-soft-set can be tabulated as- Here max p i =p 4 DECISION : Mr X can buy the car c 4 Weighted table of a soft set Lin [ 16 ] introduced the theory of W-soft set which is weighted soft set. The weighted choice value of an object c i ЄU is Wp i where Wp i = d ij such that d ij =w j x e ij The revised lgorithm for selection of car --- 1. Input the softset (,E) 2. Input the set P of choice parameter for Mr X which is a subset of E 3. ind all reduct-softset of (,P) 4. Choose one reduct-softset (,Q) 5. ind weighted table of the softset (,Q) according to the weights decided by Mr X. 6. ind k for which Wp i = max Wp i Then c k is the optional choice object. If k has more than one value, then any one of them could be chosen by Mr X by using his option. Let us try to solve the original problem by using revised algorithm. Suppose Mr X sets the weights for the parameter as follows fuel efficiency------------w 1 =0.9 spacious------------------w 2 =0.7 ecofriendly--------------w 3 =0.6 high security measure w 4 =0.5 Using these weights the reduct-softset can be tabulated as 28

w j x e 1 Here max Wp i =Wp 4 w j x e 2 w j x e 4 Choce value Wp i c 1 0.9 0 0 0.9 c 2 0.9 0 0 0.9 c 3 0.9 0 0.5 1.4 c 4 0.9 0.7 0.5 2.1 c 5 0 0.7 0 0.7 c 6 0 0.7 0.5 1.2 c 7 0 0 0.5 0.5 DECISION : Mr X can buy the car c 4 Mr X is facing a problem for choosing the suitable course for his son among the available courses medical, engineering,computer application, pure science and humanities which are denoted by m, e, c, p and h respectively. He seeks advice from four counseling agencies a 1, a 2, a 3,a 4. The four agencies provided the information about the courses considering the parameters availability of seat,future prospects, affordability, studentfriendly curriculum, job security and eligibility of the student which are denoted by s 1,s 2,s 3,s 4, s 5 and s 6 respectively. U={m, e, c, p, h }be the set of courses for study and S={s 1, s 2, s 3, s 4, s 5, s 6 } be the set of parameters. The information provided by the counseling agencies forms the fuzzy soft sets ( 1,S),( 2,S),( 3,S)and ( 4,S) over U where 1, 2, 3, 4 are mappings from S into I U, where I U is the set of all fuzzy subsets of U given by the counseling agencies. 1 (s 1 ) = 1 (s 2 ) = 1 (s 3 ) = 1 (s 4 ) = 1 (s 5 ) = 1 (s 6 ) = 2 (s 1 ) =, 2 (s 2 ) = 3 (s 1 ) = 3 (s 2 ) = 3 (s 3 ) = 3 (s 4 ) = 3 (s 5 ) = 3 (s 6 ) = 4 (s 1 ) = 4 (s 2 ) = 4 (s 3 ) = 4 (s 4 ) = 4 (s 5 ) = 4 (s 6 ) = LORITHM We shall follow the following algorithm for the solution of the problem discussed above. 1. Input the performance evaluation of courses by different counseling agencies as matrix. 2. ind the average of the corresponding entries of all the matrices in step I 3. Multiply the weightage of different courses of the guardian to the corresponding entries of each row to get the comprehensive decision matrix. 4. ormulate the comparison table 5. ind the row-sums and column-sums of the comparison table 6. Obtain the score for each product and the product of with maximum score is ecommended as the best choice. Now the matrix representation of above four fuzzy soft set ( 1,S),( 2,S),( 3,S)and ( 4,S) are as follows ( 1,S)= 0.5 0.6 0.5 0.8 0.9 0.8 0.7 0.6 0.4 0.3 0.1 0.2 0.3 0.6 0.8 0.3 0.4 0.5 0.4 0.8 0.9 0.8 0.7 0.6 0.2 0.1 0.2 0.3 0.5 0.8 2 (s 3 ) = 2 (s 4 ) = 2 (s 5 ) = 2 (s 6 ) = 29

( 2,S)= 0.58 0.67 0.56 0.86 0.95 0.89 0.87 0.69 0.45 0.36 0.19 0.27 0.34 0.57 0.89 0.2 0.35 0.40 0.45 0.70 0.85 0.87 0.73 0.61 0.23 0.18 0.24 0.37 0.56 0.78 Suppose that Mr X sets the preference weightage fo the different courses as W = such that w j =1 m e c p h 0.3 0.3 0.275 0.1 0.025 The comprehensive decision matrix D can be obtained by multiplying row by row by the weightage matrix W and the transposing it as follow ( 3,S)= 0.52 0.59 0.6 0.85 0.91 D = 0.54 0.84 0.16 0.29 0.87 0.13 0.79 0.75 0.65 0.43 0.25 0.62 0.80 0.25 0.36 0.85 0.23 0.15 0.22 0.40 0.70 0.90 0.55 0.66 0.39 0.46 0.74 0.33 0.25 0.35 0.45 0.50 0.75 0.82 0.45 0.64 0.47 0.63 0.53 0.87 0.88 0.75 0.65 0.30 0.92 0.33 0.87 0.78 0.24 0.82 0.13 0.22 0.35 0.49 0.85 The comparison table of the above comprehensive decision matrix is ( 4,S)= 0.55 0.63 0.54 0.75 0.91 0.88 0.86 0.70 0.50 0.40 0.20 0.30 0.50 0.70 0.90 0.85 0.84 0.78 0.65 0.23 0.12 0.25 0.30 0.57 0.85 m e c p h Row-sum m 6 2 3 4 6 21 e 4 6 3 6 6 25 c 3 3 6 6 6 24 p 2 0 0 6 6 14 h 0 0 0 0 6 6 Columnsum 15 11 12 22 30 Taking t he average of the above four fuzzy soft sets we get the performance evaluation matrix as The row-sum and the column-sum from the comprehensive decision matrix and the score for each c i are as below = 0.54 0.62 0.55 0.82 0.92 0.84 0.80 0.66 0.45 0.33 0.16 0.25 0.39 0.64 0.87 0.29 0.36 0.46 0.47 0.78 0.87 0.85 0.74 0.63 0.24 0.13 0.23 0.33 0.53 0.82 Row-sum Columnsum Score m 21 15 6 e 25 11 14 c 24 12 12 p 14 22-8 h 6 30-24 30

Here we find that the maximum score is obtain by e, that is by the course ENINEERIN. Hence Mr X can choose the course ENINEERIN for his son. 3. CONCLUSION Thus we see that uzzy soft set theory is very much interesting and useful for solving the day to day problems. It helps to take decision making in a critical situation. 4. REERENCE [1] L..Zadeh,uzzy set,information and control 8, 338-353(1965) [2] D.Molodtsov,Soft set Theory irst Results, Computer and Mathematics with pplications 37 (1999) 19-31 [3] Z. Pawlak, Rough Sets, International journal of Information and Computer Sciences 11, 341-356, (1982) [4] P.K.Maji,.R.Roy and R.Biswas, n pplication of Soft sets in Decision Making Problem, Computer and Mathematics with pplications 44 (2002) 1077-1083. [5] Tutut Herawan, Soft Set Based Decision Making or Patients Suspected Influenza-Like Illness, International journal of Modern Physics :Conference series Vol.1 no.1 (2010) 1-5 [6] N. Cagman, S Enginoglu and.citak, uzzy soft settheory nd Its pplication, International journal of uzzy systemsvol.8 No. 3 (2011) pp 137-147. [7] P.K.Das and R.Borgohain, n pplication of uzzy Soft Set in Multicriteria Decision Making Problem, International journal of Computer pplications (0975-8887)Vol. 38 No 12,January 2012. [8] Prabitra Kumar Maji, neutrosophic soft set approach to a decision making problem, nnuals of uzzy Mathematics and Informatics, Vol.3, No.2, (pril 2012) pp.313-319 [9] yman Hazaymeh, I.B.blullah, Z. Balkhi and Rose Ibrahim, pplied Mathematical Sciences Vol. 6 2012, No.112, 5547-5564. [10] Shawkat lkhazaleh and bdul Razak Salleh, uzzy Soft Multiset Theory, bstract and pplied nalysis, Vol.2012 [11] Sudhir K. Pundir,Rimple Pundir, uzzy Sets and Their pplications, Pragati Prakashan,Third Edition 2010. [12] T.Y.Lin, set theory for soft computing, a unified view of fuzzy sets via neighborhood, In proceedings of 1996 IEEE International conference of fuzzy systems.new Orleans.L, September 8-11, pp.1140-1146,(1996 ) [13] D.Chen,E.C.C.Tsang,D.S.Yeung and X.Wang,The parameterization reduction of soft sets and its applications, Comput.Math.ppl. 49(2005), 757-763., [14].Rosenfeld, uzzy roups,j.maths.nal.ppl.35(1971)512-517 [15] R.Biswas,S.Nanda,Rough groups and rough subgroups, Bull.Polish cad.math. 42(1994). [16] T.Y.Lin, set theory for soft computing, a unified view of fuzzy sets via neighborhood, In proceedings of 1996 IEEE International conference of fuzzy systems.new Orleans.L, September 8-11, pp.1140-1146, (1996 ) 251-254 IJC TM : www.ijcaonline.org 31