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

Federated and ensemble learning framework with optimized feature selection for heart disease detection

  • Received: 08 February 2025 Revised: 17 March 2025 Accepted: 24 March 2025 Published: 28 March 2025
  • MSC : 62H30, 68T05, 92C50, 68U35, 90C59

  • Predictive models for early identification of heart disease must be precise and efficient because it is a major worldwide health concern. To improve classification performance while protecting data privacy, this study investigated a combined method that uses ensemble learning, feature selection, and federated learning (FL). The ensemble-based approaches proved the most predictive after testing several different machine learning (ML) models, including random forests, the light gradient boosting machine, support vector machines, k-nearest neighbors, convolutional neural networks, and long short-term memory. We used particle swarm optimization (PSO) for feature selection, which optimized the most relevant features in conjunction with voting and stacking approaches to further increase the model's performance. In addition, federated learning was implemented to allow decentralized training while preserving sensitive medical data. The results highlight the effectiveness of combining these techniques in the detection of heart disease, providing a scalable and privacy-preserving solution for real-world healthcare applications. Two benchmark datasets were used to validate the proposed approach, ensuring the reliability and generalizability of the findings. Furthermore, we used four performance metrics, namely accuracy, precision, recall, and F1score, to evaluate the selected models. Finally, federated learning was included to handle privacy issues and guarantee safe access to private medical data. This distributed method allows model training without centralizing patient data, so it is compatible with strict data privacy rules. With up to 95% precision, our method shows a notable increase in prediction accuracy according to the testing results. This work offers a strong, scalable, and safe solution for the early identification of cardiovascular diseases by combining ensemble learning, feature selection, and federated learning, opening the way for more general uses in medical diagnostics.

    Citation: Olfa Hrizi, Karim Gasmi, Abdulrahman Alyami, Adel Alkhalil, Ibrahim Alrashdi, Ali Alqazzaz, Lassaad Ben Ammar, Manel Mrabet, Alameen E.M. Abdalrahman, Samia Yahyaoui. Federated and ensemble learning framework with optimized feature selection for heart disease detection[J]. AIMS Mathematics, 2025, 10(3): 7290-7318. doi: 10.3934/math.2025334

    Related Papers:

    [1] Ibrahim Al-Dayel, Sharief Deshmukh, Olga Belova . Characterizing non-totally geodesic spheres in a unit sphere. AIMS Mathematics, 2023, 8(9): 21359-21370. doi: 10.3934/math.20231088
    [2] Mohammed Guediri, Sharief Deshmukh . Hypersurfaces in a Euclidean space with a Killing vector field. AIMS Mathematics, 2024, 9(1): 1899-1910. doi: 10.3934/math.2024093
    [3] Hanan Alohali, Sharief Deshmukh . Some generic hypersurfaces in a Euclidean space. AIMS Mathematics, 2024, 9(6): 15008-15023. doi: 10.3934/math.2024727
    [4] Yanlin Li, Nasser Bin Turki, Sharief Deshmukh, Olga Belova . Euclidean hypersurfaces isometric to spheres. AIMS Mathematics, 2024, 9(10): 28306-28319. doi: 10.3934/math.20241373
    [5] Sharief Deshmukh, Mohammed Guediri . Some new characterizations of spheres and Euclidean spaces using conformal vector fields. AIMS Mathematics, 2024, 9(10): 28765-28777. doi: 10.3934/math.20241395
    [6] Sudhakar Kumar Chaubey, Meraj Ali Khan, Amna Salim Rashid Al Kaabi . N(κ)-paracontact metric manifolds admitting the Fischer-Marsden conjecture. AIMS Mathematics, 2024, 9(1): 2232-2243. doi: 10.3934/math.2024111
    [7] Sharief Deshmukh, Mohammed Guediri . Characterizations of Euclidean spheres. AIMS Mathematics, 2021, 6(7): 7733-7740. doi: 10.3934/math.2021449
    [8] Amira Ishan . On concurrent vector fields on Riemannian manifolds. AIMS Mathematics, 2023, 8(10): 25097-25103. doi: 10.3934/math.20231281
    [9] Yaning Wang, Yingdong Zhang . Jacobi-type vector fields on H3 and R3. AIMS Mathematics, 2021, 6(11): 11894-11903. doi: 10.3934/math.2021690
    [10] Amira Ishan, Sharief Deshmukh . Torse-forming vector fields on m -spheres. AIMS Mathematics, 2022, 7(2): 3056-3066. doi: 10.3934/math.2022169
  • Predictive models for early identification of heart disease must be precise and efficient because it is a major worldwide health concern. To improve classification performance while protecting data privacy, this study investigated a combined method that uses ensemble learning, feature selection, and federated learning (FL). The ensemble-based approaches proved the most predictive after testing several different machine learning (ML) models, including random forests, the light gradient boosting machine, support vector machines, k-nearest neighbors, convolutional neural networks, and long short-term memory. We used particle swarm optimization (PSO) for feature selection, which optimized the most relevant features in conjunction with voting and stacking approaches to further increase the model's performance. In addition, federated learning was implemented to allow decentralized training while preserving sensitive medical data. The results highlight the effectiveness of combining these techniques in the detection of heart disease, providing a scalable and privacy-preserving solution for real-world healthcare applications. Two benchmark datasets were used to validate the proposed approach, ensuring the reliability and generalizability of the findings. Furthermore, we used four performance metrics, namely accuracy, precision, recall, and F1score, to evaluate the selected models. Finally, federated learning was included to handle privacy issues and guarantee safe access to private medical data. This distributed method allows model training without centralizing patient data, so it is compatible with strict data privacy rules. With up to 95% precision, our method shows a notable increase in prediction accuracy according to the testing results. This work offers a strong, scalable, and safe solution for the early identification of cardiovascular diseases by combining ensemble learning, feature selection, and federated learning, opening the way for more general uses in medical diagnostics.



    The properties of differential inequalities are widely used in the study of dynamical systems and functional differential equations. In 1966, Halanay [1] first proved the following theorem:

    Theorem 1.1. Let z(t) be any nonnegative solution of

    z(t)az(t)+bsuptτstz(s),tt0,

    and a>b>0, then there exist two positive constants α,β>0 such that

    z(t)αeβ(tt0)fortt0.

    The above inequality is called the Halanay inequality. Due to wide applications in differential dynamic systems for Halanay inequality, many results have been obtained for Halanay inequality and its generalizations; see [2,3,4,5,6,7,8,9,10] and related references.

    In this paper, we focus on the study of differential inequalities (including Halanay inequalities) with delays on time scales. Let's briefly review the research on the above aspects. B. Ou et al. [11] proved the following theorem:

    Theorem 1.2. Let z(t) be any nonnegative solution of

    zΔ(t)a(t)z(t)+b(t)suptτ(t)stz(s)+c(t)0K(t,s)z(ts)Δs,tt0,z(s)=ϕ(s),s(,t0]T,

    where τ(t),a(t),b(t), and c(t) are rd-continuous and bounded functions, and K(t,s) is nonnegative and continuous. If the following conditions are satisfied:

    (1) 0K(t,s)eA(t,ts)Δs is uniformly bounded for tT.

    (2) There exist t1>t0,T>0 and ρ>0 such that for each nN,

    t1+nT+Tt1+nT[a(t)b+(t)c+(t)0K(t,s)Δs]>ρ,

    where A=suptT{|a(t)|,|b(t)|,|c(t)|,a(t)1μ(t)a(t)}. Then for each τ<1Aln(1B+ρAT),B=suptT0K(t,s)(eA(t,ts)1)Δs<ρAT, z(t) is exponentially stable, i.e., there exist α,β>0 (which may depend on the initial value), and such that

    z(t)αeβ(t,t0)fort[t0,).

    After that, they generalized the above results to the Halanay inequality on time scales with unbounded coefficients; see [12,13]. We can find more results for Halanay inequality on time scales in [14,15]. We have found that the methods used to study the Halanay inequality in existing literatures are mainly mathematical analysis methods, and we only found reference most [2] to study the Halanay inequality using the fixed point theorem. The fixed point theorem is one of the important methods for studying the main branches of mathematical problems, especially in the study of differential equations and dynamical systems. Researchers have obtained a large number of research results using the fixed point theorem, see [16,17,18,19,20]. In this paper, we will consider some delay inequalities by using the fixed point theorem. Our results improve and extend the existing results for Halanay inequality and its generalizations. The major contributions of this work are listed as follows:

    (1) Most existing results require the solutions and coefficients of Halanay inequalities to be non-negative; see [3,4,5,11,12]. In this paper, we will remove these limitations.

    (2) We develop the research scope of Halanay inequality. Specifically, we study Halanay inequality in more general cases, and the results obtained have wider applicability.

    (3) The research methods for the Halanay inequality on time scales are mostly mathematical analysis methods and time scale theory, see [11,12,13,14]. The research method of this article is the fixed point theorem. We obtained the properties of delay inequalities under broader conditions.

    The contents of this paper are organized as follows: Section 2 gives some preliminaries. Section 3 gives asymptotic behavior for differential inequalities with time-varying delay. Section 4 gives asymptotic behavior for differential inequalities with time-varying delay and distributed delay. In Section 5, some numerical examples are presented to illustrate the validity of the theoretical results. Finally, we conclude this paper.

    A time scale T is a closed subset of R. The means for the forward jump operator σ, backward jump operator ρ, regressive rd-continuous functions' set R and positive regressive rd-continuous functions' set R+ seen in [21]. The interval [a,b]T means [a,b]T. The intervals [a,b)T,(a,b)T, and (a,b]T are defined similarly. Crd([t0,)T represents the set of all rd-continuous functions on [t0,)T. The exponential function on T is defined by eα(t,s)=exp(tsξμ(r)(α(r))Δr), where

    ξμ(r)(α(r))={1μ(r)Log(1+μ(r)α(r)),μ(r)>0,α(r),μ(r)=0.

    Lemma 2.1. [21] Let α,βR. Then

    [1] e0(t,s)1 and eα(t,t)1;

    [2] eα(ρ(t),s)=(1μ(t)α(t))eα(t,s);

    [3] eα(t,s)=1eα(s,t)=eα(s,t), where α(t)=α(t)1+μ(t)α(t).

    [4] eα(t,s)eα(s,r)=eα(t,r);

    [5] eα(t,s)eβ(t,s)=eαβ(t,s).

    Lemma 2.2. [21] Suppose that yΔ=p(t)y+f(t) is regressive on a time scale T. Let t0T and y0R. The unique solution to the initial value problem

    yΔ=p(t)y+f(t),y(t0)=y0

    is given by

    y(t)=ep(t,t0)y0+tt0ep(t,σ(τ))f(τ)Δτ.

    Lemma 2.3. [21] Suppose that yΔ=p(t)y+f(t) is regressive on a time scale T. Let t0T and y0R. The unique solution of the initial value problem

    yΔ=p(t)yσ+f(t),y(t0)=y0

    is given by

    y(t)=ep(t,t0)y0+tt0ep(t,τ)f(τ)Δτ.

    Lemma 2.4. [22] For a nonnegative function ρ with ρR+, we have

    1tsρ(u)Δueρ(t,s)exp{tsρ(u)Δu}forallts.

    For a nonnegative function ρ with ρR+, we have

    1+tsρ(u)Δueρ(t,s)exp{tsρ(u)Δu}forallts.

    Remark 2.1. For ρR+ and ρ(r)>0 for r[s,t]T, we have

    eρ(t,r)eρ(t,s)andeρ(a,b)<1forsa<bt.

    An additive time scale is a time scale that is closed under addition. There exist many time scales that are not additive; we need the notion of shift operators to avoid additivity assumption on the time scale. In this paper, we will define the delay terms as using shift operators.

    Definition 2.1. [23] Let T be a non-empty subset of the time scale T and t0T a fixed number such that there exist operators δ±:[t0,)T×T satisfying the following properties:

    (1) The functions δ± are strictly increasing with respect to their second arguments;

    (2) if (T1,u),(T2,u)D with T1>T2, then δ(T1,u)<δ(T2,u); if (T1,u),(T2,u)D+ with T1>T2, then δ+(T1,u)>δ+(T2,u);

    (3) if t[t0,)T, then (t,t0)D+ and δ+(t,t0)=t; if tT, then (t,t0)D+ and δ+(t,t0)=t;

    (4) if (s,t)D±, then (s,δ±(s,t))D and δ(s,δ±(s,t))=t;

    (5) if (s,t)D± and (s,δ±(s,t))D, then (s,δ(u,t))D± and δ(u,δ±(s,t))=δ±(s,δ(u,t)).

    Then the operators δ and δ+ associated with t0T (called the initial point) are said to be backward and forward shift operators on the set T, respectively. For more details about shift operators and their applications, see [24,25,26,27].

    Consider the following generalized Halanay's inequality with time-varying delay:

    xΔ(t)a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t)),tt0,x(s)=x0,s[δ(ˆτ,t0),t0]T, (3.1)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t) and b(t) are rd-continuous on [t0,)T.

    Theorem 3.1. Assume that x(t) satisfies (3.1), a(t)0 with aR+, and there exists a constant γ1>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}|b(u)|Δuγ1<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Proof. Define the following delay dynamic system:

    xΔ(t)=a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t)),tt0,x(s)=x0,s[δ(ˆτ,t0),t0]T. (3.2)

    From (3.2) and Lemma 2.2, we obtain

    x(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu. (3.3)

    Define the space Ω1 by

    Ω1={x:xCrd([t0,)T,R),x(t)0ast}

    with the norm ||x||=supt[t0,)T|x(t)|. Then Ω1 is a Banach space. Define the operator Γ1:Ω1Ω1 by

    (Γ1x)(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu,tt0,(Γ1x)(s)=x0,s[δ(ˆτ,t0),t0]T. (3.4)

    Obviously, Γ1 is rd-continuous on [t0,)T. We first show that Γ1Ω1Ω1. From Lemma 2.4 and condition (ii), we have

    |ea(t,t0)x0|exp{tt0a(u)Δu}|x0|0ast. (3.5)

    Since x(t)0 as t, for any ε>0, there exists T1>0 such that

    |x(t)|<εfortT1. (3.6)

    From Lemma 2.4 and (3.6), we get

    |tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|=|T1t0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu+tT1ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|sup0sτ(t),t0uT1|x(δ(s,u))|T1t0exp{tσ(u)a(v)Δv}|b(u)|Δu+εtT1exp{tσ(u)a(v)Δv}|b(u)|Δu. (3.7)

    From (3.7) and condition (ⅱ), there exists T2T1, for any tT2 and ε>0 such that

    sup0sτ(t),t0uT1|x(δ(s,u))|T1t0exp{tσ(u)a(v)Δv}|b(u)|Δu<ε

    and

    tT1exp{tσ(u)a(v)Δv}|b(u)|Δu<ε.

    Thus,

    |tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|<εast. (3.8)

    Hence, in view of (3.4), (3.5), and (3.8), we obtain that |(Γ1x)(t)|0 as t and Γ1(Ω1)Ω1.

    For x,yΩ1, from condition (ⅰ), we have

    supv[t0,t]T|(Γx)(v)(Γy)(v)|supv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0ea(v,σ(u))|b(u)|Δusupv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0exp{vσ(u)a(s)Δs}|b(u)|Δuγ1supv[t0,t]T|x(v)y(v)|.

    Therefore, we obtain that Γ1 is a contraction mapping and has a unique fixed point x on Ω1, which is a solution of (3.2) with the initial condition x(s)=x0,s[δ(ˆτ,t0),t0]T.

    Next, we show that the zero solution of (3.1) is asymptotic stable. If x(t) is a solution of (3.2) with the initial condition x(s)=x0,s[δ(ˆτ,t0),t0]T. Since x(t)Ω1, then x(t) is bounded on tt0. From (3.5) and (3.8), for any ε>0, we have

    |x(t)|=|ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu||ea(t,t0)x0|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|0ast.

    Thus, system (3.2) is asymptotically stable which implies system (3.1) is asymptotically stable. The proof is complete.

    Theorem 3.2. Assume that x(t) satisfies (3.1). There exists f(t)0 with fR+ and there exists constant γ2>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}(|f(u)a(u)|+|b(u)|)Δuγ2<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    Proof. From (3.2) and Lemma 2.2, we obtain

    x(t)=ef(t,t0)x0+tt0ef(t,σ(u))[f(u)a(u)]Δu+tt0ef(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu. (3.9)

    Define a space Ω2 by

    Ω2={x:xCrd([t0,)T,R),x(t)0ast}

    with the norm ||x||=supt[t0,)T|x(t)|. Then Ω2 is a Banach space. Define the operator Γ2:Ω1Ω2 by

    (Γ2x)(t)=ef(t,t0)x0+tt0ef(t,σ(u))[f(u)a(u)]Δu+tt0ef(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu,tt0,(Γ2x)(s)=x0,s[δ(ˆτ,t0),t0]T. (3.10)

    Obviously, Γ2 is rd-continuous on [t0,)T. Similar to the proofs of (3.5) and (3.8), using Lemma 2.4 and condition (ii), we have

    |ef(t,t0)x0|exp{tt0f(u)Δu}|x0|0ast (3.11)

    and

    |tt0ea(t,σ(u))(f(u)a(u))Δu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|<εast. (3.12)

    Hence, in view of (3.10)–(3.12), we obtain that |(Γ2x)(t)|0 as t and Γ2(Ω2)Ω2.

    For x,yΩ2, from condition (ⅰ), we have

    supv[t0,t]T|(Γ2x)(v)(Γ2y)(v)|supv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0ea(v,σ(u))(|f(u)a(u)|+|b(u)|)Δusupv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0exp{vσ(u)a(s)Δs}(|f(u)a(u)|+|b(u)|)Δuγ2supv[t0,t]T|x(v)y(v)|.

    Therefore, we obtain that Γ2 is a contraction mapping and has a unique fixed point x on Ω2, which is a solution of (3.2) with the initial condition x(s)=x0,s[δ(ˆτ,t0),t0]T. Since x(t)Ω2, then x(t) is bounded on tt0. From (3.11) and (3.12), for any ε>0, we have

    |x(t)|=|ea(t,t0)x0+tt0ea(t,σ(u))[f(u)a(u)]Δu+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu||ea(t,t0)x0|+|tt0ea(t,σ(u))[f(u)a(u)]Δu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|0ast.

    Thus, system (3.2) is asymptotically stable which implies system (3.1) is asymptotically stable. The proof is complete.

    Remark 3.1. Theorem 3.2 removes the condition of non-negativity of coefficient a(t); therefore, the results of Theorem 3.2 improve the corresponding ones of Theorem 3.1.

    Consider the following generalized Halanay's inequality with time-varying delay:

    xΔ(t)a(t)x(σ(t))+b(t)sup0sτ(t)x(δ(s,t)),tt0,x(s)=x0,s[δ(ˆτ,t0),t0]T, (3.13)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t) and b(t) are rd-continuous on [t0,)T. Based on Lemma 2.3 and Theorems 3.1 and 3.2, we have the following two corollaries:

    Corollary 3.1. Assume that x(t) satisfies (3.13), a(t)0 with aR+, and there exists a constant γ3>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}|b(u)|Δuγ3<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Corollary 3.2. Assume that x(t) satisfies (3.13). There exists f(t)0 with fR+ and there exists a constant γ4>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}(|f(u)a(u)|+|b(u)|)Δuγ4<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    Consider the following generalization of Halanay's inequality with mixed delays:

    xΔ(t)a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t))+c(t)0K(s)x(δ(s,t))Δs,tt0,x(s)=x0,s(,t0]T, (4.1)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t),b(t), and c(t) are rd-continuous on [t0,)T, and K(t) is rd-continuous on [0,)T.

    Theorem 4.1. Assume that x(t) satisfies (4.1), a(t)0 with aR+,0|K(s)|Δs< and there exists a constant γ5>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}(|b(u)+|c(u)|0|K(s)|Δs)Δuγ5<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Proof. Define the following delay dynamic system:

    xΔ(t)=a(t)x(t)+b(t)sup0sτ(t)x(δ(s,t))+c(t)0K(s)x(δ(s,t))Δs,tt0,x(s)=x0,s(,t0]T. (4.2)

    From (4.2) and Lemma 2.2, we obtain

    x(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu+tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu. (4.3)

    Define a space Ω3 by

    Ω3={x:xCrd([t0,)T,R),x(t)0ast}

    with the norm ||x||=supt[t0,)T|x(t)|. Then Ω3 is a Banach space. Define the operator Γ3:Ω3Ω3 by

    (Γ3x)(t)=ea(t,t0)x0+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu+tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu,tt0,(Γ3x)(s)=x0,s(,t0]T. (4.4)

    Obviously, Γ3 is rd-continuous on [t0,)T. Similar to the proofs of (3.5) and (3.8), using Lemma 2.4 and condition (ii), we have

    |ea(t,t0)x0|exp{tt0a(u)Δu}|x0|0ast (4.5)

    and

    |tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|<εast. (4.6)

    Hence, in view of (4.4)–(4.6), we obtain that |(Γ3x)(t)|0 as t and Γ3(Ω3)Ω3.

    For x,yΩ2, from condition (ⅰ), we have

    supv[t0,t]T|(Γ2x)(v)(Γ2y)(v)|supv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0ea(v,σ(u))(|b(u)|+|c(u)|0|K(s)|Δs)Δusupv[t0,t]T|x(v)y(v)|×supv[0,t]Tvt0exp{vσ(u)a(s)Δs}(|b(u)|+|c(u)|0|K(s)|Δs)Δuγ5supv[t0,t]T|x(v)y(v)|.

    Therefore, we obtain that Γ3 is a contraction mapping and has a unique fixed point x on Ω3, which is a solution of (4.2) with the initial condition x(s)=x0,s(,t0]T. Since x(t)Ω3, then x(t) is bounded on tt0. From (4.5) and (4.6), for any ε>0, we have

    |x(t)|=|ea(t,t0)x0+tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu+tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu||ea(t,t0)x0|+|tt0ea(t,σ(u))c(u)0K(s)x(δ(s,u))ΔsΔu|+|tt0ea(t,σ(u))b(u)sup0sτ(t)x(δ(s,u))Δu|0ast.

    Thus, system (4.2) is asymptotically stable which implies system (4.1) is asymptotically stable. The proof is complete.

    In order to remove the nonnegative limitation of coefficient a(t) in Theorem 4.1, we provide the following theorem:

    Theorem 4.2. Assume that x(t) satisfies (4.1). There exists f(t)0 with fR+ and there exists constant γ6>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vσ(u)a(s)Δs}(|f(u)a(u)|+|b(u)|+|c(u)|0|K(s)|Δs)Δuγ6<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    The proof of Theorem 4.2 is the same as that of Theorem 3.2; we omit it. Furthermore, consider the following generalized Halanay's inequality with mixed delays:

    xΔ(t)a(t)x(σ(t))+b(t)sup0sτ(t)x(δ(s,t))+c(t)0K(s)x(δ(s,t))Δs,tt0,x(s)=x0,s(,t0]T, (4.7)

    where δ(s,t) is backward shift operator, tT,x0R,τ(t)0 is rd-continuous and bounded function with τ(t)ˆτ,ˆτ is a constant, a(t),b(t), and c(t) are rd-continuous on [t0,)T, and K(t) is rd-continuous on [0,)T. Based on Lemma 2.3 and Theorems 4.1 and 4.2, we have the following two corollaries.

    Corollary 4.1. Assume that x(t) satisfies (4.7), a(t)0 with aR+, and there exists a constant γ7>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}(|b(u)+|c(u)|0|K(s)|Δs)Δuγ7<1;

    (ⅱ) exp{tt0a(u)Δu} as t.

    Then x(t)0 as t.

    Corollary 4.2. Assume that x(t) satisfies (4.7). There exists f(t)0 with fR+ and there exists constant γ8>0 such that, for tt0,

    (ⅰ)

    supv[t0,t]Tvt0exp{vua(s)Δs}(|f(u)a(u)|+|b(u)|+|c(u)|0|K(s)|Δs)Δuγ8<1;

    (ⅱ) exp{tt0f(u)Δu} as t.

    Then x(t)0 as t.

    Remark 4.1. In this paper, we mainly use the Banach contraction mapping principle to study the asymptotic stability of the trajectories governed by some delay differential inequalities on time scales. In fact, we can use Schauder's fixed point theorem to establish the existence of at least one solution for the considered systems (see [28]); we can also use Leggett Williams fixed point theorem to investigate the existence of three solutions to considered systems, see [29]. We hope that more results from systems (3.1) and (4.1) can be obtained in future work.

    Remark 4.2. We give the advantages of this paper as follows:

    (1) Since many time scales that are not additive, we define the delay terms as using shift operators.

    (2) We extend the research scope and develop research methods for Halanay inequality.

    (3) The research method of this article can study various types of Halanay inequalities, such as Halanay inequality with impulsive terms and Halanay inequality with stochastic terms.

    Example 5.1. When T=Z, consider the following system:

    Δx(k)a(k)x(k)+b(k)sup0sτ(k)x(ks),k0,kZ, (5.1)

    where

    Δx(k)=x(k+1)x(k),a(k)=10.5sin(2k+1.5),b(k)=0.2k+1,τ(k)=30.5cosk.

    Choosing γ1=0.26<1, we have

    supv[0,t]Zv0exp{vσ(u)a(s)Δs}|b(u)|Δu<0.26<1

    and exp{t0a(u)Δu} as t.

    One can see that all conditions of Theorem 3.1 hold. Hence, system (5.1) is asymptotically stable. Figure 1 shows the trajectory of the solution to the system (5.1).

    Figure 1.  The state's trajectory of the system (5.1).

    Example 5.2. When T=Z, consider the following system:

    Δx(k)a(k)x(k)+b(k)sup0sτ(k)x(ks)+c(k)i=0K(i)x(ki),k0,kZ, (5.2)

    where

    Δx(k)=x(k+1)x(k),a(k)=30.2sin(3k+0.5),b(k)=0.4k+1,
    c(k)=(116)k+1,τ(k)=4cosk,K(i)=0.6i+1.

    Choosing γ2=0.86, we have

    supv[0,t]Zv0exp{vσ(u)a(s)Δs}(|b(u)+|c(u)|0|K(s)|Δs)Δu<0.86<1

    and exp{t0a(u)Δu} as t.

    One can see that all conditions of Theorem 4.1 hold. Hence, system (5.2) is asymptotically stable. Figure 2 shows the trajectory of the solution to the system (5.2).

    Figure 2.  The state's trajectory of the system (5.2).

    In this work, some novel asymptotical stability results for delay differential inequalities on time scales have been derived by using time scale theory and the fixed point theorem. Our results do not require the system coefficients to be non-negative but extend the corresponding results of [7,8,9]. It should be pointed out that the use of the fixed point theorem makes the proof process easier to understand. At last, two examples with numerical simulations have been presented to illustrate the effectiveness of our results. In the future, we will study delay differential inequalities with a neutral-type operator on time scales.

    Bingxian Wang: Writing-original draft preparation, Writing-review and editing; Mei Xu: Formal analysis, Methodology. All authors have read and agreed to the published version of the manuscript.

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

    The authors would like to thank the referees for their very professional comments and helpful suggestions.

    The authors confirm that they have no conflict of interest in this paper.



    [1] S. Mendis, I. Graham, J. Narula, Addressing the global burden of cardiovascular diseases; need for scalable and sustainable frameworks, Glob. Heart, 17 (2022), 48. https://doi.org/10.5334/gh.1139 doi: 10.5334/gh.1139
    [2] A. Ala, A. Goli, Incorporating machine learning and optimization techniques for assigning patients to operating rooms by considering fairness policies, Eng. Appl. Artif. Intell., 136 (2024), 108980. https://doi.org/10.1016/j.engappai.2024.108980 doi: 10.1016/j.engappai.2024.108980
    [3] N. Chaithra, B. Madhu, Classification models on cardiovascular disease prediction using data mining techniques, J. Cardiovas. Dis. Diagn., 6 (2018), 10000348. https://doi.org/10.4172/2329-9517.1000348 doi: 10.4172/2329-9517.1000348
    [4] K. W. Johnson, J. T. Soto, B. S. Glicksberg, K. Shameer, R. Miotto, M. Ali, et al., Artificial intelligence in cardiology, JACC, 71 (2018), 2668–2679.
    [5] S. Kodati, R. Vivekanandam, Analysis of heart disease using in data mining tools orange and weka, Glob. J. Comput. Sci. Technol., 18 (2018), 16–22.
    [6] K. S. Shalet, V. Sabarinathan, V. Sugumaran, V. J. S. Kumar, Diagnosis of heart disease using decision tree and svm classifier, Int. J. Appl. Eng. Res., 10 (2015), 598–602.
    [7] K. Uyar, A. ˙Ilhan, Diagnosis of heart disease using genetic algorithm based trained recurrent fuzzy neural networks, Procedia Comput. Sci., 120 (2017), 588–593. https://doi.org/10.1016/j.procs.2017.11.283 doi: 10.1016/j.procs.2017.11.283
    [8] S. Khader Basha, D. Roja, S. Santhj Priya, L. Dalavi, S. Srinivas Vellela, V. Reddy, Coronary heart disease prediction and classification using hybrid machine learning algorithms, In: 2023 International Conference on Innovative Data Communication Technologies and Application (ICIDCA), IEEE, 2023. https://doi.org/10.1109/ICIDCA56705.2023.10099579
    [9] R. Jahed, O. Asser, A. Al-Mousa, Using personal key indicators and machine learning-based classifiers for the prediction of heart disease, In: 2023 International Conference on Smart Computing and Application (ICSCA), IEEE, 2023. https://doi.org/10.1109/ICSCA57840.2023.10087430
    [10] A. Rajdhan, A. Agarwal, M. Sai, D. Ravi, P. Ghuli, Heart disease prediction using machine learning, Int. J. Res. Technol., 9 (2020), 659–662.
    [11] C. Das, C. Das, M. Hossain, A. Rahman, H. Hossen, R. Hasan, Heart disease detection using ml, In: 2023 IEEE 13th Annual Computing and Communication Workshop and Conference (CCWC), IEEE, 2023. https://doi.org/10.1109/CCWC57344.2023.10099294
    [12] K. Pytlak, Indicators of heart disease (2022 update), 2022. Available from: https://www.kaggle.com/datasets/kamilpytlak/personal-key-indicators-of-heart-disease.
    [13] S. Chopra, N. Karla, R. Rani, Identification of cardiovascular disease using machine learning and ensemble learning, In: 2023 International Conference on Innovative Data Communication Technologies and Application (ICIDCA), IEEE, 2023. https://doi.org/10.1109/ICIDCA56705.2023.10099508
    [14] Z. Li, D. Zhou, L. Wan, J. Li, W. Mou, Heartbeat classification using deep residual convolutional neural network from 2-lead electrocardiogram, J. Electrocardiol., 58 (2020), 105–112. https://doi.org/10.1016/j.jelectrocard.2019.11.046 doi: 10.1016/j.jelectrocard.2019.11.046
    [15] L. B. Marinho, N. de MM Nascimento, J. W. M. Souza, M. V. Gurgel, P. P. R. Filho, V. H. C. de Albuquerque, A novel electrocardiogram feature extraction approach for cardiac arrhythmia classification, Future Gener. Comput. Syst., 97 (2019), 564–577. https://doi.org/10.1016/j.future.2019.03.025 doi: 10.1016/j.future.2019.03.025
    [16] S. Pandya, T. Gadekallu, P. Reddy, W. Wang, M. Alazab, Infusedheart: A novel knowledge-infused learning framework for diagnosis of cardiovascular events, IEEE Trans. Comput. Soc. Syst., 9 (2022), 1778–1788. https://doi.org/10.1109/TCSS.2022.3151643 doi: 10.1109/TCSS.2022.3151643
    [17] S. Mohan, C. Thirumalai, G. Srivastava, Effective heart disease prediction using hybrid machine learning techniques, IEEE Access, 7 (2019), 81542–81554. https://doi.org/10.1109/ACCESS.2019.2923707 doi: 10.1109/ACCESS.2019.2923707
    [18] R. Arun, N. Deepa, Heart disease prediction system using naive bayes, Int. J. Pure Appl. Math., 119 (2018), 3053–3065.
    [19] K. Prasanna, N. Challa, J. Nagaraju, Heart disease prediction using reinforcement learning technique, In: 2023 Third International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT), IEEE, 2023. https://doi.org/10.1109/ICAECT57570.2023.10118232
    [20] S. Bagavathy, V. Gomathy, S. S. Rani, M. Murugesan, K. Sujatha, M. K. Bhuvana, Early heart disease detection using data mining techniques with hadoop map reduce, Int. J. Pure Appl. Math., 119 (2018), 1915–1920.
    [21] A. Abdellatif, H. Abdellatef, J. Kanesan, C. O. Chow, J. H. Chuah, H. M. Gheni, An effective heart disease detection and severity level classification model using machine learning and hyperparameter optimization methods, IEEE Access, 10 (2022), 79974–79985. https://doi.org/10.1109/ACCESS.2022.3191669 doi: 10.1109/ACCESS.2022.3191669
    [22] H. Ramesh, R. Pathinarupothi, Performance analysis of machine learning algorithms to predict cardiovascular disease, In: 2023 IEEE 8th International Conference for Convergence in Technology (I2CT), IEEE, 2023. https://doi.org/10.1109/I2CT57861.2023.10126428
    [23] M. Shail, R. Sreeja, S. Zainab, P. S. Sowmya, T. Akshay, S. Sindhu, Improving accuracy of heart disease prediction through machine learning algorithms, In: 2023 International Conference on Innovative Data Communication Technologies and Application (ICIDCA), IEEE, 2023. https://doi.org/10.1109/ICIDCA56705.2023.10100244
    [24] L. Ali, A. Niamat, J. Khan, N. A. Golilarz, X. Xiong, A. Noor, et al., An optimized stacked support vector machines based expert system for the effective prediction of heart failure, IEEE Access, 7 (2019), 54007–54014. https://doi.org/10.1109/ACCESS.2019.2909969 doi: 10.1109/ACCESS.2019.2909969
    [25] T. Mahmud, A. Barua, M. Begum, E. Chakma, S. Das, N. Sharmen, An improved framework for reliable cardiovascular disease prediction using hybrid ensemble learning, In: 2023 International Conference on Electrical, Computer and Communication Engineering (ECCE), IEEE, 2023. https://doi.org/10.1109/ECCE57851.2023.10101564
    [26] B. Tama, S. Im, S. Lee, Improving an intelligent detection system for coronary heart disease using a two-tier classifier ensemble, Biomed Res. Int., 2020 (2020), 9816142. https://doi.org/10.1155/2020/9816142 doi: 10.1155/2020/9816142
    [27] O. Yildirim, A novel wavelet sequence based on a deep bidirectional lstm network model for ecg signal classification, Comput. Biol. Med., 96 (2018), 189–202. https://doi.org/10.1016/j.compbiomed.2018.03.016 doi: 10.1016/j.compbiomed.2018.03.016
    [28] N. Fitriyani, M. Syafrudin, G. Alfian, J. Rhee, Hdpm: An effective heart disease prediction model for a clinical decision support system, IEEE Access, 8 (2020), 133034–133050. https://doi.org/10.1109/ACCESS.2020.3010511 doi: 10.1109/ACCESS.2020.3010511
    [29] D. Shah, S. Patel, S. K. Bharti, Heart disease prediction using machine learning techniques, SN Comput. Sci., 1 (2020), 345. https://doi.org/10.1007/s42979-020-00365-y doi: 10.1007/s42979-020-00365-y
    [30] A. Jain, K. Kumar, R. Tiwari, N. Jain, V. Gautam, N. K. Trivedi, Machine learning-based detection of cardiovascular disease using classification and feature selection, In: 2023 IEEE 12th International Conference on Communication Systems and Network Technologies (CSNT), IEEE, 2023. https://doi.org/10.1109/CSNT57126.2023.10134672
    [31] A. Shukla, I. Khan, V. Sharma, M. Soni, S. Gupta, A. Kumar, A novel prediction system to diagnose heart disease, In: 2023 International Conference on Inventive Computation Technologies (ICICT), IEEE, 2023. https://doi.org/10.1109/ICICT57646.2023.10133988
    [32] G. Bathla, P. Singh, R. Singh, E. Cambria, R. Tiwari, Intelligent fake reviews detection based on aspect extraction and analysis using deep learning, Neural Comput. Appl., 34 (2022), 20213–20229. https://doi.org/10.1007/s00521-022-07531-8 doi: 10.1007/s00521-022-07531-8
    [33] G. Varshini, A. Ramya, C. Sravya, V. Kumar, B. K. Shukla, Improving heart disease prediction of classifiers with data transformation using pca and relief feature selection, In: 2023 Second International Conference on Electronics and Renewable Systems (ICEARS), IEEE, 2023. https://doi.org/10.1109/ICEARS56392.2023.10085401
    [34] G. Saranya, A. Pravin, A comprehensive study on disease risk predictions in machine learning, Int. J. Elect. Comput. Eng., 10 (2020), 4217–4225. https://doi.org/10.11591/ijece.v10i4.pp4217-4225 doi: 10.11591/ijece.v10i4.pp4217-4225
    [35] M. Singh, L. M. Martins, P. Joanis, V. K. Mago, Building a cardiovascular disease predictive model using structural equation model & fuzzy cognitive map, In: International Conference on Fuzzy Systems (FUZZ), IEEE, 2016, 1377–1382. https://doi.org/10.1109/FUZZ-IEEE.2016.7737850
    [36] K. Sen, B. Verma, Heart disease prediction using a soft voting ensemble of gradient boosting models, randomforest, and gaussian naive bayes, In: 2023 4th International Conference for Emerging Technology (INCET), IEEE, 2023. https://doi.org/10.1109/INCET57972.2023.10170399
    [37] K. Gola, S. Arya, Satin bowerbird optimization-based classification model for heart disease prediction using deep learning in e-healthcare, In: 2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing Workshops (CCGridW), IEEE, 2023. https://doi.org/10.1109/CCGridW59191.2023.00063
    [38] J. Patel, T. Upadhyay, S. Patel, Heart disease prediction using machine learning and data mining technique, IJCSC, 7 (2015), 129–137.
    [39] A. Pandita, S. Yadav, S. Vashisht, A. Tyagi, Review paper on prediction of heart disease using machine learning algorithms, Int. J. Res. Appl. Sci. Eng. Technol., 9 (2021).
    [40] A. Akella, S. Akella, Machine learning algorithms for predicting coronary artery disease: efforts toward an open-source solution, Future Sci. OA, 7 (2021), FSO698.
    [41] A. Ala, V. Simic, D. Pamucar, N. Bacanin, Enhancing patient information performance in internet of things-based smart healthcare system: Hybrid artificial intelligence and optimization approaches, Eng. Appl. Artif. Intell., 131 (2024), 107889. https://doi.org/10.1016/j.engappai.2024.107889 doi: 10.1016/j.engappai.2024.107889
    [42] M. Nazari, H. Emami, R. Rabiei, A. Hosseini, S. Rahmatizadeh, Detection of cardiovascular diseases using data mining approaches: Application of an ensemble-based model, Cogn. Comput., 16 (2024), 2264–-2278. https://doi.org/10.1007/s12559-024-10306-z doi: 10.1007/s12559-024-10306-z
    [43] S. Mokeddem, B. Atmani, M. Mokaddem, Supervised feature selection for diagnosis of coronary artery disease based on genetic algorithm, preprint paper, 2013. https://doi.org/10.48550/arXiv.1305.6046
    [44] J. C. T. Arroyo, A. J. P. Delima, An optimized neural network using genetic algorithm for cardiovascular disease prediction, J. Adv. Inf. Technol., 13 (2022), 95–99. https://doi.org/10.12720/jait.13.1.95-99 doi: 10.12720/jait.13.1.95-99
  • Reader Comments
  • © 2025 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(591) PDF downloads(36) Cited by(0)

Figures and Tables

Figures(1)  /  Tables(7)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog