Incentive-punitive risk function with interval valued ... - IOS Press

3 downloads 366 Views 146KB Size Report
DOI:10.3233/JIFS-169307. IOS Press. 3749. Incentive-punitive risk function with interval ... Yong Hub, Chao Mac, Jinhui Xud, Shenguo Yuana and Zhao Chena.
3749

Journal of Intelligent & Fuzzy Systems 32 (2017) 3749–3760 DOI:10.3233/JIFS-169307 IOS Press

Incentive-punitive risk function with interval valued intuitionistic fuzzy information for outsourced software project risk assessment Zhenhua Zhanga,∗ , Yong Hub , Chao Mac , Jinhui Xud , Shenguo Yuana and Zhao Chena a School

of Economics and Trade, Guangdong University of Foreign Studies, Guangzhou, China of Big Data and Decision Making, Jinan University, Guangzhou, China c Department of Computer Science, University College London, Gower Street, London, UK d Department of Statistics, Indiana University Bloomington, Indiana Avenue Bloomington, IN, USA b Institute

Abstract. By analyzing three parts of interval valued intuition fuzzy sets (IVIFS), we provide a novel framework constructing risk function with IVIFS information for risk analysis of outsourced software project. First, we introduced some risk factors of outsourced software project according to their hierarchical levels, and present a general risk function model. And then, some useful mathematical properties of this risk function are proved. Based on the mathematical properties of general risk function, all these presented specific risk functions are classified into four types: incentive function, punitive function, incentive-punitive function and equilibrium function. Especially, two kinds of incentive-punitive risk functions are focused on and a construction method for them is proposed. Finally, an application example for the risk assessment of outsourced software project illustrates the use of this decision making method. The simulation results show that these functions are effective in risk prediction. Keywords: Interval valued intuitionistic fuzzy sets, risk assessment, incentive-punitive risk function, equilibrium risk function, outsourced software project

1. Introduction Since Zadeh first introduced the concept of fuzzy set (FSs) [11], many extensions of the theory have been proposed, such as intuitionistic fuzzy set (IFS) [10], interval-valued intuitionistic fuzzy set (IVIFS) [9], interval-valued fuzzy set (IVFS) etc., which generalized FS theory. The introduction of IFS and IVIFS attracted many scholars to participate in the research. ∗ Corresponding

author. Zhenhua Zhang, Ph.D., School of Economics and Trade, Guangdong University of Foreign Studies, Guangzhou 510006, China. Tel.: +86 13660061726; Fax: +86 2039328096; E-mail: [email protected].

Some scholars applied them to multi attribute decision making and pattern recognition, and presented many order operators, similar operators, and distance measures. Some classical decision operators are gradually developed. According to Atanassov, two order operators derived from membership and nonmembership degree were introduced. Hence, Chen & Tan [16] proposed a dominant order operator, Hong & Choi [5] introduced a clarity ordering operator, Xu & Xia [14, 28] presented a relative ordering operator, Wei et al. [4] discussed how to construct order operator using distance, Zhang et al. [24–26] introduced the concept of order maintaining, and

1064-1246/17/$35.00 © 2017 – IOS Press and the authors. All rights reserved

3750

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

applied it to the construction of order operators and distance measures. Though many researchers studied IFS theory, few of them applied IFS to the study of risk assessment for software project development. Taking into account the fuzziness of Likert scale in outsourced software risk evaluation, it is necessary for us to introduce IFS method in this study. In the research of software development risk, early scholars majorly focused on principles [2] and project risk index system [1–3, 6, 8, 13, 15, 18, 29]. Wallace, Keil, and Nidumolu et al. studied the constitute of output & decision attributes for software project risk, and analyzed the effect of condition attributes to decision attributes qualitatively [12, 13, 17]. Jones, Xu and Khoshgoftaar et al. studied the assessment and control of software risk [1, 29]. Hu, Zhang, and Nagi et al. utilized Bayesian networks to construct causal analysis framework for software project risk [21, 22], and predicted the risk by supervised combinational model [19, 20]. In fact, for the research of unsupervised model applied to software project risk prediction, only conventional clustering method and fuzzy neural network are presented [12, 30]. Based on the research result on risk index systems and IVIFS method, Zhang et al. presented a semi-supervised method and a dynamic method in 2016 [23, 27]. In this paper, we propose some risk functions of outsourced software project according to the analysis of the construction on IVIFS, and apply them to risk assessment of outsourced software development. Firstly, we introduce the definition and some conventional order operators of IVIFS. Secondly, by analyzing the component of IVIFS, we present some risk functions with IVIFS information and their mathematical properties. Thirdly, the constructions of intermediate separation incentive-punitive and extreme separation incentive-punitive risk functions are introduced, respectively. Finally, we apply the conventional order operators and the presented risk functions to risk evaluation of outsourced software project development. The experimental results illustrate that all the proposed functions are valid methods.

− + ∀x ∈ X, MA (x) = [tA (x), tA (x)] ⊆ [0, 1],

NA (x) = [fA− (x), fA+ (x)] ⊆ [0, 1], + tA (x) + fA+ (x) ≤ 1. − + HA (x) = [πA (x), πA (x)] ⊆ [0, 1], − + πA (x) = 1 − tA (x) − fA+ (x) ∈ [0, 1], + − πA (x) = 1 − tA (x) − fA− (x) ∈ [0, 1].

Where MA (x), NA (x) and HA (x) are the interval of membership degree, non-membership degree and hesitant degree of x to A, respectively. According to the statistical background of IVIFS, it is well known that membership interval refers to the range of supporters, non-membership interval the scope of opponents, hesitation interval the range of the neutral. Definition 2. For two IVIFSs A and B, we obtain: A ⊆ B iff MA (x) ≤ MB (x), NA (x) ≥ NB (x), − + MA (x) ≤ MB (x) ⇔ tA (x) ≤ tB− (x), tA (x) ≤ tB+ (x),

NA (x) ≥ NB (x) ⇔ fA− (x) ≥ fB− (x), fA+ (x) ≥ fB+ (x). Obviously, the more supporters and the less opponents means the larger the membership degree and the smaller the non-membership degree for IVIFS, Thus, A being contained in B indicates that the supporters of A is less than that of B, and the opponents of A more than that of B. From IVIFS, two weighted operators of membership and non-membership degree are defined:  + − RM (A) = wA (x)(tA (x) + tA (x)). (2) x∈X

RNM (A) =



wA (x)(fA+ (x) + fA− (x)).

(3)

x∈X

Chen & Tan [16] presented a weighted dominant ranking operator as follows: RCT (A)  + = wA (x)((tA (x) − fA+ (x)) x∈X

2. Conventional weighted order operators Definition 1. In universe X, an IVIFS A is defined by [9]: A = {< x, MA (x), NA (x), HA (x) > |x ∈ X}

Where MA (x) : X −→ [0, 1], NA (x) : X −→ [0, 1], HA (x) : X −→ [0, 1] with the condition:

(1)

− + (tA (x) − fA− (x))).

(4)

Hong & Choi [5] proposed a weighted clarity operator according to the sum of positive and negative comments:

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

RHC (A)  + = wA (x)((tA (x) + fA+ (x)) x∈X − + (tA (x) + fA− (x))).

(5)

+ − + Where μ− A (x), μA (x), νA (x) and νA (x) are defined in Definition 1. Xu presented the following formula (6) [14, 28]:

RXu (A) =

m(A+ , A) . m(A+ , A) + m(A− , A)



+

A = {< x, 

(6)



− + max (tA (x)), max (tA (x)) A∈A A∈A

,



min (f − (x)), min (fA+ (x)) A∈A A A∈A

, |x ∈ X},

  − + A− = {< x, min (tA (x)), min (tA (x)) , 

A∈A

A∈A

 max (fA− (x)), max (fA+ (x)) , |x ∈ X}.

A∈A

A∈A

Xu proposed four operators from Equation (6) using four distance formulas.

3. Risk functions of IVIFS and their properties In the following, we will construct some risk functions on outsourced software project with IVIFS information. We design a risk attribute framework. We have collected more than 600 papers in this field since 1990s. According to our research in the past 10 years, we know that there are many risk factors of outsourced software project, involv-

3751

ing three aspects: Contractee risk, contractor risk and the complexity of the project. Many risk factors has a significant positive correlation effect on the development of the outsourced software project, such as the standard level of project development, practical development experiment, communication skills and collaboration level between contractee and contractor, etc. Next we will introduce some risk assessment methodology of outsourced software project with IVIFS information. Taking into account the specialty and particularity of the project development process of outsourced software, we utilize three first-level factors to analyze the risk of project development according to references [1–3, 6, 8, 12, 13, 15, 17–22, 29]: contractor risks, customer risks and project complexity risks. And Table 1 contains all the secondlevel risk factors. According to previous research [19–22, 30], we use 23 second-level risk factors with significant influence, 11 attributes of them belong to project complexity risks, 7 of them customs risks, and 5 them of them contractor risks. From reference [27], based on a survey data set focused on some small and medium companies undertaking software outsourced project from USA, Japan, and Southeast Asia, we analyzed all second-level risk factors by using supervised structural equation modeling, among them 14 secondary significant indexes (p < 0.05) with boldness are selected to form the most important attribute set. For example, considering the project manager of contractor risk, we adopt 5-level Likert scale according to years of experience in software development, the number of software development, and cooperation and communication level. Obviously, for a project manager, the more experience and

Table 1 Risk factors of outsourced software project analysis Project Complexity Risks 1 Development Cost 2 Lines(KLOC) 3 Number of Team Members 4 Development Time 5 Technology Complexity 6 Fun Point 7 Real-time and Security 8 Requirement Stability 9 Number of Collaborators 10 Schedule and Budget 11 Industry Experience

References [29] [1] [15] [1] [29] [1] [1] [3, 6, 13] [3, 13] [13, 29] [13, 18]

Customer Risks

References

1 Client Team Collaboration 2 Top Management Support 3 Client Department Support 4 Client Development Experiment 5 Business Environment 6 Level of IT Application 7 Business Process Contractor Risks 1 Project Manager 2 Development Team 3 Plan & Control 4 Development & Test 5 Engineering Support

[13, 15, 18] [13,15,18] [13, 15, 18] [15, 18] [18] [13] [18] References [13] [2, 13, 18] [2, 13] [8] [6, 13]

3752

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

development ability he has, the less development risk will be. IF a manager is very excellent in development, his IVIFS values will be {< x, [1, 1], [0, 0], [0, 0] > |x ∈ X} over x, where x is project manager attribute. Thus, his development risk will reach the minimum 0. For the worst manager, his development risk will be the largest. Target attribute is composed of 8 output attributes: Function, Performance, Information Quality, Maintainability, Satisfaction (Customer and User), Company Profits, Completion Degree in Time, Completion Degree in Budget [12, 17]. The options are Yes or No. A project is success project when 8 options are all Yes. In present studies [19, 20–22, 30], we have proposed a specific risk analyzing framework for the project development of outsourced software, and made use of Bayesian networks to analyze its development risk. Definition 3. Given A is an outsourced software project, and x ∈ X is an risk factor being taken into consideration, w is the weight vector of the attributes x. For each software project, its attribute value is shown by IVIFS as follows: A(x) = {< x, MA (x), NA (x), HA (x) > |x ∈ X}

Risk(A(x)) − + − + (x), tA (x), fA− (x), fA+ (x), πA (x), πA (x)) = R∗ (tA

(8) − + − + Where tA (x), tA (x), fA− (x), fA+ (x), πA (x), πA (x) are introduced in Definition 1. However, it is hard to find a suitable elementary function and construct the related risk function from formula (7). Thus, we should seek some more concise expressions of risk functions. Considering the correspondence between variables, we define:

A(x) = {< x, NAmax (x), NA (x), NAmid (x) > |x ∈ X}  + − = < x, [1−tA (x), 1 − tA (x)], [fA− (x), fA+ (x)], 

 − + 1 + fA− (x) − tA (x) 1 + fA+ (x) − tA (x) , 2 2  > |x ∈ X (9) Hence we obtain:

− + (x), tA (x)], [fA− (x), fA+ (x)], = {< x, [tA

Definition 5. Assume that A is an outsourced software project, and x ∈ X is its risk factor. We define:

− + [πA (x), πA (x)] > |x ∈ X} − + = {< x, [tA (x), tA (x)], [fA− (x), fA+ (x)], + − [1 − tA (x) − fA+ (x), 1 − tA (x) − fA− (x)]

> |x ∈ X}

Definition 4. A is an outsourced software project, and x ∈ X is an risk factor. We note Risk(A(x)) to be a risk function of IVIFS A for risk attribute x ∈ X. Then a general risk is given by:

(7)

Where the definition is the same with Definition 1. And MA (x) indicates the support degree of the outstanding performance with regard to project A in factor x, while NA (x) the opposition degree of the outstanding performance with respect to project A in factor x. For example: S = | x ∈ X means MS (x) = [1, 1], NS (x) = [0, 0] and HS (x) = [0, 0]; F = | x ∈ X means MF (x) = [0, 0], NF (x) = [1, 1] and HF (x) = [0, 0]. Where S means that everyone thinks that all the influence factors perform excellently in this project, thus it represents a successful project (Membership degree intervals are all [1, 1]). On the contrary, F shows a failure project because its influence factors perform the worst (Non-Membership degree intervals are all [1, 1]). According to IVIFS, we provide a general risk function (8) for risk factor x ∈ X.

Risk(A(x))  − + = R∗ 1 − tA (x), 1 − tA (x), fA− (x), fA+ (x),  − + 1 + fA− (x) − tA (x) 1 + fA+ (x) − tA (x) , (10) 2 2 Theorem 1. Equation (8) is equivalent to Equation (10). Proof. It is obvious that Equation (10) can be − + expressed by tA (x), tA (x), fA− (x), fA+ (x). Thus, we only need to prove that Equation (8) can be expressed by: − + 1 − tA (x), 1 − tA (x), fA− (x), fA+ (x), − + (x) 1 + fA+ (x) − tA (x) 1 + fA− (x) − tA , . 2 2 − + tA (x), tA (x), fA− (x), fA+ (x) are − + tA (x), 1 − tA (x), fA− (x), fA+ (x). − + (x) can prove πA (x) and πA

equivalent to 1 − Thus, we only be expressed by

Z. Zhanga et al. / Incentive-punitive risk function with interval valued − + 1 − tA (x), 1 − tA (x), fA− (x), fA+ (x). According to − + + − (x) = 1 − tA (x) − πA (x) = 1 − tA (x) − fA+ (x), πA − − + fA (x), we know that πA (x) and πA (x) can also be − + (x), 1 − tA (x), fA− (x), fA+ (x) represented by 1 − tA easily. Therefore, Equation (8) is equivalent to Equation (10).

Theorem 2. For two IVIFSs A & B, we have: If R∗ (a1 , a2 , a3 , a4 , a5 , a6 ) satisfy: For each ak , ∂R∗ ∂ak ≥ 0, (k = 1, 2, 3, 4, 5, 6), then we obtain: A ⊆ B ⇒ Risk(A(x)) ≥ Risk(B(x)). Theorem 2 shows that monotone increasing function can maintain the order of IVIFS, which means that if A and B are two IVIFSs and A ⊆ B, and the risk function is a monotone increasing function, then we conclude that the risk of A is more than that of B. ∗ ak , ∂R ∂ak

Proof. For each ≥ 0, (k = 1, 2, 3, 4, 5, 6), if ak ≤ bk (k = 1, 2, 3, 4, 5, 6), then we have: R∗ (a1 , a2 , a3 , a4 , a5 , a6 ) ≤ R∗ (b1 ,b2 , b3 , b4 , b5 , b6 ). For two IVIFSs A & B, and A ⊆ B is equivalent to MA (x) ≤ MB (x), NA (x) ≥ NB (x), then ⎧ − tA (x) ≤ tB− (x) ⎪ ⎪ ⎪ ⎪ ⎨ t + (x) ≤ t + (x) B A → − − f (x) ≥ f ⎪ B (x) ⎪ ⎪ A+ ⎪ ⎩ f (x) ≥ f + (x) B A



⎧ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨

− 1 − tA (x) ≥ 1 − tB− (x) + 1 − tA (x) ≥ 1 − tB+ (x)

1+f − (x)−t − (x)

1+f − (x)−t − (x)

B A A B ≥ ⎪ ⎪ 2 2 ⎪ ⎪ + + + + ⎪ ⎩ 1+fA (x)−tA (x) ≥ 1+fB (x)−tB (x) 2 2  − + → R∗ 1 − t A (x), 1 − tA (x), fA− (x), fA+ (x),

 − + 1 + fA− (x) − tA (x) 1 + fA+ (x) − tA (x) , 2 2  ≥ R∗ 1 − tB− (x), 1 − tB+ (x), fB− (x), fB+ (x), 1 + fB− (x) − tB− (x) 1 + fB+ (x) − tB+ (x) , 2 2



→ Risk(A(x)) ≥ Risk(B(x)). Theorem 1 demonstrates that Formula (8) is equivalent to Formula (10), which shows that Equation (10) can be applied to construct risk function.

3753

Theorem 2 proves that each monotonically increasing function in [0, 1]6 can be used as a risk assessment model. Theorem 3. For two IVIFSs A & B, R∗ : [0, 1]6 −→ RS is a monotonically increasing function in [0,1]6 , then  + − + R∗ 1 − μ− A (x), 1 − μA (x), νA (x), νA (x), + − + 1 + νA (x) − μ− A (x) 1 + νA (x) − μA (x) , 2 2



is a suitable risk function satisfying A ⊆ B ⇒ R∗ (A(x)) ≥ R∗ (B(x)). Where risk value set RS is a real number set. Let R∗ (A(x)) 

− = ω(x) R(1 − tA (x)) x∈X + +R(1 − tA (x)) + R(fA− (x)) + R(fA+ (x))   − (x) 1 + fA− (x) − tA +R 2   + 1 + fA+ (x) − tA (x) +R (11) 2

Where R(ak ), the component function of R∗ (A(x)), is an increasing function in the domain [0, 1]. According to Theorem 2, each monotonically increasing function in [0, 1]6 is with the condition being a risk function. If R(ak ) is a monotonically increasing function in [0, 1], then R∗ (A(x)) is a risk function. If R(ak ) is a linear function, then R(ak ) changes evenly followed with ak . Thus it is an equilibrium risk-function. If R(ak ) is a monotonically increasing convex function, then it is easy to infer that when ak approaches boundary value 0, the risk function value is sharply reduced to 0 and the possibility of success of the project greatly increased. Hence, we define it incentive risk-function. Similarly an increasing concave function means a punitive risk-function. Definition 6. For formula (11), if R(ak ) is a monotonically increasing convex function over [0,1], we call R∗ (A(x)) incentive risk-function; if R(ak ) is a monotonically increasing concave function over [0,1], we call it punitive risk-function; and if R(ak ) is a monotonically increasing linear function over [0,1], we call it equilibrium risk-function.

3754

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

Theorem 4. For formula (11), if dR(ak ) dak ≥ 0, R(ak ) is an incentive d 2 R(ak ) k) > 0& dR(a dak ≥ 0, R(ak ) is dak2 2 R(a ) k k) function; and if d da = 0& dR(a 2 dak k

d 2 R(ak ) ∂ak2

< 0 and

risk-function; if a punitive risk≥ 0, R(ak ) is an

equilibrium risk-function.

Inference 1. For formula (11), if

∂2 R∗ (ak ) ∂ak2

< 0,

R∗ (A(x)) is an intermediate separation incentive risk

∂2 R∗ (ak ) > 0, R∗ (A(x)) is a punitive risk ∂ak2 2 ∗ and if ∂ R∂a2(ak ) ≡ 0, R∗ (A(x)) is an equilibk

function; if function;

rium risk-function.

Definition 7. For formula (11), R(ak ) is a monotonically increasing function over [0,1], which means dR(ak ) dak ≥ 0,. There is a threshold value a, if R(ak ) satisfies: When 0 ≤ ak ≤ a, d ak ≤ 1,

d 2 R(ak ) dak2

2 R(a ) k dak2

> 0; when a ≤

< 0; then R∗ (A(x)) is an intermedi-

ate separation incentive-punitive risk function. On the contrary, if R(ak ) satisfies: 2 R(a ) k When 0 ≤ ak ≤ a, d da < 0; when a ≤ ak ≤1, 2 d 2 R(ak ) dak2

incentive-punitive risk function. It means that when the risk variable ak approaches boundary value (0 or 1), the risk function value changes quickly and the discrimination degree between every two IVIFSs is large. When the risk variable approaches the middle 0.5, the risk function value changes slowly, and the discrimination degree between every two IVIFSs is small. From Fig. 1, the former is suitable for stimulating the separation between high-risk and low-risk from middle part, while the latter mainly separate the high-risk and low-risk in the two endpoints 0 and 1. Based on Equation (11), we introduce a component function (12) of the incentive-punitive risk function R∗ (A(x)) as follows. R(ak ) = β3 ak3 + β2 ak2 + β1 ak + β0

(12)

k) According to Definition 8, dR(a dak ≥ 0, and then we obtain: dR(ak ) = 3β3 ak2 + 2β2 ak + β1 ≥ 0 (13) dak

Assume that f (ak ) satisfies: R(0) = 0, R(0.5) = 0.5, R(1) = 1. Hence we have:

k

> 0; then R∗ (A(x)) is an extreme separation

incentive-punitive risk function. Figure 1a shows an example of intermediateseparation incentive-punitive risk function. For this function, when the risk variable ak approaches boundary value (0 or 1), the risk function value changes slowly, and the discrimination degree between every two IVIFSs is small. When the risk variable approaches the middle 0.5, the risk function value changes quickly and the discrimination degree between every two IVIFSs is large. On the contrary, Fig. 1b illustrates an example of extreme-separation

R(ak ) = (2β − 2)ak3 + (3 − 3β)ak2 + βak

(14)

Where ⎧ ⎧ R(0) = 0, β0 = 0, ⎪ ⎪ ⎨ ⎨ R(0.5) = 0.5, ⇒ β3 + 2β2 + 4β1 = 4, ⎪ ⎪ ⎩ R(1) = 1, ⎩ β3 + β2 + β1 = 1, ⎧ ⎪ ⎨

β0 = 0, β = 2 3 − 3β1 , ⇒ ⎪ ⎩ β = 2β − 2, 3 1

⎧ β = 0, β1 = β, ⎪ ⎨ 0 β2 = 3 − 3β, ⇒ Letβ1 = β ⎪ ⎩ β = 2β − 2, 3

⇒ R(ak ) = (2β − 2)ak3 + (3 − 3β)ak2 + βak .

Fig. 1. Classification of incentive-punitive risk function. (a) Intermediate separation function. (b) Extreme separation function.

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

Lemma 1. Necessary Condition. From definition 8 and formula (13), a necessary condition of R(ak ) is: for each ak ∈ [0, 1], we have dR(ak ) = (6β − 6)ak2 + (6 − 6β)ak + β ≥ 0 (15) dak From equation (14), we have d 2 R(ak ) = 12(β − 1)ak + 6(1 − β) dak2 = 6(2ak − 1)(β − 1)

(16)

Thus, we draw a conclusion under the precondition of Lemma 1: 2 R(a ) k When β < 1, if 0 ≤ ak < 0.5 then d da > 0, 2 and if 0.5 < ak ≤ 1 then

k

d 2 R(ak ) dak2

< 0. It denotes an

d 2 R(ak ) dak2

> 0. It denotes an

intermediate separation risk function, as is shown in Fig. 1a. 2 R(a ) k When β > 1, if 0 ≤ ak < 0.5 then d da < 0, 2 and if 0.5 < ak ≤ 1 then

k

extreme separation risk function, as is shown in Fig. 1b. Therefore, we know that if the components function of R(ak ) satisfies Lemma 1: (6β − 6)ak2 + (6 − 6β)ak + β ≥ 0, then R∗ (A(x)) is an incentive-punitive risk function. Lemma 2. Sufficient Condition. When 0 ≤ β < 1, R∗ (A(x)) is an intermediate separation incentivepunitive risk function; when 1 < β ≤ 3, R∗ (A(x)) is an extreme separation incentive-punitive risk function. when β = 1, R∗ (A(x)) is an equilibrium risk-function. Obviously, when β = 1, R(ak ) = ak , R∗ (A(x)) is a linear function of the equilibrium change. The other two cases have been analyzed from Lemma 1 above. From Fig. 1, the following properties are obvious. Compared with traditional linear risk function, the risk function value is significantly changed in the middle of the attribute value for intermediate separation incentive-punitive risk function (in Fig. 1a), and the deviation degree of risk will be larger. For conditional attributes, the difference of risk values based on most of good performance projects and poor performance projects are widen and significantly distinguished, hence the variance, standard deviation, and range of intermediate separation risk function will be large than that of linear risk function. For the extreme separation incentive-punitive risk function (in Fig. 1b), its properties are different from

3755

the properties of intermediate separation risk function and linear risk function. According to Fig. 1b, only the extreme value will be increased or decreased sharply, which means that only the difference between very good performance projects and the very terrible performance projects are widen and significantly distinguished by the risk values, while most risk values of all projects may be changed slowly. Thus, the variance, standard deviation, and range of intermediate separation risk function will be smaller than that of linear risk function and intermediate separation incentive-punitive risk function. 2 R(a ) 2 ∗ k = 0 and ∂ R∂a2(ak ) = 0, If β = 1, we have ∂ ∂a 2 k

k

which means a liner risk-function for risk attribute ak and we call it an equilibrium risk-function. Next we introduce some component functions meeting the needs of Lemma 2 and construct their incentive-punitive risk functions R*β (A(x)), we adopt β = 0, 0.5, 1, 2, 3: R*β (A(x)) =



 − ω(x) Rβ (1 − tA (x))

x∈X + +Rβ (1 − tA (x)) + Rβ (fA− (x)) + Rβ (fA+ (x))   − 1 + fA− (x) − tA (x) +Rβ 2   + + 1 + fA (x) − tA (x) +Rβ (17) 2

Intermediate separation incentive-punitive risk function: R0 (ak ) = −2ak3 + 3ak2 , (β = 0)

(18)

R0.5 (ak ) = −ak3 + 1.5ak2 + 0.5ak , (β = 0.5) (19) Extreme separation incentive-punitive risk function: R2 (ak ) = 2ak3 − 3ak2 + 2ak , (β = 2)

(20)

R3 (ak ) = 4ak3 − 6ak2 + 3ak , (β = 3)

(21)

Equilibrium risk-function: R1 (ak ) = ak , (β = 1)

(22)

Obviously, for two IVIFSs A & B, if A ⊆ B, then R*β (A(x)) ≤ R*β (B(x)).

3756

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

< x3 , [0.3, 0.4], [0.1, 0.2], [0.25, 0.25] >},

4. Application example Example 1. A project manager looks forward to evaluating the project development risk of outsourced software. If Ai (i = 1, 2, 3, 4, 5) is software project. Consider three attributes: contractor risks (x1 ), customer risks (x2 ), and project complexity risks (x3 ). And w = (0.5, 0.3, 0.2)T denotes the weight matrix of three attributes xj (j = 1, 2, 3). Ai (i = 1, 2, 3, 4, 5) is given by the following IVIFS modes: A1 = {< x1 , [0.6, 0.7], [0, 0.1] >, < x2 , [0.1, 0.2], [0.3, 0.4] >, < x3 , [0.5, 0.6], [0.2, 0.3] >}, A2 = {< x1 , [0.4, 0.5], [0.1, 0.2] >, < x2 , [0.3, 0.4], [0.1, 0.2] >, < x3 , [0.7, 0.8], [0, 0.1] >}, A3 = {< x1 , [0.5, 0.6], [0.1, 0.2] >, < x2 , [0.4, 0.5], [0.3, 0.4] >, < x3 , [0.8, 0.9], [0, 0] >}, A4 = {< x1 , [0.7, 0.8], [0, 0.1] >, < x2 , [0.2, 0.3], [0.4, 0.5] >, < x3 , [0.6, 0.7], [0.1, 0.2] >}, A5 = {< x1 , [0.6, 0.7], [0, 0] >, < x2 , [0.7, 0.8], [0.1, 0.2] >, < x3 , [0, 0.1], [0.5, 0.6] >}. According to formula (9), we get A1 = {< x1 , [0.3, 0.4], [0, 0.1], [0.2, 0.2] >,

A5 = {< x1 , [0.3, 0.4], [0, 0], [0.15, 0.2] >, < x2 , [0.2, 0.3], [0.1, 0.2], [0.2, 0.2] >, < x3 , [0.9, 1.0], [0.5, 0.6], [0.75, 0.75] >}. From formulas (17, 22), we obtain the results below: R*1 (A1 (x))  − + = ω(x){R1 (1 − tA (x)) + R1 (1 − tA (x)) x∈X

+R1 (fA− (x)) + R1 (fA+ (x))   − 1 + fA− (x) − tA (x) +R1 2   + + 1 + fA (x) − tA (x) + R1 2  − + = ω(x){(1 − tA (x)) + (1 − tA (x)) x∈X

+ (fA− (x)) + (fA+ (x)) +  +

+ 1 + fA+ (x) − tA (x) 2



− 1 + fA− (x) − tA (x) 2 



= [0.5 × (0.4 + 0.3 + 0 + 0.1 + 0.2 + 0.2) + 0.3 × (0.9 + 0.8 + 0.3 + 0.4 + 0.6 + 0.6) + 0.2×(0.5 + 0.4 + 0.2 + 0.3 + 0.35 + 0.35)] = 2.1. From formulas (17, 18), we get the result as follows. Similarly, we get the following Table 2.

< x2 , [0.8, 0.9], [0.3, 0.4], [0.6, 0.6] >, < x3 , [0.4, 0.5], [0.2, 0.3], [0.35, 0.35] >},

5. Experimental result analysis and discussion

A2 = {< x1 , [0.5, 0.6], [0.1, 0.2], [0.35, 0.35] >, < x2 , [0.6, 0.7], [0.1, 0.2], [0.4, 0.4] >, < x3 , [0.2, 0.3], [0, 0.1], [0.15, 0.15] >}, A3 = {< x1 , [0.4, 0.5], [0.1, 0.2], [0.3, 0.3] >, < x2 , [0.5, 0.6], [0.3, 0.4], [0.45, 0.45] >, < x3 , [0.1, 0.2], [0, 0], [0.05, 0.1] >}, A4 = {< x1 , [0.2, 0.3], [0, 0.1], [0.15, 0.15] >, < x2 , [0.7, 0.8], [0.4, 0.5], [0.6, 0.6] >,

(1) Experimental result analysis. In Table 2, RM represents the weighted membership and RCT means a superiority sorting function with the difference of Membership minus nonmembership. Therefore, for RM &RCT , the larger the value of them, the smaller the software project risk and the higher the development success rate. On the contrary, for each i > 0, R*β (Ai (x)) is risk function, which means that it possess exactly the opposite properties with RM &RCT : the smaller their values,

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

3757

Table 2 Results based on risk functions and conventional order operators of IVIFS Operators R1 ∗ R0 ∗ R0.5 ∗ R2 ∗ R3 ∗ RM RNM RCT RHC

A1

A2

A3

A4

A5

2.1 1.8687 1.9844 2.3313 2.5626 0.480 0.180 0.300 0.660

1.95 1.6961 1.8230 2.2040 2.4579 0.480 0.130 0.350 0.610

1.8 1.5114 1.6557 2.0886 2.3772 0.580 0.180 0.400 0.760

1.83 1.5857 1.7078 2.0744 2.3187 0.580 0.190 0.390 0.770

1.785 1.5259 1.6554 2.0441 2.3033 0.560 0.155 0.405 0.715

the smaller the software project risk and the higher the development success rate. RNM is composed by weighted non-membership degree, and it means that RNM is also a kind of risk function as R*β (Ai (x)). According to Table 2, we obtain: R*0 (A1 (x)) =



+ R0 (fA− (x)) + R0 (fA+ (x)) + R0 =

A5 A3 A5 A5 A5 A3 A2 A5 A4

A3 A5 A3 A4 A4 = A4 = A5 A3 A3

A4 A4 A4 A3 A3 A5 A3 A4 A5

A2 A2 A2 A2 A2 A2 A1 A2 A1

A1 A1 A1 A1 A1 = A1 A4 A1 A2

we have A3 A1 , A3 A4 . Hence, the optimal decision-making is from set A2 , A3 , A5 . From Table 2, RCT , RNM , R1 ∗ , R0 ∗ and R0.5 ∗ satisfy A2 A1 , A3 A1 , A5 A1 , A3 A4 . While RM ,

− + ω(x) R0 (1 − tA (x)) + R0 (1 − tA (x))

x∈X



Decision-making





− 1 + fA− (x) − tA (x) 2



 + R0

+ 1 + fA+ (x) − tA (x) 2



− − + + ω(x) − 2(1 − tA (x))3 + 3(1 − tA (x))2 − 2(1 − tA (x))3 + 3(1 − tA (x))2

x∈X

− 2(fA− (x))3 + 3(fA− (x))2 − 2(fA+ (x))3   3 2 1 + fA− (x) − μ− 1 + fA− (x) − μ− + 2 A (x) A (x) + 3(fA (x)) − 2 +3 2 2      3 2 + + (x) 1 + fA+ (x) − tA 1 + fA+ (x) − tA (x) −2 +3 2 2 = [0.5 × (−2 × 0.43 + 3 × 0.42 − 2 × 0.33 + 3 × 0.32 − 2 × 03 + 3 × 02 − 2 × 0.13 + 3 × 0.12 − 2 × 0.23 + 3 × 0.22 − 2 × 0.23 + 3 × 0.22 ) + 0.3 × (−2 × 0.93 + 3 × 0.92 − 2 × 0.83 + 3 × 0.82 − 2 × 0.33 + 3 × 0.32 − 2 × 0.42 + 3 × 0.42 − 2 × 0.63 + 3 × 0.62 − 2 × 0.63 + 3 × 0.62 ) + 0.2 × (−2 × 0.53 + 3 × 0.52 − 2 × 0.43 + 3 × 0.42 − 2 × 0.23 + 3 × 0.22 − 2 × 0.33 + 3 × 0.32 − 2 × 0.353 + 3 × 0.352 − 2 × 0.353 + 3 × 0.352 )] = 1.8687. RM (A3 ) = RM (A4 ) > RM (A5 ) > RM (A1 ) = RM (A2 ), RNM (A2 ) < RNM (A5 ) < RNM (A1 ) = RNM (A3 ) < RNM (A4 ). Thus we get A2 A1 , A5 A1 , A3 A1 , A3 A4 . For example, from the membership degree RM (A5 ) > RM (A1 ) = RM (A2 ) and the nonmembership degree RNM (A2 ) < RNM (A5 ) < RNM (A1 ), we obtain A5 A1 , A2 A1 . Similarly,

RHC don’t satisfy A3 A4 and A2 A1 , R2 ∗ and R3 ∗ don’t satisfy A3 A4 . (2) Discussion. From Example 1, for contractor risks (x1 ) and customer risks (x2 ), A5 is outstanding, while it performs the worst in project complexity risks (x3 ).

3758

Z. Zhanga et al. / Incentive-punitive risk function with interval valued Table 3 Risk level and deviation of several risk functions with IVIFS information Prediction Accuracy

S

M

F

Variance

Standard Deviation

Range

R1 ∗ R0 ∗ R0.5 ∗ R2 ∗ R3 ∗

0 0 0 0 0

3 3 3 3 3

6 6 6 6 6

0.0176 0.02198 0.01968 0.01412 0.01155

0.1327 0.1483 0.1403 0.1188 0.1075

0.315 0.3573 0.3289 0.2872 0.2594

A3 and A4 show their advantages in x1 and x3 , but A4 is terrible in x2 . In general, A3 performs well in all three respects, and the overall performance of A2 , A3 . and A4 are homogeneous in all attributes. However, A1 and A5 show extreme performance on their attributes. Obviously, A3 and A5 are closer to successful projects while A1 failure project. Considering R*β (Ai (x)), Let: S = {< x1 , [1, 1], [0, 0] >, < x2 , [1, 1], [0, 0] >, < x3 , [1, 1], [0, 0] >} , M = {< x1 , [0.5, 0.5], [0.5, 0.5] >, < x2 , [0.5, 0.5], [0.5, 0.5] >, < x3 , [0.5, 0.5], [0.5, 0.5] >} , F = {< x1 , [0, 0], [1, 1] >, < x2 , [0, 0], [1, 1] >, < x3 , [0, 0], [1, 1] >}. Where T means all the membership degree values of attributes x1 , x2 , x3 are 1 and all the nonmembership degree values of attributes x1 , x2 , x3 are 0. Thus the risk of project T is 0 and T can be defined as a successful project. On the contrary, the membership degree values of attributes x1 , x2 , x3 for F are 0 and its non-membership degree values 1. Therefore, F is regarded as a failure project and its risk will be the maximum 6. M represents middle level of risk. By calculating R*β (S), R*β (F ), R*β (M), we obtain Table 3. According to Ai (x), most of the attribute values Ai (xk )  = < x, NAmax (xk ), NAi (xk ), NAmid (xk ) > | i

i

{x ∈ X, i ∈ {1, 2, 3, 4, 5}, k ∈ {1, 2, 3} applied to R*β (Ai (xk )) be less than 0.5, therefore the values of the extreme separation risk functions will be larger than that of the equilibrium risk function, and the values calculated by equilibrium risk function are larger than that by the extreme separation risk functions. For example, when 1 < β ≤ 3, all the risk values will be increased, and the higher the degree of

Table 4 Average accuracy of IVIFS Risk Operator R1 ∗ R0 ∗ R0.5 ∗ R2 ∗ R3 ∗

Prediction Accuracy

Ranking Function

Prediction Accuracy

0.831 0.827 0.819 0.823 0.807

RM RNM RCT RHC

0.804 0.796 0.831 0.723

non-membership is, the closer to failure the project is and the faster growth the project risk will be. Similarly, When 0 ≤ β < 1, all the risk values will be decreased, and the higher the degree of membership is, indicating that the closer to success the project is and the rapid decline the project risk will be. When β = 1, the risk values is changed linearly. Discussion on the risk value deviations of all the risk functions in Table 3. From Table 3, we know that the deviation of the extreme separation risk functions will be less than that of the equilibrium risk function, and the values calculated by the equilibrium risk function are smaller than that by the extreme separation risk functions, which is the same as the properties deduced in theory. We draw a conclusion: For R∗β (Ai (x)), β ∈ [0, 3], if 0 ≤ βj < 1 < βl ≤ 3, R∗βj (Ai (x)) < R∗1 (Ai (x)) < R∗βl (Ai (x)), the deviations of R∗βl (Ai (x)) are less than that of R∗1 (Ai (x)), and the deviations of R∗1 (Ai (x)) are less than that of R∗βj (Ai (x)). 6. Outsourced software risk assessment In our survey, we collect 260 valid and complete individuals, 191 of them are success and 69 failure. The average accuracy of 10 tests is shown in Table 4. The algorithm steps are shown below: Step 1. Sampling. In the experiment, we sample 200 individuals to be training sample and the rest testing sample. Step 2. Fuzzification and weights determination. The data set consists of 14 significant attributes with 5 level scale, we use triangle module to define

Z. Zhanga et al. / Incentive-punitive risk function with interval valued

membership, non-membership, and hesitation interval. For all risk factors, we use the equal weights to construct risk function. Step 3. The threshold value determination. Considering that the success rate of project is 26.5%, 53 individuals with the lowest risk are regarded as success projects in training example. Step 4. Testing. According to the threshold value, calculate the risk of testing individuals and classify them. In Table 4, all the prediction accuracy of risk operators maintaining order are better than that with no order. For example, all R∗ are better than RHC .

Soft Science Project (No. 2015A070704051) & Natural Science Projects (No. 2014A030313575, 2016A030313688) of Guangdong Province, Science & Technology Fund of Guangdong Education Department (No. 2013KJCX0072), Philosophy & Social Science Project of Guangzhou (No. 14G41), Special Innovative Project (No. 15T21) & Key Team (No. TD1605) & Major Education Foundation (No. GYJYZDA14002) & Higher Education Foundation (No. 2016GDJYYJZD004) of Guangdong University of Foreign Studies, Climbing Plan Foundations of Guangdong (No. pdjh2015a0180, pdjh2016a0166).

References

7. Conclusions

[1]

Based on a decade research on risk index system of outsourced software project, 14 important attributes are extracted as the basis for modeling the risk operator. According to their mathematical properties, we propose a general risk function derived from IVIFS and software engineering, and divide them into 4 categories: incentive function, punitive function, incentive-punitive function and equilibrium function. This paper focuses on two kinds of incentive-punitive risk functions, and applies them to risk assessment of outsourced software project. In theory, we prove that if the risk function is a monotonically increasing function, then it will satisfy all the conditions as a risk function. By comparing the presented risk function with some conventional operators including RM , RNM , RCT and RHC , we conclude that it is easy to construct a reasonable and appropriate risk assessment model according to new risk functions by a combination of vectors maintaining order relations. And the experimental results illustrate the effectiveness of the presented risk function assessment model. However, Since the new risk function is suitable for special cases, the overall recognition effect is slightly inferior to the equilibrium risk function for the specific condition is not satisfied. The determination of weights is also an interesting topic. Moreover, the model can be extended to hesitant fuzzy set as [7].

[2]

Acknowledgments This paper is funded by the National Natural Science Foundation of China (No. 71271061), Philosophy & Social Science Project (No. GD12XGL14) &

3759

[3] [4]

[5]

[6] [7]

[8]

[9] [10] [11] [12]

[13]

[14]

[15]

[16]

B.W. Boehm, Software engineering economics (1st Ed.), New Jersey: Prentice-hall (1981). B.W. Boehm, Software risk management: Principles and practices, IEEE Software 8(1) (1991), 32–41. C. Jones, Assessment and control of software risks, New Jersey: Prentice Hall (1994). C.P. Wei, P. Wang and Y.Z. Zhang, Entropy, similarity measure of interval-valued intuitionistic fuzzy sets and their applications, Information Sciences 181 (2011), 4273–4286. D.H. Hong and C.H. Choi, Multicriteria fuzzy decisionmaking problems based on vague set theory, Fuzzy Sets and Systems 114 (2000), 103–113. D.W. Karolak, Software engineering risk management, Los Alamitos: IEEE Computer Society Press (1996). G.H. Qu, H.P. Zhang, W.H. Qu and Z.H. Zhang, Induced generalized dual hesitant fuzzy Shapley hybrid operators and their application in multi-attributes decision making, Journal of Intelligent & Fuzzy Systems 31 (2016), 633–650. J.J. Jiang and G. Klein, An exploration of the relationship between software development process maturity and project performance, Information & Management 41(3) (2004), 279–288. K. Atanassov and G. Gargov, Interval valued intuitionistic fuzzy sets, Fuzzy Sets and Systems 31(3) (1989), 343–349. K.T. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20(1) (1986), 87–96. L.A. Zadeh, Fuzzy sets, Information and Control 8(3) (1965), 338–353. L. Wallace, M. Keil and A. Rai, Understanding software project risk: A cluster analysis, Information & Management 42(1) (2004), 115–125. L. Wallace and M. Keil, Software project risks and their effect on outcomes, Communications of the ACM 47(4) (2004), 68–73. M.M. Xia and Z.S. Xu, Some new similarity measures for intuitionistic fuzzy values and their application in group decision making, Journal of Systems Science and Systems Engineering 19 (2010), 430–452. R. Schmidt, K. Lyytinen and M. Keil, Identifying software project risks: An international Delphi study, Journal of Management Information Systems 17(4) (2001), 5–36. S.M. Chen and J.M. Tan, Handling multicriteria fuzzy decision-making problems based on vague set theory, Fuzzy sets and Systems 67(1994), 163–172.

3760 [17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

Z. Zhanga et al. / Incentive-punitive risk function with interval valued S. Nidumolu, The effect of coordination and uncertainty on software project performance: Residual performance risk as an intervening variable, Information Systems Research 6(3) (1995), 191–219. W.D. Xia and G. Lee, Complexity of information systems development projects: Conceptualization and measurement development, Journal of Management Information Systems 22(1) (2005), 45–84. Y. Hu, B. Feng, X.Z. Mo, X.Z. Zhang, E.W.T. Nagi, M. Fan and M. Liu, Cost-Sensitive and ensemble-based prediction model for outsourced software project risk prediction, Decision Support Systems 72(2) (2015), 11–23. Y. Hu, J.F. Du, X.Z. Zhang, X.L. Hao, E.W.T. Nagi, M. Fan and M. Liu, An integrative framework for intelligent software project risk planning, Decision Support Systems 55(11) (2013), 927–937. Y. Hu, X.Z. Mo, X.Z. Zhang, Y.R. Zeng, J.F. Du and K. Xie, Intelligent analysis model for outsourced software project risk using constraint-based Bayesian network, Journal of Software 7(2) (2012), 440–449. Y. Hu, X.Z. Zhang, E.W.T. Nagi, R.C. Cai and M. Liu, Software project risk analysis using Bayesian networks with causality constraints, Decision Support Systems 56(12) (2013), 439–449. Z.H. Zhang, G.H. Qu, K.X. Xiao, Y. Hu, Z.J. Li, X.X. Chen, J.H. Xu and C. Ma, Some novel dynamic fuzzy sets models applied to the classification of outsourced software project risk, Advances in Intelligent Systems and Computing 443(6) (2016), 273–286. Z.H. Zhang, J.Y. Yang, Y.P. Ye, Y. Hu and Q.S. Zhang, A scoring function of intuitionistic fuzzy sets with double

[25]

[26]

[27]

[28]

[29]

[30]

parameters and its application to multiple attribute decision making. Information-An International Interdisciplinary Journal 15(11) (2012), 4443–4450. Z.H. Zhang, J.Y. Yang, Y.P. Ye, Y. Hu and Q.S. Zhang, Intuitionistic fuzzy sets with double parameters and its application to dynamic multiple attribute decision making, Information-An International Interdisciplinary Journal 15(6) (2012), 2479–2486. Z.H. Zhang, M. Wang, Y. Hu, J.Y. Yang, Y.P. Ye and Y.F. Li, A Dynamic interval-valued intuitionistic fuzzy sets applied to pattern recognition, Mathematical Problems in Engineering 408012(6) (2013), 1–16. Z.H. Zhang, Z.J. Li, X.X. Chen, G.H. Qu, Y. Hu, J.H. Xu and C. Ma, A novel weighted average index method of interval valued intuitionistic fuzzy sets and its application to outsourced software project risk assessment, Advances in Intelligent Systems and Computing 443(6) (2016), 259–271. Z.S. Xu, Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making, Fuzzy Optimization and Decision Making 6 (2007), 109–121. Z.W. Xu, T.M. Khoshgoftaar and E.B. Allen, Application of fuzzy expert systems in assessing operational risk of software, Information and Software Technology 45(7) (2003), 373–388. Z.Z. Ouyang, Z.H. Zhang, J.Z. Chen and Y. Hu, An unsupervised model on outsourcing software projects risks based on T-S fuzzy neural network, Advances in Engineering Research 13(6) (2015), 411–414.

Suggest Documents