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

A swarm intelligence-based ensemble learning model for optimizing customer churn prediction in the telecommunications sector

  • In today's competitive market, predicting clients' behavior is crucial for businesses to meet their needs and prevent them from being attracted by competitors. This is especially important in industries like telecommunications, where the cost of acquiring new customers exceeds retaining existing ones. To achieve this, companies employ Customer Churn Prediction approaches to identify potential customer attrition and develop retention plans. Machine learning models are highly effective in identifying such customers; however, there is a need for more effective techniques to handle class imbalance in churn datasets and enhance prediction accuracy in complex churn prediction datasets. To address these challenges, we propose a novel two-level stacking-mode ensemble learning model that utilizes the Whale Optimization Algorithm for feature selection and hyper-parameter optimization. We also introduce a method combining K-member clustering and Whale Optimization to effectively handle class imbalance in churn datasets. Extensive experiments conducted on well-known datasets, along with comparisons to other machine learning models and existing churn prediction methods, demonstrate the superiority of the proposed approach.

    Citation: Bijan Moradi, Mehran Khalaj, Ali Taghizadeh Herat, Asghar Darigh, Alireza Tamjid Yamcholo. A swarm intelligence-based ensemble learning model for optimizing customer churn prediction in the telecommunications sector[J]. AIMS Mathematics, 2024, 9(2): 2781-2807. doi: 10.3934/math.2024138

    Related Papers:

    [1] Jichun Li, Gaihui Guo, Hailong Yuan . Nonlocal delay gives rise to vegetation patterns in a vegetation-sand model. Mathematical Biosciences and Engineering, 2024, 21(3): 4521-4553. doi: 10.3934/mbe.2024200
    [2] Yuhong Huo, Gourav Mandal, Lakshmi Narayan Guin, Santabrata Chakravarty, Renji Han . Allee effect-driven complexity in a spatiotemporal predator-prey system with fear factor. Mathematical Biosciences and Engineering, 2023, 20(10): 18820-18860. doi: 10.3934/mbe.2023834
    [3] Shuangte Wang, Hengguo Yu . Stability and bifurcation analysis of the Bazykin's predator-prey ecosystem with Holling type Ⅱ functional response. Mathematical Biosciences and Engineering, 2021, 18(6): 7877-7918. doi: 10.3934/mbe.2021391
    [4] Yue Xing, Weihua Jiang, Xun Cao . Multi-stable and spatiotemporal staggered patterns in a predator-prey model with predator-taxis and delay. Mathematical Biosciences and Engineering, 2023, 20(10): 18413-18444. doi: 10.3934/mbe.2023818
    [5] Mingzhu Qu, Chunrui Zhang, Xingjian Wang . Analysis of dynamic properties on forest restoration-population pressure model. Mathematical Biosciences and Engineering, 2020, 17(4): 3567-3581. doi: 10.3934/mbe.2020201
    [6] Rina Su, Chunrui Zhang . The generation mechanism of Turing-pattern in a Tree-grass competition model with cross diffusion and time delay. Mathematical Biosciences and Engineering, 2022, 19(12): 12073-12103. doi: 10.3934/mbe.2022562
    [7] Sourav Kumar Sasmal, Jeet Banerjee, Yasuhiro Takeuchi . Dynamics and spatio-temporal patterns in a prey–predator system with aposematic prey. Mathematical Biosciences and Engineering, 2019, 16(5): 3864-3884. doi: 10.3934/mbe.2019191
    [8] Sangeeta Kumari, Sidharth Menon, Abhirami K . Dynamical system of quokka population depicting Fennecaphobia by Vulpes vulpes. Mathematical Biosciences and Engineering, 2025, 22(6): 1342-1363. doi: 10.3934/mbe.2025050
    [9] Hongyong Zhao, Qianjin Zhang, Linhe Zhu . The spatial dynamics of a zebrafish model with cross-diffusions. Mathematical Biosciences and Engineering, 2017, 14(4): 1035-1054. doi: 10.3934/mbe.2017054
    [10] Martin Baurmann, Wolfgang Ebenhöh, Ulrike Feudel . Turing instabilities and pattern formation in a benthic nutrient-microorganism system. Mathematical Biosciences and Engineering, 2004, 1(1): 111-130. doi: 10.3934/mbe.2004.1.111
  • In today's competitive market, predicting clients' behavior is crucial for businesses to meet their needs and prevent them from being attracted by competitors. This is especially important in industries like telecommunications, where the cost of acquiring new customers exceeds retaining existing ones. To achieve this, companies employ Customer Churn Prediction approaches to identify potential customer attrition and develop retention plans. Machine learning models are highly effective in identifying such customers; however, there is a need for more effective techniques to handle class imbalance in churn datasets and enhance prediction accuracy in complex churn prediction datasets. To address these challenges, we propose a novel two-level stacking-mode ensemble learning model that utilizes the Whale Optimization Algorithm for feature selection and hyper-parameter optimization. We also introduce a method combining K-member clustering and Whale Optimization to effectively handle class imbalance in churn datasets. Extensive experiments conducted on well-known datasets, along with comparisons to other machine learning models and existing churn prediction methods, demonstrate the superiority of the proposed approach.



    Antibiotics are the secondary metabolites of certain microorganisms that can selectively inhibit or kill other microorganisms at low concentrations without bringing serious toxicity to the host. Under the action of antibiotics, a large number of sensitive bacteria are inhibited or killed, but a few sensitive bacteria change their metabolic pathways and become resistant bacteria. Repeated application of the same antibiotics results in a screening of resistant bacteria and antibiotics are ineffective once resistant bacteria become dominant, which aggravates the hazard of bacterial infection to human health [1]. Therefore, many scholars have invested their energy in studying bacterial resistance [2,3,4,5,6,7,8,9,10]. In Reference [2], Austin and Anderson formulated a model to describe the transmission dynamics of resistant bacteria between the host and the medical staff. Their study aimed to reveal the necessity of strengthening clinical management of patients infected with bacteria. In Reference [3], Blair and Webber expounded the molecular mechanisms of bacterial resistance including intrinsic resistance and acquired resistance. In Reference [6], authors assumed that bacterial resistance is acquired by genetic mutation and plasmid transfer and formulated a population dynamic model of sensitive and resistant bacteria to antibiotics. The stability of the coexistence equilibrium and the existence of the limit cycle is discussed. In Reference [10], the author formulated the following model to investigate the dynamic changes of bacterial resistance in a single bacterial population that is exposed to a single antibiotic:

    {dxdt=(αβ(x+y))xγηx+δy,dydt=(αβ(x+y))yδy, (1.1)

    where x(t) and y(t) are two distinct populations of the same species of disease-causing bacteria. x(t) denotes the density of sensitive bacteria in the bacterial population and y(t) denotes the density of resistant bacteria in the bacterial population. α is the growth rate of the two kinds of bacteria. In view of limited nutrients in the host, struggle for survival between the two kinds of bacteria will cause them to be sifted out at a rate of β. γ is the antimicrobial ability, which is larger for bactericidal antibiotics compared to bacteriostatic antibiotics. η is the antibiotic concentration. δ is the conversion rate of resistant bacteria losing resistance and converting into sensitive bacteria. All the above parameters are positive constants. By qualitative analysis, Garber gave the conditions under which resistant bacteria will go to extinction.

    How to optimize the antibiotic treatment measures is a topic that mathematicians have been interested in for a long time [11,12,13,14,15,16,17,18]. In Reference [11], authors introduced the impulsive state feedback control into the system (1.1) and then got the following system:

    {dxdt=(αβ(x+y))xγηx+δydydt=(αβ(x+y))yδy}y<h,Δx=x(t+)x(t)=θhΔy=y(t+)y(t)=θh}y=h. (1.2)

    The orbital stability of the order-1 periodic solution is presented. It can be seen that the density of resistant bacteria is limited to a lower level in the system with impulsive state feedback control. In Reference [14], the authors formulated a model to simulate the contribution of antibiotics and immune system to combat bacterial infection and then propounded an optimal control problem. The optimal control is found by applying Pontryagins Maximum Principle. In reference [17], the authors mainly focused on the two subpopulations of the same species. One subpopulation has an intrinsic resistance to drugs and the other one is sensitive to drugs. The authors formulated a nonlinear objective function to achieve the following two goals: (i) minimize the size of the bacterial population, (ii) prevent resistant bacteria from becoming dominant. The results indicate that the optimal control contains a singular interval.

    Currently, impulsive state feedback control has been widely applied in various fields such as biology, medicine, etc. [19,20,21,22]. Meanwhile, the study of the periodic solution has made many new advances [23,24,25,26,27,28,29,30]. In Reference [19], authors established a crop pest management model with impulsive state feedback control. It can be known that observations and records of the pest quantity at different stages of crops can help to control the size of the pest population. In Reference [25], authors reviewed the research results of the periodic solution since 2010 and presented the recent research results.

    This paper is organized as follows: In Section 2, we formulate a model of conversion between sensitive and resistant bacteria and then introduce impulsive state feedback control to optimize antibiotic treatment measures. In Section 3, the global asymptotic stability of the positive equilibrium is discussed. In Section 4, the orbital stability of the order-1 periodic solution is proved. In Section 5, the numerical simulation is used to confirm our results.

    Motivated by [10], the conversion rate of resistant bacteria losing resistance and converting into sensitive bacteria is represented by δyk+y. We can obtain limy+δyk+y=δ, which shows that as the density of resistant bacteria increases, the conversion rate of resistant bacteria losing resistance and converting into sensitive bacteria increases and gradually tends towards δ. We give the following system:

    {dxdt=(αβ(x+y))xγηx+δyk+y,dydt=(αβ(x+y))yδyk+y, (2.1)

    where x(t) and y(t) are two distinct populations of the same species of disease-causing bacteria. x(t) denotes the density of sensitive bacteria in the bacterial population and y(t) denotes the density of resistant bacteria in the bacterial population. α is the growth rate of the two kinds of bacteria. In view of limited nutrients in the host, struggle for survival between the two kinds of bacteria will cause them to be sifted out at a rate of β. γ is the antimicrobial ability, which is larger for bactericidal antibiotics compared to bacteriostatic antibiotics. η is the antibiotic concentration. All the above parameters are positive constants.

    Severe bacterial infection can endanger life. Clinically, antibiotics are commonly used to inhibit or kill disease-causing bacteria. However, prolonged administration of the same antibiotics can cause bacterial resistance, which, in turn, makes the antibiotic effect worse and even disappear. We can use other antibiotics when one antibiotic loses its effectiveness, but bacteria still become resistant to new antibiotics after long-term use. Thus, replacing antibiotics doesn't fundamentally reduce bacterial resistance. We need to optimize the antibiotic treatment measures to extend or restore the antibiotic effectiveness. Inspired by [11,12], we introduce the impulsive state feedback control into the system (2.1) and then get the following system:

    {dxdt=(αβ(x+y))xγηx+δyk+ydydt=(αβ(x+y))yδyk+y}y<h,Δx=x(t+)x(t)=θhΔy=y(t+)y(t)=θh}y=h. (2.2)

    where h is the critical threshold value of resistant bacteria at which antibiotics lose best treatment for patients. When the density of resistant bacteria reaches the critical threshold value h, θ multiples of resistant bacteria become sensitive bacteria under the impulsive effect (0<θ<1).

    For convenience, we give the following definitions and theorems.

    Definition 2.1 [25] Consider a two dimensional state dependent impulsive differential equation

    {dxdt=P(x,y)dydt=Q(x,y)}(x,y)M(x,y),Δx=μ(x,y)Δy=v(x,y)}(x,y)=M(x,y). (2.3)

    Suppose the impulsive set M and phase set N of system (2.3) fall between two parallel lines, the intersection of y-axis with the phase set N line is F. Due to the pulse effect, any trajectory starting from N reaches the impulsive set M and then is mapped to IN. Then the point I is called the successor point of the point G and g(G)=|FI||FG| is called the successor function of the point G, where |FI|, |FG| are the distance between the point F and the point I and between the point F and the point G, respectively.

    Theorem 2.1 [25] The successor function g is continuous.

    Theorem 2.2 [25] Assume ^n1n2¯n1n2 is an order-1 cycle and the point m is the successor point of e. According to the position between the points n1, e and m, the order-1 periodic solution is classified into three types:

    1) Type 1: the order-1 cycle ^n1n2¯n1n2 is convex, and the points e and m are at the same side of n1 as shown in Figure 1(a).

    Figure 1.  Three types of the order-1 periodic solution.

    2) Type 2: the order-1 cycle ^n1n2¯n1n2 is not convex, yet the points e and m are at the same side of n1 as shown in Figure 1(b).

    3) Type 3: the points e and m are at different sides of n1 as shown in Figure 1(c).

    Theorem 2.3 [25] If Γ is a type 1 order-1 periodic solution with period T and the integral along Γ satisfies

    T0(Px+Qy)dt<0,

    Γ is orbital stable.

    Theorem 2.4 [25] If Γ is a type 1 order-1 periodic solution and the region that contains Γ satisfies

    Px+Qy<0,

    Γ is orbital stable.

    Without the impulsive effect, the system (2.2) is reduced to

    {dxdt=(αβ(x+y))xγηx+δyk+yP(x,y),dydt=(αβ(x+y))yδyk+yQ(x,y). (3.1)

    Theorem 3.1. The system (3.1) is uniformly bounded in the first quadrant.

    Proof. The positive x-axis is either a single trajectory or a combination of an equilibrium point and two trajectories. However, both cases imply that no trajectory intersects with the positive x-axis.

    Obviously, dxdt|x=0=δyk+y>0 holds for y>0, which shows that when meeting the positive y-axis, the trajectory will pass through it from left to right (see Figure 2).

    Figure 2.  Boundedness.

    By investigating the straight line lx+yαβ=0, we can obtain

    dldt|l=0=[(αβ(x+y))(x+y)γηx]|l=0=γηx<0

    for x>0, which indicates that when meeting the straight line l=0 in the first quadrant, the trajectory will pass through it from upper right to lower left (see Figure 2).

    From the above, we can see that the system (3.1) is uniformly bounded in the first quadrant.

    The proof is completed.

    The equilibria of the system (3.1) are given by

    {(αβ(x+y))xγηx+δyk+y=0,(αβ(x+y))yδyk+y=0. (3.2)

    From the second equation of (3.2), we can obtain y=0 or x=αβδβ(k+y)y. By substituting y=0 in the first equation of (3.2), we can obtain x=0 or x=αγηβ, so the equilibrium E0(0,0) always exists and the equilibrium E1(αγηβ,0) exists if α>γη holds.

    By substituting x=αβδβ(k+y)y in the first equation of (3.2), we can obtain

    Φ(y)=ay3+by2+cy+d=0, (3.3)

    where

    a=βγη,b=2βγηkαγη,c=αδ+γηδ+βγηk22αγηk,d=(αkδ)(δγηk).

    Theorem 3.2. If βk2>αk>δ and γηk>δ hold, the system (3.1) has a unique positive equilibrium.

    Proof. Suppose y1,y2,y3 are three roots of Φ(y)=0 defined in (3.3) in the complex number field. According to the Vieta theorem, we can obtain

    {y1y2y3=da=(αkδ)(γηkδ)βγη,y1+y2+y3=ba=α2βkβ.

    If βk2>αk>δ and γηk>δ hold, we can obtain

    {y1y2y3>0,y1+y2+y3<0.

    Thus, Φ(y)=0 defined in (3.3) has one positive real root and two complex roots with negative real parts. Hence, Φ(y)=0 defined in (3.3) has a unique positive real root. Consequently, the system (3.1) has a unique positive equilibrium.

    The proof is completed.

    The Jacobian matrix of the system (3.1) is

    J(E(x,y))=[αβ(x+y)βxγηβx+δk(k+y)2βyαβ(x+y)βyδk(k+y)2].

    Theorem 3.3. If min{γη,δk}>α holds, the equilibrium E0(0,0) is a stable node. If max{γη,δk}>α>min{γη,δk} holds, the equilibrium E0(0,0) is a saddle point. If α>max{γη,δk} holds, then the equilibrium E0(0,0) is an unstable node.

    Proof. The Jacobian matrix at the equilibrium E0(0,0) is

    J(E0(0,0))=[αγηδk0αδk].

    The eigenvalues of J(E0(0,0)) are

    λ1=αγη,
    λ2=αδk.

    If min{γη,δk}>α holds, we can obtain λ1<0, λ2<0. Thus, the equilibrium E0(0,0) is a stable node. If max{γη,δk}>α>min{γη,δk} holds, we can obtain λ1>0, λ2<0 or λ1<0, λ2>0. Hence, the equilibrium E0(0,0) is a saddle point. If α>max{γη,δk} holds, we can obtain λ1>0, λ2>0. Therefore, the equilibrium E0(0,0) is an unstable node.

    The proof is completed.

    Theorem 3.4. If min{α,δk}>γη holds, the equilibrium E1(αγηβ,0) is a stable node. If α>γη>δk holds, the equilibrium E1(αγηβ,0) is a saddle point.

    Proof. The Jacobian matrix at the equilibrium E1(αγηβ,0) is

    J(E1(αγηβ,0))=[γηαγηα+δk0γηδk].

    The eigenvalues of J(E1(αγηβ,0)) are

    λ1=γηα,
    λ2=γηδk.

    If min{α,δk}>γη holds, we can obtain λ1<0, λ2<0. Hence, the equilibrium E1(αγηβ,0) is a stable node. If α>γη>δk holds, we can obtain λ1<0, λ2>0. Therefore, the equilibrium E1(αγηβ,0) is a saddle point.

    The proof is completed.

    Theorem 3.5. If βk2>αk>δ and γηk>δ hold, the unique positive equilibrium E(x,y) is globally asymptotically stable.

    Proof. The Jacobian matrix at the positive equilibrium E(x,y) is

    J(E(x,y))=[αβ(x+y)βxγηβx+δk(k+y)2βyαβ(x+y)βyδk(k+y)2].

    Combined with x=αβδβ(k+y)y, we can obtain

    J(E(x,y))=[2δk+y+βyαγηδk+y+βyα+δk(k+y)2βyδk+yβyδk(k+y)2].

    If βk2>αk>δ and γηk>δ hold, we can obtain

    tr(J(E(x,y)))=(2δk+y+βyαγη)+(δk+yβyδk(k+y)2)=3δk+yδk(k+y)2αγη=(α+γη)(y)2+(2αk+2γηk3δ)y+k(αk+γηk2δ)(k+y)2<0,

    and

    det(J(E(x,y)))=|2δk+y+βyαγηδk+y+βyα+δk(k+y)2βyδk+yβyδk(k+y)2|=αδk+γηδk+2δ2(k+y)2+βγηyαδ+γηδk+y2δ2k(k+y)3=βγη(y)4+3βγηk(y)3+(3βγηk2αδγηδ)(y)2+(βγηk3αδkγηδk+2δ2)y(k+y)3>βγη(y)4+3βγηk(y)3+(3αγηkαδγηδ)(y)2+(αγηk2αδkγηδk+2δ2)y(k+y)3=βγη(y)4+3βγηk(y)3+(αγηk+α(γηkδ)+γη(αkδ))(y)2(k+y)3+((αkδ)(γηkδ)+δ2)y(k+y)3>0.

    Therefore, the unique positive equilibrium E(x,y) is locally asymptotically stable.

    Define a Dulac function D(x,y)=1xy and we can obtain

    (D(x,y)P(x,y))x+(D(x,y)Q(x,y))y=βyδ(k+y)x2βx+δ(k+y)2x=βyδ(k+y)x2βy2+2βky+βk2δ(k+y)2x<0,

    which implies that there is no limit cycle in the first quadrant. Consequently, the unique positive equilibrium E(x,y) is globally asymptotically stable.

    The proof is completed.

    Theorem 4.1. When h<y, the system (2.2) has a unique order-1 periodic solution.

    Proof. From the system (2.2), we can obtain the impulsive set M={(x,y)R2+|x0,y=h} and the phase set N={(x,y)R2+|xθh,y=(1θ)h}. When h<y, both the impulsive set M and the phase set N are below the positive equilibrium E(x,y).

    Now, we will prove the existence of the order-1 periodic solution. Suppose the straight line y=(1θ)h intersects with isoclines dxdt=0 and dydt=0 at points R and S, respectively (see Figure 3(a)). The trajectory initiating from the point R(xR,(1θ)h) intersects with the impulsive set M at the point RM and then the point RM is mapped to RN(xRN,(1θ)h) due to the impulsive effect. The point RN is the successor point of the point R. The point RN must be on the right of the point R according to the property of the vector field, and therefore the successor function satisfies

    g(R)=xRNxR>0.

    Similarly, the trajectory initiating from the point S(xS,(1θ)h) reaches the impulsive set M at the point SM and then the point SM jumps to SN(xSN,(1θ)h) due to the impulsive effect. The point SN is the successor point of the point S. The point SN must be on the left of the point S according to the property of the vector field, and hence the successor function satisfies

    g(S)=xSNxS<0.

    Following the continuity of the successor function, there must be a point W between R and S that makes g(W)=0 hold. The trajectory initiating from the point W hits the impulsive set M at the point WM and then the point WM is mapped back to W itself due to the impulsive effect. In consequence, the system (2.2) has an order-1 periodic solution.

    Figure 3.  (a) Existence of the order-1 periodic solution. (b) Uniqueness of the order-1 periodic solution.

    Next, we will prove the uniqueness of the order-1 periodic solution. We arbitrarily choose two points T and U in the phase set N where xT<xU (see Figure 3(b)). The trajectory initiating from the point T reaches the impulsive set M at the point TM and then the point TM jumps to TN due to the impulsive effect. The point TN is the successor point of the point T. Similarly, the trajectory initiating from the point U intersects with the impulsive set M at the point UM and then the point UM is mapped to UN due to the impulsive effect. The point UN is the successor point of the point U. Since xUxT>xUMxTM and xUMxTM=xUNxTN hold, we can obtain xUxT>xUNxTN. Hence the successor function satisfies

    g(U)g(T)=(xUNxU)(xTNxT)=(xUNxTN)(xUxT)<0.

    Hence, the successor function g is monotonically decreasing in the phase set N. Therefore, there must be only one point W that makes g(W)=0 hold. In consequence, the system (2.2) has a unique order-1 periodic solution.

    The proof is completed.

    Theorem 4.2. When h<y, the unique order-1 periodic solution of the system (2.2) is orbital stable.

    Proof. From Figure 3(a) and Theorem 2.2, we can conclude that the order-1 periodic solution of the system (2.2) is a type 1 order-1 periodic solution. Define a Dulac function D(x,y)=1xy and the stability of the order-1 periodic solution of the system (2.2) can be decided by the system:

    {d¯xdt=D(x,y)dxdt=αβ(x+y)yγηy+δx(k+y)=D(x,y)P(x,y),d¯ydt=D(x,y)dydt=αβ(x+y)xδx(k+y)=D(x,y)Q(x,y).

    We can obtain

    (D(x,y)P(x,y))x+(D(x,y)Q(x,y))y=βyδ(k+y)x2βx+δ(k+y)2x=βyδ(k+y)x2βy2+2βky+βk2δ(k+y)2x<0.

    According to Theorem 2.4, we can know that the unique order-1 periodic solution of the system (2.2) is orbital stable.

    The proof is completed.

    Let parameters α=2, β=0.8, γ=0.3, η=0.9, δ=1, k=4 and parameters α=2, β=0.8, γ=0.3, η=3, δ=1, k=4. Both cases satisfy the conditions of Theorem 3.5, and therefore the unique positive equilibrium E(x,y) is globally asymptotically stable in both cases. The numerical simulation is used to confirm the result (see Figures 4 and 5). We get the positive equilibrium E(x,y)=(1.898,0.312) for η=0.9, which is simulated in Figure 4. With the increase in the antibiotic concentration, we get the positive equilibrium E(x,y)=(0.434,1.852) for η=3, which is simulated in Figure 5. It can be seen that the density of resistant bacteria increases as the antibiotic concentration increases. This means that prolonged administration of the same antibiotics can cause bacterial resistance, which, in turn, makes the antibiotic effect worse and even disappear.

    Figure 4.  Time series and phase portrait of system (3.1) with parameters α=2, β=0.8, γ=0.3, η=0.9, δ=1, k=4, E(x,y)=(1.898,0.312).
    Figure 5.  Time series and phase portrait of system (3.1) with parameters α=2, β=0.8, γ=0.3, η=3, δ=1, k=4, E(x,y)=(0.434,1.852).

    Antibiotics play a vital role in the fight between humans and disease-causing bacteria, so we need to optimize the antibiotic treatment measures to extend or restore the antibiotic effectiveness. In this paper, we formulate a simplified model of conversion between sensitive and resistant bacteria with the impulsive state feedback control. Let parameters α=2, β=0.8, γ=0.3, η=3, δ=1, k=4, h=0.4, θ=0.9. This case satisfies the conditions of Theorem 3.5 and Theorem 4.1, and therefore the unique order-1 periodic solution of the system (2.2) is orbital stable in this case. The numerical simulation is used to confirm the result (see Figure 6). It can be seen that there is an oscillation of the density of resistant bacteria in an interval below the critical threshold value when the impulsive state feedback control is adopted. This strongly shows that the impulsive state feedback control can reduce bacterial resistance.

    Figure 6.  Time series and phase portrait of system (2.2) with parameters α=2, β=0.8, γ=0.3, η=3, δ=1, k=4, h=0.4, θ=0.9.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work is supported by the National Natural Science Foundation of China (No.12171193 and 12271346), the project of the Distinguished Professor of colleges and universities of Henan province in 2019 and Project of Foreign expert in Henan (HNGD2023074).

    The authors declare that they have no conflict of interest in the manuscript.



    [1] J. Wu, A study on customer acquisition cost and customer retention cost: Review and outlook, Proceedings of the 9th International Conference on Innovation & Management, 2012,799–803.
    [2] A. Bilal Zorić, Predicting customer churn in banking industry using neural networks, INDECS, 14 (2016), 116–124. https://doi.org/10.7906/indecs.14.2.1 doi: 10.7906/indecs.14.2.1
    [3] K. G. M. Karvana, S. Yazid, A. Syalim, P. Mursanto, Customer churn analysis and prediction using data mining models in banking industry, 2019 International Workshop on Big Data and Information Security (IWBIS), 2019, 33–38. https://doi.org/10.1109/IWBIS.2019.8935884 doi: 10.1109/IWBIS.2019.8935884
    [4] A. Keramati, H. Ghaneei, S. M. Mirmohammadi, Developing a prediction model for customer churn from electronic banking services using data mining, Financ. Innov., 2 (2016), 10. https://doi.org/10.1186/s40854-016-0029-6 doi: 10.1186/s40854-016-0029-6
    [5] J. Kaur, V. Arora, S. Bali, Influence of technological advances and change in marketing strategies using analytics in retail industry, Int. J. Syst. Assur. Eng. Manag., 11 (2020), 953–961. https://doi.org/10.1007/s13198-020-01023-5 doi: 10.1007/s13198-020-01023-5
    [6] O. F. Seymen, O. Dogan, A. Hiziroglu, Customer churn prediction using deep learning, Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020), 2020,520–529. https://doi.org/10.1007/978-3-030-73689-7_50 doi: 10.1007/978-3-030-73689-7_50
    [7] A. Dingli, V. Marmara, N. S. Fournier, Comparison of deep learning algorithms to predict customer churn within a local retail industry, Int. J. Mach. Learn. Comput., 7 (2017), 128–132. https://doi.org/10.18178/ijmlc.2017.7.5.634 doi: 10.18178/ijmlc.2017.7.5.634
    [8] M. C. Mozer, R. Wolniewicz, D. B. Grimes, E. Johnson, H. Kaushansky, Predicting subscriber dissatisfaction and improving retention in the wireless telecommunications industry, IEEE T. Neural Networks, 11 (2000), 690–696. https://doi.org/10.1109/72.846740 doi: 10.1109/72.846740
    [9] J. Hadden, A. Tiwari, R. Roy, D. Ruta, Computer assisted customer churn management: State-of-the-art and future trends, Comput. Oper. Res., 34 (2007), 2902–2917. https://doi.org/10.1016/j.cor.2005.11.007 doi: 10.1016/j.cor.2005.11.007
    [10] K. Coussement, D. Van den Poel, Churn prediction in subscription services: An application of support vector machines while comparing two parameter-selection techniques, Expert Syst. Appl., 34 (2008), 313–327. https://doi.org/10.1016/j.eswa.2006.09.038 doi: 10.1016/j.eswa.2006.09.038
    [11] J. Burez, D. Van den Poel, Handling class imbalance in customer churn prediction, Expert Syst. Appl., 36 (2009), 4626–4636. https://doi.org/10.1016/j.eswa.2008.05.027 doi: 10.1016/j.eswa.2008.05.027
    [12] P. C. Pendharkar, Genetic algorithm based neural network approaches for predicting churn in cellular wireless network services, Expert Syst. Appl., 36 (2009), 6714–6720. https://doi.org/10.1016/j.eswa.2008.08.050 doi: 10.1016/j.eswa.2008.08.050
    [13] A. Idris, A. Khan, Y. S. Lee, Genetic programming and adaboosting based churn prediction for telecom, IEEE international conference on Systems, Man, and Cybernetics (SMC), 2012, 1328–1332. https://doi.org/10.1109/ICSMC.2012.6377917 doi: 10.1109/ICSMC.2012.6377917
    [14] T. Vafeiadis, K. I. Diamantaras, G. Sarigiannidis, K. C. Chatzisavvas, A comparison of machine learning techniques for customer churn prediction, Simulation Modell. Prac. Theory, 55 (2015), 1–9. https://doi.org/10.1016/j.simpat.2015.03.003 doi: 10.1016/j.simpat.2015.03.003
    [15] A. Idris, A. Khan, Churn prediction system for telecom using filter–wrapper and ensemble classification, Comput. J., 60 (2017), 410–430. https://doi.org/10.1093/comjnl/bxv123 doi: 10.1093/comjnl/bxv123
    [16] M. Imani, Customer Churn Prediction in Telecommunication Using Machine Learning: A Comparison Study, AUT J. Model. Simulation, 52 (2020), 229–250. https://doi.org/10.22060/miscj.2020.18038.5202 doi: 10.22060/miscj.2020.18038.5202
    [17] S. Wu, W.-C. Yau, T.-S. Ong, S.-C. Chong, Integrated churn prediction and customer segmentation framework for telco business, IEEE Access, 9 (2021), 62118–62136. https://doi.org/10.1109/ACCESS.2021.3073776 doi: 10.1109/ACCESS.2021.3073776
    [18] Y. Beeharry, R. Tsokizep Fokone, Hybrid approach using machine learning algorithms for customers' churn prediction in the telecommunications industry, Concurrency Comput.: Prac. Exper., 34 (2022), e6627. https://doi.org/10.1002/cpe.6627 doi: 10.1002/cpe.6627
    [19] D. W. Hosmer Jr, S. Lemeshow, R. X. Sturdivant, Applied logistic regression, Hoboken: John Wiley & Sons, 2013. https://doi.org/10.1002/9781118548387
    [20] J. R. Quinlan, Induction of decision trees, Mach. Learn., 1 (1986), 81–106. https://doi.org/10.1007/BF00116251 doi: 10.1007/BF00116251
    [21] I. Rish, An empirical study of the naive Bayes classifier, IJCAI 2001 workshop on empirical methods in artificial intelligence, 3 (2001), 41–46.
    [22] C. Cortes, V. Vapnik, Support-vector networks, Mach. Learn., 20 (1995), 273–297. https://doi.org/10.1007/BF00994018 doi: 10.1007/BF00994018
    [23] M. H. Hassoun, Fundamentals of artificial neural networks, Cambridge: MIT press, 1995.
    [24] T. K. Ho, Random decision forests, Proceedings of 3rd international conference on document analysis and recognition, 1 (1995), 278–282. https://doi.org/10.1109/ICDAR.1995.598994 doi: 10.1109/ICDAR.1995.598994
    [25] Y. Freund, R. E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Syst. Sci., 55 (1997), 119–139. https://doi.org/10.1006/jcss.1997.1504 doi: 10.1006/jcss.1997.1504
    [26] J. H. Friedman, Greedy function approximation: a gradient boosting machine, Ann. Statist., 29 (2001), 1189–1232. https://doi.org/10.1214/aos/1013203451 doi: 10.1214/aos/1013203451
    [27] T. Chen, C. Guestrin, Xgboost: A scalable tree boosting system, Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining, 2016,785–794. https://doi.org/10.1145/2939672.2939785 doi: 10.1145/2939672.2939785
    [28] Z. Ghasemi Darehnaei, M. Shokouhifar, H. Yazdanjouei, S. M. J. Rastegar Fatemi, SI‐EDTL: Swarm intelligence ensemble deep transfer learning for multiple vehicle detection in UAV images, Concurrency Comput.: Prac. Exper., 34 (2022), e6726. https://doi.org/10.1002/cpe.6726 doi: 10.1002/cpe.6726
    [29] N. Behmanesh-Fard, H. Yazdanjouei, M. Shokouhifar, F. Werner, Mathematical Circuit Root Simplification Using an Ensemble Heuristic–Metaheuristic Algorithm, Mathematics, 11 (2023), 1498. https://doi.org/10.3390/math11061498 doi: 10.3390/math11061498
    [30] A. Amin, S. Anwar, A. Adnan, M. Nawaz, N. Howard, J. Qadir, et al., Comparing oversampling techniques to handle the class imbalance problem: A customer churn prediction case study, IEEE Access, 4 (2016), 7940–7957. https://doi.org/10.1109/ACCESS.2016.2619719 doi: 10.1109/ACCESS.2016.2619719
    [31] I. V. Pustokhina, D. A. Pustokhin, P. T. Nguyen, M. Elhoseny, K. Shankar, Multi-objective rain optimization algorithm with WELM model for customer churn prediction in telecommunication sector, Complex Intell. Syst., 9 (2021), 3473–3485. https://doi.org/10.1007/s40747-021-00353-6 doi: 10.1007/s40747-021-00353-6
    [32] N. V. Chawla, Data mining for imbalanced datasets: An overview, In: Data mining and knowledge discovery handbook, Boston: Springer, 2009,875–886. https://doi.org/10.1007/978-0-387-09823-4_45
    [33] D.-C. Li, C.-S. Wu, T.-I. Tsai, Y.-S. Lina, Using mega-trend-diffusion and artificial samples in small data set learning for early flexible manufacturing system scheduling knowledge, Comput. Oper. Res., 34 (2007), 966–982. https://doi.org/10.1016/j.cor.2005.05.019 doi: 10.1016/j.cor.2005.05.019
    [34] H. He, Y. Bai, E. A. Garcia, S. Li, ADASYN: Adaptive synthetic sampling approach for imbalanced learning, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), 2008, 1322–1328. https://doi.org/10.1109/IJCNN.2008.4633969 doi: 10.1109/IJCNN.2008.4633969
    [35] H. Peng, F. Long, C. Ding, Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy, IEEE T. Pattern Anal. Mach. Intell., 27 (2005), 1226–1238. https://doi.org/10.1109/TPAMI.2005.159 doi: 10.1109/TPAMI.2005.159
    [36] S. Barua, M. M. Islam, X. Yao, K. Murase, MWMOTE--majority weighted minority oversampling technique for imbalanced data set learning, IEEE T. Knowl. Data Eng., 26 (2012), 405–425. https://doi.org/10.1109/TKDE.2012.232 doi: 10.1109/TKDE.2012.232
    [37] S. Mirjalili, A. Lewis, The whale optimization algorithm, Adv. Eng. Software, 95 (2016), 51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008 doi: 10.1016/j.advengsoft.2016.01.008
    [38] A. Shokouhifar, M. Shokouhifar, M. Sabbaghian, H. Soltanian-Zadeh, Swarm intelligence empowered three-stage ensemble deep learning for arm volume measurement in patients with lymphedema, Biomed. Signal Proc. Control, 85 (2023), 105027. https://doi.org/10.1016/j.bspc.2023.105027 doi: 10.1016/j.bspc.2023.105027
    [39] J. Pamina, B. Beschi Raja, S. Sathya Bama, M. Sruthi, S. Kiruthika, V. J. Aiswaryadevi, et al., An effective classifier for predicting churn in telecommunication, J. Adv Res. Dyn. Control Syst.s, 11 (2019), 221–229.
    [40] N. I. Mohammad, S. A. Ismail, M. N. Kama, O. M. Yusop, A. Azmi, Customer churn prediction in telecommunication industry using machine learning classifiers, Proceedings of the 3rd international conference on vision, image and signal processing, 2019, 34. https://doi.org/10.1145/3387168.3387219 doi: 10.1145/3387168.3387219
    [41] S. Agrawal, A. Das, A. Gaikwad, S. Dhage, Customer churn prediction modelling based on behavioral patterns analysis using deep learning, 2018 International Conference on Smart Computing and Electronic Enterprise (ICSCEE), 2018, 1–6. https://doi.org/10.1109/ICSCEE.2018.8538420 doi: 10.1109/ICSCEE.2018.8538420
    [42] A. Amin, F. Al-Obeidat, B. Shah, A. Adnan, J. Loo, S. Anwar, Customer churn prediction in telecommunication industry using data certainty, J. Bus. Res., 94 (2019), 290–301. https://doi.org/10.1016/j.jbusres.2018.03.003 doi: 10.1016/j.jbusres.2018.03.003
    [43] S. Momin, T. Bohra, P. Raut, Prediction of customer churn using machine learning, EAI International Conference on Big Data Innovation for Sustainable Cognitive Computing, 2020,203–212. https://doi.org/10.1007/978-3-030-19562-5_20 doi: 10.1007/978-3-030-19562-5_20
    [44] E. Hanif, Applications of data mining techniques for churn prediction and cross-selling in the telecommunications industry, Master thesis, Dublin Business School, 2019.
    [45] S. Wael Fujo, S. Subramanian, M. Ahmad Khder, Customer Churn Prediction in Telecommunication Industry Using Deep Learning, Inf. Sci. Lett., 11 (2022), 24–30. http://doi.org/10.18576/isl/110120 doi: 10.18576/isl/110120
    [46] V. Umayaparvathi, K. Iyakutti, Automated feature selection and churn prediction using deep learning models, Int. Res. J. Eng. Tech., 4 (2017), 1846–1854.
    [47] U. Ahmed, A. Khan, S. H. Khan, A. Basit, I. U. Haq, Y. S. Lee, Transfer learning and meta classification based deep churn prediction system for telecom industry, 2019. https://doi.org/10.48550/arXiv.1901.06091
    [48] A. De Caigny, K. Coussement, K. W. De Bock, A new hybrid classification algorithm for customer churn prediction based on logistic regression and decision trees, Eur. J. Oper. Res., 269 (2018), 760–772. https://doi.org/10.1016/j.ejor.2018.02.009 doi: 10.1016/j.ejor.2018.02.009
    [49] A. Idris, A. Khan, Y. S. Lee, Intelligent churn prediction in telecom: Employing mRMR feature selection and RotBoost based ensemble classification, Appl. Intell, 39 (2013), 659–672. https://doi.org/10.1007/s10489-013-0440-x doi: 10.1007/s10489-013-0440-x
    [50] W. Verbeke, K. Dejaeger, D. Martens, J. Hur, B. Baesens, New insights into churn prediction in the telecommunication sector: A profit driven data mining approach, Eur. J. Oper. Res., 218 (2012), 211–229. https://doi.org/10.1016/j.ejor.2011.09.031 doi: 10.1016/j.ejor.2011.09.031
    [51] Y. Xie, X. Li, E. Ngai, W. Ying, Customer churn prediction using improved balanced random forests, Expert Syst. Appl., 36 (2009), 5445–5449. https://doi.org/10.1016/j.eswa.2008.06.121 doi: 10.1016/j.eswa.2008.06.121
    [52] J.-W. Byun, A. Kamra, E. Bertino, N. Li, Efficient k-anonymization using clustering techniques, International Conference on Database Systems for Advanced Applications, DASFAA 2007, 2007,188–200. https://doi.org/10.1007/978-3-540-71703-4_18 doi: 10.1007/978-3-540-71703-4_18
    [53] A. P. Bradley, The use of the area under the ROC curve in the evaluation of machine learning algorithms, Pattern Recog., 30 (1997), 1145–1159. https://doi.org/10.1016/S0031-3203(96)00142-2 doi: 10.1016/S0031-3203(96)00142-2
  • This article has been cited by:

    1. Kalyan Manna, Vitaly Volpert, Malay Banerjee, Pattern Formation in a Three-Species Cyclic Competition Model, 2021, 83, 0092-8240, 10.1007/s11538-021-00886-4
    2. Min Lu, Chuang Xiang, Jicai Huang, Hao Wang, Bifurcations in the diffusive Bazykin model, 2022, 323, 00220396, 280, 10.1016/j.jde.2022.03.039
    3. Glenn Webb, Xinyue Evelyn Zhao, Bifurcation analysis of critical values for wound closure outcomes in wound healing experiments, 2023, 86, 0303-6812, 10.1007/s00285-023-01896-7
    4. Mengxin Chen, Pattern dynamics of a Lotka-Volterra model with taxis mechanism, 2025, 484, 00963003, 129017, 10.1016/j.amc.2024.129017
    5. Swadesh Pal, Roderick Melnik, Nonlocal Models in Biology and Life Sciences: Sources, Developments, and Applications, 2025, 15710645, 10.1016/j.plrev.2025.02.005
    6. Kalyan Manna, Swadesh Pal, Malay Banerjee, Effects of spatiotemporal, temporal and spatial nonlocal prey competitions on population distributions for a prey-predator system with generalist predation, 2025, 0, 1531-3492, 0, 10.3934/dcdsb.2025106
  • Reader Comments
  • © 2024 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(2301) PDF downloads(167) Cited by(3)

Figures and Tables

Figures(10)  /  Tables(10)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog