Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Heterogeneous cross-project defect prediction with multiple source projects based on transfer learning

  • Cross-project defect prediction (CPDP) aims to predict the defect proneness of target project with the defect data of source project. Existing CPDP methods are based on the assumption that source and target projects should have the same metrics. Heterogeneous cross-project defect prediction (HCPDP) builds a prediction model using heterogeneous source and target projects. Existing HCPDP methods just focus on one source project or multiple source projects with the same metrics. These methods limit the scope of getting the source project. In this paper, we propose Heterogeneous Defect Prediction with Multiple source projects (HDPM) which can use multiple heterogeneous source projects for defect prediction. HDPM based on transfer learning which can learn knowledge from one domain and use it to help with other domain. HDPM constructs a projective matrix between heterogeneous source and target projects to make the distributions of source and target projects similar. We conduct experiments on 14 projects from four public datasets and the results show that HDPM can achieve better performance compared with existing CPDP methods, and outperforms or is comparable to within-project defect prediction method. The use of multiple heterogeneous source projects for defect prediction can effectively extend the data acquisition range of defect prediction and make software defect prediction better applied to software engineering.

    Citation: Xinglong Yin, Lei Liu, Huaxiao Liu, Qi Wu. Heterogeneous cross-project defect prediction with multiple source projects based on transfer learning[J]. Mathematical Biosciences and Engineering, 2020, 17(2): 1020-1040. doi: 10.3934/mbe.2020054

    Related Papers:

    [1] Ridha Dida, Hamid Boulares, Bahaaeldin Abdalla, Manar A. Alqudah, Thabet Abdeljawad . On positive solutions of fractional pantograph equations within function-dependent kernel Caputo derivatives. AIMS Mathematics, 2023, 8(10): 23032-23045. doi: 10.3934/math.20231172
    [2] Hamid Boulares, Manar A. Alqudah, Thabet Abdeljawad . Existence of solutions for a semipositone fractional boundary value pantograph problem. AIMS Mathematics, 2022, 7(10): 19510-19519. doi: 10.3934/math.20221070
    [3] Reny George, Fahad Al-shammari, Mehran Ghaderi, Shahram Rezapour . On the boundedness of the solution set for the ψ-Caputo fractional pantograph equation with a measure of non-compactness via simulation analysis. AIMS Mathematics, 2023, 8(9): 20125-20142. doi: 10.3934/math.20231025
    [4] Saeed M. Ali, Mohammed S. Abdo, Bhausaheb Sontakke, Kamal Shah, Thabet Abdeljawad . New results on a coupled system for second-order pantograph equations with ABC fractional derivatives. AIMS Mathematics, 2022, 7(10): 19520-19538. doi: 10.3934/math.20221071
    [5] Weerawat Sudsutad, Chatthai Thaiprayoon, Aphirak Aphithana, Jutarat Kongson, Weerapan Sae-dan . Qualitative results and numerical approximations of the (k,ψ)-Caputo proportional fractional differential equations and applications to blood alcohol levels model. AIMS Mathematics, 2024, 9(12): 34013-34041. doi: 10.3934/math.20241622
    [6] Choukri Derbazi, Zidane Baitiche, Mohammed S. Abdo, Thabet Abdeljawad . Qualitative analysis of fractional relaxation equation and coupled system with Ψ-Caputo fractional derivative in Banach spaces. AIMS Mathematics, 2021, 6(3): 2486-2509. doi: 10.3934/math.2021151
    [7] Abdelkader Moumen, Ramsha Shafqat, Zakia Hammouch, Azmat Ullah Khan Niazi, Mdi Begum Jeelani . Stability results for fractional integral pantograph differential equations involving two Caputo operators. AIMS Mathematics, 2023, 8(3): 6009-6025. doi: 10.3934/math.2023303
    [8] Iyad Suwan, Mohammed S. Abdo, Thabet Abdeljawad, Mohammed M. Matar, Abdellatif Boutiara, Mohammed A. Almalahi . Existence theorems for Ψ-fractional hybrid systems with periodic boundary conditions. AIMS Mathematics, 2022, 7(1): 171-186. doi: 10.3934/math.2022010
    [9] Mohamed Houas, Kirti Kaushik, Anoop Kumar, Aziz Khan, Thabet Abdeljawad . Existence and stability results of pantograph equation with three sequential fractional derivatives. AIMS Mathematics, 2023, 8(3): 5216-5232. doi: 10.3934/math.2023262
    [10] Karim Guida, Lahcen Ibnelazyz, Khalid Hilal, Said Melliani . Existence and uniqueness results for sequential ψ-Hilfer fractional pantograph differential equations with mixed nonlocal boundary conditions. AIMS Mathematics, 2021, 6(8): 8239-8255. doi: 10.3934/math.2021477
  • Cross-project defect prediction (CPDP) aims to predict the defect proneness of target project with the defect data of source project. Existing CPDP methods are based on the assumption that source and target projects should have the same metrics. Heterogeneous cross-project defect prediction (HCPDP) builds a prediction model using heterogeneous source and target projects. Existing HCPDP methods just focus on one source project or multiple source projects with the same metrics. These methods limit the scope of getting the source project. In this paper, we propose Heterogeneous Defect Prediction with Multiple source projects (HDPM) which can use multiple heterogeneous source projects for defect prediction. HDPM based on transfer learning which can learn knowledge from one domain and use it to help with other domain. HDPM constructs a projective matrix between heterogeneous source and target projects to make the distributions of source and target projects similar. We conduct experiments on 14 projects from four public datasets and the results show that HDPM can achieve better performance compared with existing CPDP methods, and outperforms or is comparable to within-project defect prediction method. The use of multiple heterogeneous source projects for defect prediction can effectively extend the data acquisition range of defect prediction and make software defect prediction better applied to software engineering.


    Recently, fractional calculus methods became of great interest, because it is a powerful tool for calculating the derivation of multiples systems. These methods study real world phenomena in many areas of natural sciences including biomedical, radiography, biology, chemistry, and physics [1,2,3,4,5,6,7]. Abundant publications focus on the Caputo fractional derivative (CFD) and the Caputo-Hadamard derivative. Additionally, other generalization of the previous derivatives, such as Ψ-Caputo, study the existence of solutions to some FDEs (see [8,9,10,11,12,13,14]).

    In general, an m-point fractional boundary problem involves a fractional differential equation with fractional boundary conditions that are specified at m different points on the boundary of a domain. The fractional derivative is defined using the Riemann-Liouville fractional derivative or the Caputo fractional derivative. Solving these types of problems can be challenging due to the non-local nature of fractional derivatives. However, there are various numerical and analytical methods available for solving such problems, including the spectral method, the finite difference method, the finite element method, and the homotopy analysis method. The applications of m-point fractional boundary problems can be found in various fields, including physics, engineering, finance, and biology. These problems are useful in modeling and analyzing phenomena that exhibit non-local behavior or involve memory effects (see [15,16,17,18]).

    Pantograph equations are a set of differential equations that describe the motion of a pantograph, which is a mechanism used for copying and scaling drawings or diagrams. The equations are based on the assumption that the pantograph arms are rigid and do not deform during operation, we can simply say that see [19]. One important application of the pantograph equations is in the field of drafting and technical drawing. Before the advent of computer-aided design (CAD) software, pantographs were commonly used to produce scaled copies of drawings and diagrams. By adjusting the lengths of the arms and the position of the stylus, a pantograph can produce copies that are larger or smaller than the original [20], electrodynamics [21] and electrical pantograph of locomotive [22].

    Many authors studied a huge number of positive solutions for nonlinear fractional BVP using fixed point theorems (FPTs) such as SFPT, Leggett-Williams and Guo-Krasnosel'skii (see [23,24]). Some studies addressed the sign-changing of solution of BVPs [25,26,27,28,29].

    In this work, we use Schauder's fixed point theorem (SFPT) to solve the semipostone multipoint Ψ-Caputo fractional pantograph problem

    Dν;ψrϰ(ς)+F(ς,ϰ(ς),ϰ(r+λς))=0, ς in (r,) (1.1)
    ϰ(r)=ϑ1, ϰ()=m2i=1ζiϰ(ηi)+ϑ2, ϑiR, i{1,2}, (1.2)

    where λ(0,r),Dν;ψr is Ψ-Caputo fractional derivative (Ψ-CFD) of order ν, 1<ν2, ζiR+(1im2) such that 0<Σm2i=1ζi<1, ηi(r,), and F:[r,]×R×RR.

    The most important aspect of this research is to prove the existence of a positive solution of the above m-point FBVP. Note that in [30], the author considered a two-point BVP using Liouville-Caputo derivative.

    The article is organized as follows. In the next section, we provide some basic definitions and arguments pertinent to fractional calculus (FC). Section 3 is devoted to proving the the main result and an illustrative example is given in Section 4.

    In the sequel, Ψ denotes an increasing map Ψ:[r1,r2]R via Ψ(ς)0, ς, and [α] indicates the integer part of the real number α.

    Definition 2.1. [4,5] Suppose the continuous function ϰ:(0,)R. We define (RLFD) the Riemann-Liouville fractional derivative of order α>0,n=[α]+1 by

    RLDα0+ϰ(ς)=1Γ(nα)(ddς)nς0(ςτ)nα1ϰ(τ)dτ,

    where n1<α<n.

    Definition 2.2. [4,5] The Ψ-Riemann-Liouville fractional integral (Ψ-RLFI) of order α>0 of a continuous function ϰ:[r,]R is defined by

    Iα;Ψrϰ(ς)=ςr(Ψ(ς)Ψ(τ))α1Γ(α)Ψ(τ)ϰ(τ)dτ.

    Definition 2.3. [4,5] The CFD of order α>0 of a function ϰ:[0,+)R is defined by

    Dαϰ(ς)=1Γ(nα)ς0(ςτ)nα1ϰ(n)(τ)dτ, α(n1,n),nN.

    Definition 2.4. [4,5] We define the Ψ-CFD of order α>0 of a continuous function ϰ:[r,]R by

    Dα;Ψrϰ(ς)=ςr(Ψ(ς)Ψ(τ))nα1Γ(nα)Ψ(τ)nΨϰ(τ)dτ, ς>r, α(n1,n),

    where nΨ=(1Ψ(ς)ddς)n,nN.

    Lemma 2.1. [4,5] Suppose q,>0, and ϰinC([r,],R). Then ς[r,] and by assuming Fr(ς)=Ψ(ς)Ψ(r), we have

    1) Iq;ΨrI;Ψrϰ(ς)=Iq+;Ψrϰ(ς),

    2) Dq;ΨrIq;Ψrϰ(ς)=ϰ(ς),

    3) Iq;Ψr(Fr(ς))1=Γ()Γ(+q)(Fr(ς))+q1,

    4) Dq;Ψr(Fr(ς))1=Γ()Γ(q)(Fr(ς))q1,

    5) Dq;Ψr(Fr(ς))k=0, k=0,,n1, nN, qin(n1,n].

    Lemma 2.2. [4,5] Let n1<α1n,α2>0, r>0, ϰL(r,), Dα1;ΨrϰL(r,). Then the differential equation

    Dα1;Ψrϰ=0

    has the unique solution

    ϰ(ς)=W0+W1(Ψ(ς)Ψ(r))+W2(Ψ(ς)Ψ(r))2++Wn1(Ψ(ς)Ψ(r))n1,

    and

    Iα1;ΨrDα1;Ψrϰ(ς)=ϰ(ς)+W0+W1(Ψ(ς)Ψ(r))+W2(Ψ(ς)Ψ(r))2++Wn1(Ψ(ς)Ψ(r))n1,

    with WR, {0,1,,n1}.

    Furthermore,

    Dα1;ΨrIα1;Ψrϰ(ς)=ϰ(ς),

    and

    Iα1;ΨrIα2;Ψrϰ(ς)=Iα2;ΨrIα1;Ψrϰ(ς)=Iα1+α2;Ψrϰ(ς).

    Here we will deal with the FDE solution of (1.1) and (1.2), by considering the solution of

    Dν;ψrϰ(ς)=h(ς), (2.1)

    bounded by the condition (1.2). We set

    Δ:=Ψ()Ψ(r)Σm2i=1ζi(Ψ(ηi)Ψ(r)).

    Lemma 2.3. Let ν(1,2] and ς[r,]. Then, the FBVP (2.1) and (1.2) have a solution ϰ of the form

    ϰ(ς)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+rϖ(ς,τ)h(τ)Ψ(τ)dτ,

    where

    ϖ(ς,τ)=1Γ(ν){[(Ψ()Ψ(r))ν1Σm2j=iζj(Ψ(ηj)Ψ(τ))ν1]Ψ(ς)Ψ(r)Δ(Ψ(ς)Ψ(τ))ν1,τς,ηi1<τηi,[(Ψ()Ψ(τ))ν1Σm2j=iζj(Ψ(ηj)Ψ(τ))ν1]Ψ()Ψ(r)Δ,ςτ,ηi1<τηi, (2.2)

    i=1,2,...,m2.

    Proof. According to the Lemma 2.2 the solution of Dν;ψrϰ(ς)=h(ς) is given by

    ϰ(ς)=1Γ(ν)ςr(Ψ(ς)Ψ(τ))ν1h(τ)Ψ(τ)dτ+c0+c1(Ψ(ς)Ψ(r)), (2.3)

    where c0,c1R. Since ϰ(r)=ϑ1 and ϰ()=m2i=1ζiϰ(ηi)+ϑ2, we get c0=ϑ1 and

    c1=1Δ(1Γ(ν)m2i=1ζiηjr(Ψ(ηi)Ψ(τ))ν1h(τ)Ψ(τ)dτ+1Γ(ν)r(Ψ()Ψ(τ))ν1h(τ)Ψ(τ)dτ+ϑ1[m2i=1ζi1]+ϑ2).

    By substituting c0,c1 into Eq (2.3) we find,

    ϰ(ς)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+(Ψ(ς)Ψ(r))Δϑ21Γ(ν)(ςr(Ψ(ς)Ψ(τ))ν1h(τ)Ψ(τ)dτ+(Ψ(ς)Ψ(r))Δm2i=1ζiηjr(Ψ(ηi)Ψ(τ))ν1h(τ)Ψ(τ)dτΨ(ς)Ψ(r)Δr(Ψ()Ψ(τ))ν1h(τ)Ψ(τ)dτ)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+(Ψ(ς)Ψ(r))Δϑ2+rϖ(ς,τ)h(τ)Ψ(τ)dτ,

    where ϖ(ς,τ) is given by (2.2). Hence the required result.

    Lemma 2.4. If 0<m2i=1ζi<1, then

    i) Δ>0,

    ii) (Ψ()Ψ(τ))ν1m2j=iζj(Ψ(ηj)Ψ(τ))ν1>0.

    Proof. i) Since ηi<, we have

    ζi(Ψ(ηi)Ψ(r))<ζi(Ψ()Ψ(r)),
    m2i=1ζi(Ψ(ηi)Ψ(r))>m2i=1ζi(Ψ()Ψ(r)),
    Ψ()Ψ(r)m2i=1ζi(Ψ(ηi)Ψ(r))>Ψ()Ψ(r)m2i=1ζi(Ψ()Ψ(r))=(Ψ()Ψ(r))[1m2i=1ζi].

    If 1Σm2i=1ζi>0, then (Ψ()Ψ(r))Σm2i=1ζi(Ψ(ηi)Ψ(r))>0. So we have Δ>0.

    ii) Since 0<ν11, we have (Ψ(ηi)Ψ(τ))ν1<(Ψ()Ψ(τ))ν1. Then we obtain

    m2j=iζj(Ψ(ηj)Ψ(τ))ν1<m2j=iζj(Ψ()Ψ(τ))ν1(Ψ()Ψ(τ))ν1m2i=1ζi<(Ψ()Ψ(τ))ν1,

    and so

    (Ψ()Ψ(τ))ν1m2j=iζj(Ψ(ηj)Ψ(τ))ν1>0.

    Remark 2.1. Note that rϖ(ς,τ)Ψ(τ)dτ is bounded ς[r,]. Indeed

    r|ϖ(ς,τ)|Ψ(τ)dτ1Γ(ν)ςr(Ψ(ς)Ψ(τ))ν1Ψ(τ)dτ+Ψ(ς)Ψ(r)Γ(ν)Δm2i=1ζiηir(Ψ(ηj)Ψ(τ))ν1Ψ(τ)dτ+Ψ(ς)Ψ(r)ΔΓ(ν)r(Ψ()Ψ(τ))ν1Ψ(τ)dτ=(Ψ(ς)Ψ(r))νΓ(ν+1)+Ψ(ς)Ψ(r)ΔΓ(ν+1)m2i=1ζi(Ψ(ηi)Ψ(r))ν+Ψ(ς)Ψ(r)ΔΓ(ν+1)(Ψ()Ψ(r))ν(Ψ()Ψ(r))νΓ(ν+1)+Ψ()Ψ(r)ΔΓ(ν+1)m2i=1ζi(Ψ(ηi)Ψ(r))ν+(Ψ()Ψ(r))ν+1ΔΓ(ν+1)=M. (2.4)

    Remark 2.2. Suppose Υ(ς)L1[r,], and w(ς) verify

    {Dν;ψrw(ς)+Υ(ς)=0,w(r)=0, w()=Σm2i=1ζiw(ηi), (2.5)

    then w(ς)=rϖ(ς,τ)Υ(τ)Ψ(τ)dτ.

    Next we recall the Schauder fixed point theorem.

    Theorem 2.1. [23] [SFPT] Consider the Banach space Ω. Assume bounded, convex, closed subset in Ω. If ϝ: is compact, then it has a fixed point in .

    We start this section by listing two conditions which will be used in the sequel.

    (Σ1) There exists a nonnegative function ΥL1[r,] such that rΥ(ς)dς>0 and F(ς,ϰ,v)Υ(ς) for all (ς,ϰ,v)[r,]×R×R.

    (Σ2) G(ς,ϰ,v)0, for (ς,ϰ,v)[r,]×R×R.

    Let =C([r,],R) the Banach space of CFs (continuous functions) with the following norm

    ϰ=sup{|ϰ(ς)|:ς[r,]}.

    First of all, it seems that the FDE below is valid

    Dν;ψrϰ(ς)+G(ς,ϰ(ς),ϰ(r+λς))=0, ς[r,]. (3.1)

    Here the existence of solution satisfying the condition (1.2), such that G:[r,]×R×RR

    G(ς,z1,z2)={F(ς,z1,z2)+Υ(ς), z1,z20,F(ς,0,0)+Υ(ς), z10 or z20, (3.2)

    and ϰ(ς)=max{(ϰw)(ς),0}, hence the problem (2.5) has w as unique solution. The mapping Q: accompanied with the (3.1) and (1.2) defined as

    (Qϰ)(ς)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+rϖ(ς,τ)G(ς,ϰ(τ),ϰ(r+λτ))Ψ(τ)dτ, (3.3)

    where the relation (2.2) define ϖ(ς,τ). The existence of solution of the problems (3.1) and (1.2) give the existence of a fixed point for Q.

    Theorem 3.1. Suppose the conditions (Σ1) and (Σ2) hold. If there exists ρ>0 such that

    [1+Σm2i=1ζi1Δ(Ψ()Ψ(r))]ϑ1+Ψ()Ψ(r)Δϑ2+LMρ,

    where Lmax{|G(ς,ϰ,v)|:ς[r,], |ϰ|,|v|ρ} and M is defined in (2.4), then, the problems (3.1) and (3.2) have a solution ϰ(ς).

    Proof. Since P:={ϰ:ϰρ} is a convex, closed and bounded subset of B described in the Eq (3.3), the SFPT is applicable to P. Define Q:P by (3.3). Clearly Q is continuous mapping. We claim that range of Q is subset of P. Suppose ϰP and let ϰ(ς)ϰ(ς)ρ, ς[r,]. So

    |Qϰ(ς)|=|[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+rϖ(ς,τ)G(τ,ϰ(τ),ϰ(r+λτ))Ψ(τ)dτ|[1+Σm2i=1ζi1Δ(Ψ()Ψ(r))]ϑ1+Ψ()Ψ(r)Δϑ2+LMρ,

    for all ς[r,]. This indicates that Qϰρ, which proves our claim. Thus, by using the Arzela-Ascoli theorem, Q: is compact. As a result of SFPT, Q has a fixed point ϰ in P. Hence, the problems (3.1) and (1.2) has ϰ as solution.

    Lemma 3.1. ϰ(ς) is a solution of the FBVP (1.1), (1.2) and ϰ(ς)>w(ς) for every ς[r,] iff the positive solution of FBVP (3.1) and (1.2) is ϰ=ϰ+w.

    Proof. Let ϰ(ς) be a solution of FBVP (3.1) and (1.2). Then

    ϰ(ς)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+(Ψ(ς)Ψ(r))Δϑ2+1Γ(ν)rϖ(ς,τ)G(τ,ϰ(τ),ϰ(r+λτ))Ψ(τ)dτ=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+1Γ(ν)rϖ(ς,τ)(F(τ,ϰ(τ),ϰ(r+λτ))+p(τ))Ψ(τ)dτ=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+1Γ(ν)rϖ(ς,τ)F(τ,(ϰw)(τ),(ϰw)(r+λτ))Ψ(τ)dτ+1Γ(ν)rϖ(ς,τ)p(τ)Ψ(τ)dτ=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+1Γ(ν)rϖ(ς,τ)G(τ,(ϰw)(τ),(ϰw)(r+λτ))Ψ(τ)dτ+w(ς).

    So,

    ϰ(ς)w(ς)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+1Γ(ν)rϖ(ς,τ)F(τ,(ϰw)(τ),(ϰw)(r+λτ))Ψ(τ)dτ.

    Then we get the existence of the solution with the condition

    ϰ(ς)=[1+Σm2i=1ζi1Δ(Ψ(ς)Ψ(r))]ϑ1+Ψ(ς)Ψ(r)Δϑ2+1Γ(ν)rϖ(ς,τ)F(τ,ϰ(τ),ϰ(r+λτ))Ψ(τ)dτ.

    For the converse, if ϰ is a solution of the FBVP (1.1) and (1.2), we get

    Dν;ψr(ϰ(ς)+w(ς))=Dν;ψrϰ(ς)+Dν;ψrw(ς)=F(ς,ϰ(ς),ϰ(r+λς))p(ς)=[F(ς,ϰ(ς),ϰ(r+λς))+p(ς)]=G(ς,ϰ(ς),ϰ(r+λς)),

    which leads to

    Dν;ψrϰ(ς)=G(ς,ϰ(ς),ϰ(r+λς)).

    We easily see that

    ϰ(r)=ϰ(r)w(r)=ϰ(r)0=ϑ1,

    i.e., ϰ(r)=ϑ1 and

    ϰ()=m2i=1ζiϰ(ηi)+ϑ2,
    ϰ()w()=m2i=1ζiϰ(ηi)m2i=1ζjw(ηi)+ϑ2=m2i=1ζi(ϰ(ηi)w(ηi))+ϑ2.

    So,

    ϰ()=m2i=1ζiϰ(ηi)+ϑ2.

    Thus ϰ(ς) is solution of the problem FBVP (3.1) and (3.2).

    We propose the given FBVP as follows

    D75ϰ(ς)+F(ς,ϰ(ς),ϰ(1+0.5ς))=0, ς(1,e), (4.1)
    ϰ(1)=1, ϰ(e)=17ϰ(52)+15ϰ(74)+19ϰ(115)1. (4.2)

    Let Ψ(ς)=logς, where F(ς,ϰ(ς),ϰ(1+12ς))=ς1+ςarctan(ϰ(ς)+ϰ(1+12ς)).

    Taking Υ(ς)=ς we get e1ςdς=e212>0, then the hypotheses (Σ1) and (Σ2) hold. Evaluate Δ0.366, M3.25 we also get |G(ς,ϰ,v)|<π+e=L such that |ϰ|ρ, ρ=17, we could just confirm that

    [1+Σm2i=1ζi1Δ(Ψ()Ψ(r))]ϑ1+Ψ()Ψ(r)Δϑ2+LM16.3517. (4.3)

    By applying the Theorem 3.1 there exit a solution ϰ(ς) of the problem (4.1) and (4.2).

    In this paper, we have provided the proof of BVP solutions to a nonlinear Ψ-Caputo fractional pantograph problem or for a semi-positone multi-point of (1.1) and(1.2). What's new here is that even using the generalized Ψ-Caputo fractional derivative, we were able to explicitly prove that there is one solution to this problem, and that in our findings, we utilize the SFPT. The results obtained in our work are significantly generalized and the exclusive result concern the semi-positone multi-point Ψ-Caputo fractional differential pantograph problem (1.1) and (1.2).

    The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Small Groups (RGP.1/350/43).

    The authors declare no conflict of interest.



    [1] J. Nam, S. J. Pan and S. Kim, Transfer defect learning, 2013 35th International Conference on Software Engineering (ICSE), 2013, 382-391. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/6606584.
    [2] X. Y. Jing, S. Ying, Z. W. Zhang, et al., Dictionary learning based software defect prediction, Proceedings of the 36th International Conference on Software Engineering, ACM, 2014, 414-423. Available from: https://dl_acm.xilesou.top/citation.cfm?id=2568320.
    [3] Z. Mahmood, D. Bowes, P. C. R. Lane, et al., What is the Impact of Imbalance on Software Defect Prediction Performance?, Proceedings of the 11th International Conference on Predictive Models and Data Analytics in Software Engineering, ACM, 2015. Available from: https://dl_acm.xilesou.top/citation.cfm?id=2810150.
    [4] C. Tantithamthavorn, Towards a better understanding of the impact of experimental components on defect prediction modeling, 2016 IEEE/ACM 38th International Conference on Software Engineering Companion (ICSE-C), 2016, 867-870. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/7883423.
    [5] B. Turhan, T. Menzies, A. B. Bener, et al., On the relative value of cross-company and within-company data for defect prediction, Empirical Software Eng., 14 (2009), 540-578.
    [6] Y. Ma, G. Luo, X. Zeng, et al., Transfer learning for cross-company software defect prediction, Inf. Software Technol., 54 (2012), 248-256.
    [7] G. Canfora, A. De Lucia, M. Di Penta, et al., Multi-objective cross-project defect prediction, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation, 2013, 252-261. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/6569737.
    [8] F. Peters, T. Menzies and A. Marcus, Better cross company defect prediction, Proceedings of the 10th Working Conference on Mining Software Repositories, 2013, 409-418. Available from: https://dl_acm.xilesou.top/citation.cfm?id=2487161.
    [9] L. Chen, B. Fang, Z. Shang, et al., Negative samples reduction in cross-company software defects prediction, Inf. Software Technol., 62 (2015), 67-77.
    [10] J. Nam and S. Kim, Heterogeneous defect prediction, Proceedings of the 2015 10th joint meeting on foundations of software engineering, ACM, 2015, 508-519. Available from: https://dl_acm.xilesou.top/citation.cfm?id=2786814.
    [11] X. Jing, F. Wu, X. Dong, et al., Heterogeneous cross-company defect prediction by unified metric representation and CCA-based transfer learning, Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ACM, 2015, 496-507. Available from: https://dl_acm.xilesou.top/citation.cfm?id=2786813.
    [12] M. H. Halstead, Elements of Software Science, Elsevier Science, New York, 1977.
    [13] T. J. McCabe, A complexity measure, IEEE Trans. Software Eng., 4 (1976), 308-320.
    [14] S. R. Chidamber and C. F. Kemerer, A metrics suite for object oriented design, IEEE Trans. Software Eng., 20 (1994), 476-493.
    [15] T. L. Graves, A. F. Karr, J. S. Marron, et al., Predicting fault incidence using software change history, IEEE Trans. Software Eng., 26 (2000), 653-661.
    [16] K. O. Elish and M. O. Elish, Predicting defect-prone software modules using support vector machines, J. Syst. Software, 81 (2008), 649-660.
    [17] A. S. Andreou and E. Papatheocharous, Software cost estimation using fuzzy decision trees, 2008 23rd IEEE/ACM International Conference on Automated Software Engineering, 2008, 371-374. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/4639344.
    [18] N. Bettenburg, M. Nagappan and A. E. Hassan, Think locally, act globally: Improving defect and effort prediction models, 2012 9th IEEE Working Conference on Mining Software Repositories (MSR), 2012, 60-69. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/6224300.
    [19] S. J. Pan and Q. Yang, A Survey on Transfer Learning, IEEE Trans. Knowl. Data Eng., 22 (2010), 1345-1359.
    [20] H. F. Chang and A. Mockus, Constructing universal version history, Proceedings of the 2006 international workshop on Mining software repositories, 2006, 76-79. Available from: https://dl_acm.xilesou.top/citation.cfm?id=1138002.
    [21] T. Menzies, B. Caglayan, E. Kocaguneli, et al., The promise repository of empirical software engineering data, 2012 (2012).
    [22] M. Shepperd, Q. Song, Z. Sun, et al., Data quality: Some comments on the NASA software defect datasets, IEEE Trans. Software Eng., 39 (2013), 1208-1215.
    [23] M. D'Ambros, M. Lanza, R. Robbes, An extensive comparison of bug prediction approaches, 2010 7th IEEE Working Conference on Mining Software Repositories (MSR 2010), 2010, 31-41. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/5463279.
    [24] R. Wu, H. Zhang, S. Kim, et al., Relink: Recovering links between bugs and changes, Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering, ACM, 2011, 15-25. Available from: https://dl_acm.xilesou.top/citation.cfm?id=2025120.
    [25] S. Zhong, T. M. Khoshgoftaar and N. Seliya, Unsupervised Learning for Expert-Based Software Quality Estimation, HASE, 2004, 149-155. Available from: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.89.1471&rep=rep1&type=pdf.
    [26] P. S. Bishnu and V. Bhattacherjee, Software fault prediction using quad tree-based k-means clustering algorithm, IEEE Trans. Knowl. Data Eng., 24 (2012), 1146-1150.
    [27] G. Abaei, Z. Rezaei and A. Selamat, Fault prediction by utilizing self-organizing Map and Threshold, 2013 IEEE International Conference on Control System, Computing and Engineering, 2013, 465-470. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/6720010.
    [28] J. Nam and S. Kim, CLAMI: Defect Prediction on Unlabeled Datasets (T), 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE), 2015, 452-463. Available from: https://ieeexplore_ieee.xilesou.top/abstract/document/7372033.
    [29] F. Zhang, Q. Zheng, Y. Zou, et al., Cross-project defect prediction using a connectivity-based unsupervised classifier, Proceedings of the 38th International Conference on Software Engineering, ACM, 2016, 309-320.
    [30] J. Han, J. Pei and M. Kamber, Data Mining: Concepts and Techniques, Elsevier, 2012.
    [31] A. B. A. Graf and S. Borer, Normalization in support vector machines, Joint Pattern Recognition Symposium, Springer, Berlin, Heidelberg, 2001, 277-282.
    [32] M. Harel and S. Mannor, Learning from multiple outlooks, arXiv preprint arXiv1005.0027, 2010.
    [33] L. Yang, L. P. Jing, J. Yu, et al., Heterogeneous transductive transfer learning algorithm, J. Software, 26 (2015), 2762-2780 (in Chinese).
    [34] J. C. Gower and G. B. Dijksterhuis, Procrustes problems, Oxford University Press on Demand, 2004.
    [35] F. Wilcoxon, Individual comparisons by ranking methods, Breakthroughs in Statistics, Springer Series in Statistics (Perspectives in Statistics), Springer, New York, 1992, 196-202.
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(5601) PDF downloads(478) Cited by(6)

Figures and Tables

Figures(3)  /  Tables(10)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog