
The k-means algorithm aims at minimizing the variance within clusters without considering the balance of cluster sizes. Balanced k-means defines the partition as a pairing problem that enforces the cluster sizes to be strictly balanced, but the resulting algorithm is impractically slow O(n3). Regularized k-means addresses the problem using a regularization term including a balance parameter. It works reasonably well when the balance of the cluster sizes is a mandatory requirement but does not generalize well for soft balance requirements. In this paper, we revisit the k-means algorithm as a two-objective optimization problem with two goals contradicting each other: to minimize the variance within clusters and to minimize the difference in cluster sizes. The proposed algorithm implements a balance-driven variant of k-means which initially only focuses on minimizing the variance but adds more weight to the balance constraint in each iteration. The resulting balance degree is not determined by a control parameter that has to be tuned, but by the point of termination which can be precisely specified by a balance criterion.
Citation: Rieke de Maeyer, Sami Sieranoja, Pasi Fränti. Balanced k-means revisited[J]. Applied Computing and Intelligence, 2023, 3(2): 145-179. doi: 10.3934/aci.2023008
[1] | Pratap Anbalagan, Evren Hincal, Raja Ramachandran, Dumitru Baleanu, Jinde Cao, Michal Niezabitowski . A Razumikhin approach to stability and synchronization criteria for fractional order time delayed gene regulatory networks. AIMS Mathematics, 2021, 6(5): 4526-4555. doi: 10.3934/math.2021268 |
[2] | Hongguang Fan, Jihong Zhu, Hui Wen . Comparison principle and synchronization analysis of fractional-order complex networks with parameter uncertainties and multiple time delays. AIMS Mathematics, 2022, 7(7): 12981-12999. doi: 10.3934/math.2022719 |
[3] | Yang Xu, Zhouping Yin, Yuanzhi Wang, Qi Liu, Anwarud Din . Mittag-Leffler projective synchronization of uncertain fractional-order fuzzy complex valued neural networks with distributed and time-varying delays. AIMS Mathematics, 2024, 9(9): 25577-25602. doi: 10.3934/math.20241249 |
[4] | Chengbo Yi, Rui Guo, Jiayi Cai, Xiaohu Yan . Pinning synchronization of dynamical neural networks with hybrid delays via event-triggered impulsive control. AIMS Mathematics, 2023, 8(10): 25060-25078. doi: 10.3934/math.20231279 |
[5] | Yuehong Zhang, Zhiying Li, Wangdong Jiang, Wei Liu . The stability of anti-periodic solutions for fractional-order inertial BAM neural networks with time-delays. AIMS Mathematics, 2023, 8(3): 6176-6190. doi: 10.3934/math.2023312 |
[6] | Jiaqing Zhu, Guodong Zhang, Leimin Wang . Quasi-projective and finite-time synchronization of fractional-order memristive complex-valued delay neural networks via hybrid control. AIMS Mathematics, 2024, 9(3): 7627-7644. doi: 10.3934/math.2024370 |
[7] | Dan-Ning Xu, Zhi-Ying Li . Mittag-Leffler stabilization of anti-periodic solutions for fractional-order neural networks with time-varying delays. AIMS Mathematics, 2023, 8(1): 1610-1619. doi: 10.3934/math.2023081 |
[8] | Minghung Lin, Yiyou Hou, Maryam A. Al-Towailb, Hassan Saberi-Nik . The global attractive sets and synchronization of a fractional-order complex dynamical system. AIMS Mathematics, 2023, 8(2): 3523-3541. doi: 10.3934/math.2023179 |
[9] | Hongmei Zhang, Xiangnian Yin, Hai Zhang, Weiwei Zhang . New criteria on global Mittag-Leffler synchronization for Caputo-type delayed Cohen-Grossberg Inertial Neural Networks. AIMS Mathematics, 2023, 8(12): 29239-29259. doi: 10.3934/math.20231497 |
[10] | Jingfeng Wang, Chuanzhi Bai . Global Mittag-Leffler stability of Caputo fractional-order fuzzy inertial neural networks with delay. AIMS Mathematics, 2023, 8(10): 22538-22552. doi: 10.3934/math.20231148 |
The k-means algorithm aims at minimizing the variance within clusters without considering the balance of cluster sizes. Balanced k-means defines the partition as a pairing problem that enforces the cluster sizes to be strictly balanced, but the resulting algorithm is impractically slow O(n3). Regularized k-means addresses the problem using a regularization term including a balance parameter. It works reasonably well when the balance of the cluster sizes is a mandatory requirement but does not generalize well for soft balance requirements. In this paper, we revisit the k-means algorithm as a two-objective optimization problem with two goals contradicting each other: to minimize the variance within clusters and to minimize the difference in cluster sizes. The proposed algorithm implements a balance-driven variant of k-means which initially only focuses on minimizing the variance but adds more weight to the balance constraint in each iteration. The resulting balance degree is not determined by a control parameter that has to be tuned, but by the point of termination which can be precisely specified by a balance criterion.
Recently, the interest of researchers to fractional-order models is greatly increased because of their numerous opportunities for applications in population dynamics [1,2,3,4], bioengineering and neuroscience [5,6,7,8], economics [9,10], and in general, in every area of science, engineering and technology [11,12,13,14,15]. Indeed, fractional differentiation provides neurons with a fundamental and general computation ability that can contribute to efficient information processing, stimulus anticipation and frequency-independent phase shifts of oscillatory neuronal firing [6].
The advantages of fractional-order derivatives have generated much recent interest to the study of fractional neural networks and have resulted in a large amount of papers devoted to the dynamical properties of such networks. See, for example, [16,17,18,19,20,21,22] and the references therein. The numerous applications of fractional-order neural networks to solve optimization, associative memory, pattern recognition and computer vision problems heavily depend on the dynamic behavior of networks; therefore, the qualitative analysis of these dynamic behaviors is an essential step in the workable design of such neural networks. It is worth mentioning that most of the existing studies on delayed fractional-order neural network models considered bounded delays. However, the corresponding investigations on fractional-order delayed neural networks with distributed delays are relatively less. In addition, to the best of our knowledge, unbounded delays are not examined in the existing literature.This interesting open problem is one of the motivations of our study.
The control theory of systems is an important part of their qualitative theory. Among the numerous excellent results on control methods in the literature, we will refer to [23], where a very good comprehensive discussion on several important for neural network models control strategies is given. Recently, the type of control called Impulsive Control, attracts the attention of researchers. This type of control arises naturally in a wide variety of applications and it allows the control action only at some discrete instances which may reduce the amount of information to be transmitted and increase the robustness against the disturbance, see [24,25,26,27,28,29,30,31,32,33]. The impulsive control strategies are also applied to some fractional-order neural networks [34,35,36,37,38]. However, there are still many challenging open questions in this direction. The stability behavior of fractional neural networks with unbounded delays under an impulsive control is not investigated previously, which is the next motivation for the present paper.
On the other side, the concept of Mittag-Leffler stability for fractional-order systems has been introduced in [39]. The importance of the notion lies in the fact that it generalizes the exponential stability concept to the fractional-order case. Since, for integer-order neural network models the exponential convergence is the most desirable behavior, the Mittag-Leffler stability notion of fractional-order systems received a great deal of interest among scientists [35,36,37,39,40,41,42]. However, the concept has not been applied to fractional-order neural networks with unbounded delays, and we plan to fill the gap. The contribution of our paper is in following aspects:
1. Unbounded delays are introduced intro a fractional-order neural network model, and their effects on the qualitative behavior of the solutions are examined.
2. An impulsive control approach is applied to achieve a synchronization between fractional neural networks with mixed bounded and unbounded delays.
3. The concept of global Mittag-Leffler synchronization is adapted to fractional neural network models with mixed delays under impulsive control.
4. New global Mittag-Leffler synchronization criteria are established for the model under consideration.
The rest of the paper is structured as follows. In Section 2, we introduce our fractional-order neural network model with bounded and unbounded delays. The corresponding impulsive control strategy and the impulsive control system are also developed. The concept of global Mittag-Leffler synchronization is proposed for the fractional-order master and controlled systems. Some basic fractional Lyapunov function method nomenclatures and lemmas are presented. In Section 3, by using the fractional Lyapunov method and designing an appropriate impulsive controller, we obtain two main global Mittag-Leffler synchronization criteria. The synchronization results can be easily applied to the stability analysis of such systems. Our results generalize and complement some existing results on integer-order and fractional-order neural networks. Two examples are given to illustrate the efficiency of the results established in Section 4. The conclusion is given in Section 5.
In this paper we will use the standard notation Rn for the n-dimensional Euclidean space. Let ||x||=n∑i=1|xi| denote the norm of x∈Rn, R+=[0,∞), t0∈R+, and let Γ denotes the Gamma function.
Consider a q, 0<q<1. Following [14], the Caputo fractional derivative of order q for a function g∈C1[[t0,b],R], b>t0, is given as
Ct0Dqtg(t)=1Γ(1−q)∫tt0g′(ξ)(t−ξ)qdξ, t≥t0. |
Since distributed and unbounded delays are more realistic, in this research we will consider the following fractional-order neural network with bounded and unbounded delays
{Ct0Dqtxi(t)=−di(t)xi(t)+n∑j=1aijfj(xj(t))+n∑j=1bijfj(xj(t−τj(t)))+n∑j=1cij∫t−∞Kj(t,s)fj(xj(s))ds+Ii, t≥t0, | (2.1) |
where i=1,2,...,n, x(t)=(x1(t),x2(t),...,xn(t))T and xi(t) is the state of ith neuron at time t, fj(xj(t)) denotes the activation function of the jth unit at time t, aij, bij, cij denote the interconnection strength representing the weight coefficient of the neurons, di(t) is a continuous function that represents the self-feedback connection weight of the ith unit at time t, di(t)>0, t≥t0, the bounded time delays τj(t) are such that 0≤τj(t)≤τ, Ii is the external input on the ith neuron, the delay kernel Kj(t,s)=Kj(t−s), (j=1,2,...,n) is of convolution type with an initial condition
x(s)=ˉφ0(s), s∈(−∞,0], ˉφ0∈C[(−∞,0],Rn]. |
The main objective in this paper is to control the stability behavior of the fractional-order network (2.1) by adding an impulsive controller to its nodes such that the trajectories of all nodes can be synchronized onto that of system (2.1).
Let the points
0=t0<t1<t2<...<tk<... |
are such that limk→∞tk=∞, and let the functions Pik are defined on R for any i=1,2,...,n and k=1,2,....
Now we consider the corresponding fractional impulsive control system
{Ct0Dqtyi(t)=−di(t)yi(t)+n∑j=1aijfj(yj(t))+n∑j=1bijfj(yj(t−τj(t)))+n∑j=1cij∫t−∞Kj(t,s)fj(yj(s))ds+Ii, t≠tk, t≥t0,Δyi(tk)=yi(t+k)−yi(tk)=Pik(yi(tk)), k=1,2,..., | (2.2) |
where tk, k=1,2,... are the impulsive control instants and the numbers yi(tk)=yi(t−k) and yi(t+k) are, respectively, the states of the ith unit before and after an impulse input at the moment tk. The functions Pik are the impulsive functions that measure the rate of changes of the states yi(t) at the impulsive moments tk.
The impulsive control model (2.2) generalizes many existing fractional-order neural network systems with bounded and distributed delays [15,36], as well as integer-order neural networks to the fractional-order case. See, for example, [25,26,27,28,29,30,31,32,33] and the references therein. By means of appropriate impulsive functions Pik we can impulsively control the qualitative behavior of the states of type (2.1) fractional models.
The initial conditions associated with system (2.2) are given in the form:
{y(t;t0,φ)=φ(t−t0),−∞<t≤t0,y(t+0;t0,φ)=φ(0), | (2.3) |
where the initial function φ∈Rn is bounded and piecewise continuous on (−∞,0] with points of discontinuity of the first kind at which it is continuous from the left. The set of all such functions will be denoted by PCB[(−∞,0],Rn], and the norm of a function φ∈PCB[(−∞,0], Rn] is defined as ||φ||∞=sups∈(−∞,0]||φ(s)||=supt∈(−∞,t0]||φ(t−t0)||.
According to the theory of impulsive control systems [15,28,29,32,33,34,35,36,37], the solution y(t)=y(t;t0,φ)∈Rn of the initial value problem (2.2), (2.3) is a piecewise continuous function with points of discontinuity of the first kind tk, k=1,2,..., where it is continuous from the left, i.e. the following relations are valid
yi(t−k)=yi(tk), yi(t+k)=yi(tk)+Pik(yi(tk)), i=1,2,...,n, k=1,2,.... |
We introduce some assumptions for the system parameters in (2.2) which will be used in the proofs of our main results. These assumptions also guarantee the existence and uniqueness of the solutions of (2.2):
A2.1. There exist constants Li>0 such that
|fi(u)−fi(v)|≤Li|u−v| |
for all u,v∈R, i=1,2,...,n.
A2.2. There exist constants Mi>0 such that for all u∈R and i=1,2,...,n
|fi(u)|≤Mi<∞. |
A2.3. The delay kernel Ki:R2→R+ is continuous, and there exist positive numbers κi such that
∫t−∞Ki(t,s)ds≤κi<∞ |
for all t≥t0, t≠tk, k=1,2,... and i=1,2,...,n.
A2.4. The functions Pik are continuous on R, i=1,2,...,n, k=1,2,....
A2.5. t0<t1<t2<...tk<tk+1<... and tk→∞ as k→∞.
Remark 2.1. The assumptions A2.1 and A2.2 are used in the existence and uniqueness results for the solutions of fractional-order neural network models of type (2.1). See, for example, [15,16,17,19]. The consideration of more general activation functions that are discontinuous and satisfy a nonlinear growth property as in [18,21] can motivate the researchers for future results on the topic.
To realize the impulsive control and synchronization between the fractional-order neural network systems (2.1) and (2.2) we will use the following impulsive controller:
Pik(yi(t))=Qik(yi(t)−xi(t)), i=1,2,...,n, t=tk, k=1,2,.... | (2.4) |
Define the synchronization error as e(t)=(e1(t),e2(t),...,en(t))T, ei(t)=yi(t)−xi(t), i=1,2,...,n, t>0.
Therefore, the error fractional dynamical system is given as:
{Ct0Dqtei(t)=−di(t)ei(t)+n∑j=1aijˉfj(ej(t))+n∑j=1bijˉfj(ej(t−τj(t)))+n∑j=1cij∫t−∞Kj(t,s)ˉfj(ej(s))ds, t≠tk, t≥t0,ei(t+k)=ei(tk)+Qik(ei(tk)), k=1,2,..., | (2.5) |
where ˉfj(ej(t))=fj(yj(t))−fj(xj(t)), ˉfj(ej(t−τj(t)))=fj(yj(t−τj(t)))−fj(xj(t−τj(t))), and ˉfj(ej(s))=fj(yj(s))−fj(xj(s)), −∞<s≤t, t≥t0, j=1,2,...,n, the impulsive control functions Qik are continuous on R and Qik(0)=0 for all i=1,2,...,n, k=1,2,...,
e(s)=φ0(s)−ˉφ0(s), s∈(−∞,0], e(t+0)=φ0(0)−ˉφ0(0). |
Since we will investigate the Mittag-Leffler synchronization opportunities of the impulsive control approach, we will use the standard Mittag-Leffler function [14] given as
Eq(z)=∞∑κ=0zκΓ(qκ+1), |
where q>0 in our analysis.
In addition, the following definition of global Mittag-Leffler synchronization between fractional-order systems, which is inspired by the Mittag-Leffler stability definition introduced in [39], will be important.
Definition 2.2. The controlled system (2.2) is said to be globally Mittag-Leffler synchronized onto the system (2.1), if for ˉφ0∈PCB[(−∞,0],Rn] there exist constants λ>0 and d>0 such that
||e(t)||≤{M(ˉφ0)Eq(−λtq)}d, t>t0, |
where M(0)=0, M(ˉφ0)≥0, and M(ˉφ0) is Lipschitzian with respect to ˉφ0∈PCB[(−∞,0],Rn].
In other words, the global Mittag-Leffler synchronization between fractional-order systems (2.1) and (2.2) is equivalent to a global Mittag-Leffler stability of the zero solution of the error system (2.5).
We note that, for integer-order systems where q=1, the concept of global Mittag-Leffler synchronization reduces to that of global exponential synchronization, which is a particular type of global asymptotic synchronization. This particular type of synchronization provides the fastest convergent rate and that is why it attracts the high interest. It is also well known, [39] that for fractional-order systems the Mittag-Leffler stability demonstrates a faster convergence speed than the exponential stability near the origin. This is the main motivation of our research.
Introduce the following notations:
Gk=(tk−1,tk)×Rn,k=1,2,...; G=∪∞k=1Gk.
Further on we will apply the Lyapunov approach and to this end we will use piecewise continuous Lyapunov functions V: [t0,∞)×Rn→R+.
Definition 2.3. We say that the function V:[t0,∞)×Rn→R+, belongs to the class V0 if the following conditions are fulfilled:
1. The function V is continuous in ∪∞k=1Gk and V(t,0)=0 for t∈[t0,∞).
2. The function V satisfies locally the Lipschitz condition with respect to e on each of the sets Gk.
3. For each k=1,2,... and e∈Rn there exist the finite limits
V(t−k,e)=limt→tkt<tk V(t,e), V(t+k,e)=limt→tkt>tk V(t,e). |
4. For each k=1,2,... and e∈Rn the following equalities are valid
V(t−k,e)=V(tk,e). |
We will also need the following auxiliary lemma, which is an impulsive generalization of Lemma 2.1 in [42] for systems with unbounded delays. The proof is identical to the proof of (21) in [42] and we omit it. Similar comparison results are proved in [15,36,38] and some of the references therein.
Lemma 2.4. Assume that the function V∈V0 is such that for t∈[t0,∞), φ∈PCB[(−∞,0],Rn],
V(t+,e(t+)+Δ(e(t)))≤V(t,e(t)), t=tk, k=1,2,..., |
and the inequality
Ct0DqtV(t,φ(t))≤MV(t,φ(0)), t≠tk, k=1,2,... |
is valid whenever V(t+s,φ(s))≤V(t,φ(0)) for −∞<s≤0, where M∈R.
Then sup−∞<s≤0V(s,φ0(s))≤V(t,φ0(0)) implies
V(t,e(t))≤sup−∞<s≤0V(t+0,e(s))Eq(Mtq),t∈[t0,∞). |
In the case, when the Lyapunov-like function is of the type V(t,e)=n∑i=1e2i(t) we will use the following result from [43].
Lemma 2.5. Let ei(t)∈R be a continuous and differentiable function, i=1,2,...,n. Then, for t≥t0 and 0<q<1, the following inequality holds
12Ct0Dqte2i(t)≤ei(t)Ct0Dqtei(t), i=1,2,...,n. |
In this section, sufficient conditions for the global Mittag-Leffler synchronization of the controlled system (2.2) onto the system (2.1), which imply global asymptotic stability of the zero equilibrium of error system (2.5) are derived.
Theorem 3.1. Assume that assumptions A2.1–A2.5 hold and there exist positive constants d_i such that d_i≤di(t) for t∈R+.
Then, the neural network system (2.2) is globally Mittag-Leffler synchronized onto the system (2.1) under the impulsive controller (2.4), if the following conditions simultaneously hold:
min1≤i≤n(d_i−Lin∑j=1|aji|)>max1≤i≤n(Li(n∑j=1|bji|+κin∑j=1|cji|))>0 | (3.1) |
Qik(ei(tk))=−γik(yi(tk)−xi(tk)),0<γik<2, | (3.2) |
i=1,2,...,n, k=1,2,....
Proof. For the error system (2.5) we construct a Lyapunov function as:
V(t,e)=n∑i=1|ei(t)|. |
Case 1. Consider first the case when t≥t0 and t∈[tk−1,tk). Then, by the definition of the Caputo fractional derivative of order q, we have [14,15,42]
Ct0Dqt|ei(t)|=sgn(ei(t))Ct0Dqtei(t) i=1,2,...,n. |
Using A2.1 and A2.3 and the assumptions of Theorem 3.1, we obtain
Ct0Dqt|ei(t)|≤−d_i|ei(t)|+n∑j=1Lj|aij||ej(t)|+n∑j=1Lj|bij||ej(t−τj(t))|+n∑j=1Ljκj|cij|sup−∞<s≤t|ej(s)|, |
for i=1,2,...,n.
After taking the sum for all i=1,2,...,n, we have
Ct0DqtV(t,e(t))≤−n∑i=1[d_i−Lin∑j=1|aji|]|ei(t)|+n∑j=1n∑i=1Lj|bij||ej(t−τj(t))| |
+n∑j=1n∑i=1Ljκj|cij|sup−∞<s≤t|ej(s)|≤−ν1V(t,e(t))+ν2sup−∞<s≤tV(s,e(s)), |
where
ν1=min1≤i≤n(d_i−Lin∑j=1|aji|)>0, |
ν2=max1≤i≤n(Li(n∑j=1|bji|+κin∑j=1|cji|))>0. |
According to the above estimate for any solution e(t) of (2.5) such that
V(s,e(s))≤V(t,e(t)),−∞<s≤t, |
we have
Ct0DqtV(t,e(t))≤−(ν1−ν2)V(t,e(t)), t≠tk, k=1,2,.... |
Condition (3.1) of Theorem 3.1 implies the existence of a real number λ>0 such that
ν1−ν2≥λ, |
and, it follows that
Ct0DqtV(t,e(t))≤−λV(t,e(t)), t≠tk, t≥t0. | (3.3) |
Case 2. For t=tk, k=1,2,..., from condition (3.2), we obtain
V(t+k,e(tk)+Δ(e(tk)))=n∑i=1|ei(tk)+Qik(e(tk))| |
=n∑i=1|yi(tk)−xi(tk)−γik(yi(tk)−xi(tk))|=n∑i=1|1−γik||yi(tk)−xi(tk)| |
<n∑i=1|yi(tk)−xi(tk)|=V(tk,e(tk)),k=1,2,.... | (3.4) |
Thereupon, using (3.3) and (3.4), it follows from Lemma 2.4 that
V(t,e(t))≤sup−∞<s≤0V(t+0,e(s))Eq(−λtq),t∈[t0,∞). |
Therefore, we have
||e(t)||=n∑i=1|ei(t)|≤||φ0−ˉφ0||∞Eq(−λtq),t≥t0. |
Denote by M=||φ0−ˉφ0||∞. Hence,
||e(t)||≤MEq(−λtq),t>t0, |
where M≥0 and M=0 holds only if φ0(s)=ˉφ0(s) for s∈(−∞,0], which implies that the closed-loop neural network (2.2) is globally Mittag-Leffler synchronized onto system (2.1) under the designed impulsive control law (2.4).
Theorem 3.2. Assume that assumptions of Theorem 3.1 hold, and (3.1) is replaced by
min1≤i≤n(2d_i−n∑j=1(Lj(|aij|+|bij|+κj|cij|)+Li|aji|))>max1≤i≤n(Li(n∑j=1|bji|+κin∑j=1|cji|))>0 | (3.5) |
Then, the neural network system (2.2) is globally Mittag-Leffler synchronized onto the system (2.1) under the impulsive controller (2.4).
Proof. The proof of Theorem 3.2 is similar to those of Theorem 3.1. We will mention just some main points.
For the error system (2.5) we construct a Lyapunov function as:
V(t,e)=n∑i=1e2i(t). |
First, for t=tk, k=1,2,..., from condition (3.2), we obtain
V(t+k,e(tk)+Δ(e(tk)))=n∑i=1(ei(tk)+Qik(e(tk)))2 |
=n∑i=1(yi(tk)−xi(tk)−γik(yi(tk)−xi(tk)))2=n∑i=1(1−γik)2(yi(tk)−xi(tk))2 |
<n∑i=1(yi(tk)−xi(tk))2=V(tk,e(tk)),k=1,2,.... | (3.6) |
Secondly, for t≥t0 and t∈[tk−1,tk), k=1,2,..., we apply again A2.1, A2.3 and the assumptions of Theorem 3.1 to get
Ct0DqtV(t,e(t))≤n∑i=12|ei(t)|sgn(ei(t))[−di(t)ei(t)+n∑j=1aijˉfj(ej(t))+n∑j=1bijˉfj(ej(t−τj(t))) |
+n∑j=1cij∫t−∞Kj(t,s)ˉfj(ej(s))ds] |
≤n∑i=1[−2d_ie2i(t)+2n∑j=1Lj|aij||ei(t)||ej(t)|+2n∑j=1Lj|bij||ei(t)||ej(t−τj(t))| |
+2n∑j=1Ljκj|cij||ei(t)|sups∈(−∞,t]|ej(s)|] |
≤n∑i=1[−2d_ie2i(t)+n∑j=1Lj|aij|(e2i(t)+e2j(t))+n∑j=1Lj|bij|(e2i(t)+e2j(t−τj(t))) |
+n∑j=1Ljκj|cij|(e2i(t)+sups∈(−∞,t]e2j(s))] |
=−n∑i=1[2d_i+n∑j=1(Lj(|aij|+|bij|+κj|cij|)+Li|aji|)]e2i(t) |
+n∑j=1n∑i=1(Lj|bij|e2j(t−τj(t))+Ljκj|cij|sups∈(−∞,t]e2j(s))) |
≤−ˉν1V(t,e(t))+ν2sup−∞<s≤tV(s,e(s)), |
where
ˉν1=min1≤i≤n(2d_i−n∑j=1(Lj(|aij|+|bij|+κj|cij|)+Li|aji|))>0, |
ν2=max1≤i≤n(Li(n∑j=1|bji|+κin∑j=1|cji|))>0. |
The rest of the proof repeats the end of the proof of Theorem 3.1 using (3.5) instead of (3.1).
Remark 3.3. Theorems 3.1 and 3.2 offer an impulsive control law with control gains γik that can be applied to the Mittag-Leffler synchronization of the fractional neural network model (2.2) into the model (2.1). Since the synchronization is directly related to the stability and stabilization problems of systems, the proposed impulsive control strategy is a power tool for studying the stability dynamics of fractional-order neural networks.
Remark 3.4. Impulsive control approaches are applied to various integer-order neural networks models in the existing literature. See, for example, [26,27,28,29,30,31,32,33] and some of the references therein. Indeed, it is well known that such control strategies have important advantages. In this paper, we generalize the impulsive control approach to the fractional-order case. In fact, the impulsive controllers (2.4) are designed so that to achieve global Mittag-Leffler synchronization between the fractional master system (2.1) and the control fractional system (2.2).
Remark 3.5. In spite of the great possibilities of applications, the theory of the fractional neural networks with distributed delays is still in the initial stage [22]. To the best of our knowledge, there has not been any work so far considering unbounded delays in fractional-order neural network models, which is very important in theories and applications and also is a very challenging problem. Hence, our results extend the existent ones in the literature adding the effect of unbounded delays.
Remark 3.6. A review of the existing results shows that impulsive control strategies have been applied to some fractional-order neural network models [34,35,36,37,38]. With the presented research we complement the existing works by incorporating unbounded delays into the fractional-order neural network model. The results in [36] can be considered as special cases of the proposed results here, when the terms with unbounded delays are removed in (2.1) and (2.2). Hence, as compared to [34,35,36,37,38], the proposed results in this paper are more general. To the best of our knowledge, this is the first paper on fractional-order neural network models with unbounded delays and subject to impulsive control law.
Remark 3.7. The concept of Mittag-Leffler synchronization between fractional-order neural networks is investigated in some papers. See, for example [36,37,40,41]. In this paper, we extended the existing results incorporating unbounded delays and impulsive perturbations into fractional-order neural networks and dealt with an impulsive synchronization analysis for the addressed more general models.
In this section, examples are presented to illustrate the main results.
Example 4.1. Consider a two-dimensional Caputo fractional neural network of type (2.1) with mixed delays as follows
{Ct0Dqtxi(t)=−di(t)xi(t)+n∑j=1aijfj(xj(t))+n∑j=1bijfj(xj(t−τj(t)))+n∑j=1cij∫t−∞Kj(t,s)fj(xj(s))ds+Ii, t≥t0, | (4.1) |
where n=2, t0=0, I1=1, I2=1, d1(t)=d2(t)=3, fi(xi)=12(|xi+1|−|xi−1|), 0≤τi(t)≤τ (τ=1), Ki(s)=e−s, i=1,2,
(aij)2×2=(a11a12a21a22)=(0.50.6−0.51), |
(bij)2×2=(b11b12b21b22)=(0.9−0.2−0.040.07), |
(cij)2×2=(c11c12c21c22)=(0.5−0.6−0.030.08). |
Then, we have that d_1=d_2=3, L1=L2=1, and the assumption A2.3 is satisfied, since ∫∞0e−sds=1.
We consider the following impulsive control system
{Ct0Dqtyi(t)=−di(t)yi(t)+2∑j=1aijfj(yj(t))+2∑j=1bijfj(yj(t−τj(t)))+2∑j=1cij∫t−∞Kj(t,s)fj(yj(s))ds+Ii, t≠tk, t≥0, | (4.2) |
with an impulsive control rule defined as
{Δy1(tk)=−34(y1(tk)−x1(tk)), k=1,2,...,Δy2(tk)=−12(y2(tk)−x2(tk)), k=1,2,..., | (4.3) |
where the impulsive moments are such that 0<t1<t2<..., and limk→∞tk=∞.
Hence, the condition (3.1) of Theorem 3.1 is satisfied for ν1=1.4, ν2=0.97. We also have that the impulsive control gains satisfy condition (3.2), since
0<γ1k=34<2,0<γ2k=12<2. |
According to Theorem 3.1, the master system (4.1) and response system (4.2) with impulsive control (4.3) are globally Mittag-Leffler (globally asymptotically) synchronized. Time responses of the state variables of the synchronization error system are given on Figure 1, for tk=5k, k=1,2,....
If we consider again the system (4.2) but with impulsive perturbations of the form
{Δy1(tk)=−3(y1(tk)−x1(tk)), k=1,2,...,Δy2(tk)=−12(y2(tk)−x2(tk)), k=1,2,..., | (4.4) |
the impulsive control rule (3.2) is not satisfied, and there is nothing we can say about the impulsive synchronization between systems (4.1) and (4.2) with impulsive perturbations (4.4), since γ1k=3>2. The state variable e1(t) of the error system is demonstrated on Figure 2 in the case when tk=5k, k=1,2,.... It is interesting to see that the impulses cannot synchronize both systems in this case.
Remark 4.2. Note that the impulsive functions Qik, i=1,2,...,n, k=1,2,... in the impulsive control rule (2.4) may be of different type. In this paper, we investigate the case, when the controller (2.4) has the form given in (3.2). By means of Example 1, we demonstrate the efficiency of the controllers of type (3.2). We show that, if the impulsive controller is designed according to (3.2), it contributes to the global Mittag-Leffler synchronization between the fractional-order models (4.1)–(4.3). We also illustrate the case, when the impulsive controller does not satisfy (3.2), and the synchronization between (4.1) and (4.2), (4.4) fails, i.e., the zero solution of the error system is globally Mittag-Leffler unstable.
Example 4.3. Consider a two-dimensional Caputo fractional neural network of type (4.1) with mixed delays, where t0=0; I1=1, I2=1; d1(t)=d2(t)=4+t, fi(xi)=12(|xi+1|−|xi−1|), 0≤τi(t)≤τ (τ=1), Ki(s)=e−s, i=1,2,
(aij)2×2=(a11a12a21a22)=(21−12), |
(bij)2×2=(b11b12b21b22)=(0.1−0.2−0.150.1), |
(cij)2×2=(c11c12c21c22)=(0.1−0.2−0.150.2). |
Now, we have that d_1=d_2=4, L1=L2=1.
If the impulsive controllers (2.4) are chosen so that
{P1k(y1(tk))=−45(y1(tk)−x1(tk)), k=1,2,...,P2k(y2(tk))=−23(y2(tk)−x2(tk)), k=1,2,..., | (4.5) |
where the impulsive moments are such that 0<t1<t2<..., and limk→∞tk=∞, then the corresponding impulsive control system is
{Ct0Dqtyi(t)=−di(t)yi(t)+2∑j=1aijfj(yj(t))+2∑j=1bijfj(yj(t−τj(t)))+2∑j=1cij∫t−∞Kj(t,s)fj(yj(s))ds+Ii, t≠tk, t≥t0,Δy1(tk)=−45(y1(tk)−x1(tk)), k=1,2,...,Δy2(tk)=−23(y2(tk)−x2(tk)), k=1,2,.... | (4.6) |
Hence, the condition (3.5) of Theorem 3.2 is satisfied for ν1=1.4, ν2=0.7. We also have that the impulsive control gains satisfy condition (3.2), since
0<γ1k=45<2,0<γ2k=23<2. |
Therefore, we obtain by Theorem 3.2, that the master system (4.1) and response system (4.6) are globally Mittag-Leffler (globally asymptotically) synchronized. Time responses of the state variables of the synchronization error system are represented on Figure 3, for tk=5k, k=1,2,....
Remark 4.4. We presented two examples to demonstrate the efficiency of both theorems that ensure the global Mittag-Leffler synchronization of fractional-order neural networks by employing different Lyapunov function candidates, and hence using different conditions of type (3.1) and (3.5). For both synchronization criteria we apply a unified impulsive control rule (3.2). However, the established criteria can help to check the synchronization of impulsive fractional-order neural networks with different systems parameters.
In this paper, we have investigated the global Mittag-Leffler synchronization problem between two fractional-order neural networks with bounded and unbounded delays. Applying an impulsive control approach, criteria are obtained by constructing appropriate Lyapunov functions and the fractional Lyapunov approach. The obtained results are new and complement the existing global Mittag-Leffler synchronization results for fractional neural networks under impulsive controls. Examples are demonstrated to illustrate the obtained results. Since, the impulsive control approach is preferable in many real-world applications, our results can be extended to fractional-order models with reaction-diffusion terms. The discrete cases are also a subject to future investigations.
This work was supported in part by the European Regional Development Fund through the Operational Program "Science and Education for Smart Growth" under contract UNITe No BG05M2OP001–1.001–0004 (2018–2023).
The authors declare no conflict of interest.
[1] | F. Kovács, C. Legány, A. Babos, Cluster validity measurement techniques, Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, (2006). |
[2] |
A. K. Jain, Data clustering: 50 years beyond k-means, Pattern Recogn. Lett., 31 (2010), 651-666. https://doi.org/10.1016/j.patrec.2009.09.011 doi: 10.1016/j.patrec.2009.09.011
![]() |
[3] |
X. Wu, V. Kumar, R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, et al., Top 10 algorithms in data mining, Knowl. Inf. Syst., 14 (2007), 1-37. https://doi.org/10.1007/s10115-007-0114-2 doi: 10.1007/s10115-007-0114-2
![]() |
[4] |
S. P. Lloyd, Least squares quantization in pcm, IEEE T. Inform. Theory, 28 (1982), 129-137. https://doi.org/10.1109/TIT.1982.1056489 doi: 10.1109/TIT.1982.1056489
![]() |
[5] | E. W. Forgy, Cluster analysis of multivariate data: efficiency versus interpretability of classifications, Biometrics, 21 (1965), 768-769. |
[6] |
L. R. Costa, D. Aloise, N. Mladenović, Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering, Inform. Sciences, 415 (2017), 247-253. https://doi.org/10.1016/j.ins.2017.06.019 doi: 10.1016/j.ins.2017.06.019
![]() |
[7] | M. I. Malinen, P. Fränti, Balanced k-means for clustering, Joint Int. Workshop on Structural, Syntactic, and Statistical Pattern Recognition (S+SSPR 2014), (2014), 32-41. https://doi.org/10.1007/978-3-662-44415-3_4 |
[8] | W. Lin, Z. He, M. Xiao, Balanced clustering: A uniform model and fast algorithm, IJCAI, (2019), 2987-2993. |
[9] |
A. K. Jain, M. N. Murty, P. J. Flynn, Data clustering: a review, ACM Comput. Surv., 31 (1999), 264-323. https://doi.org/10.1145/331499.331504 doi: 10.1145/331499.331504
![]() |
[10] | D. Saini, M. Singh, Achieving balance in clusters - a survey, International Research Journal of Engineering and Technology IRJET, 2 (2015), 2611-2614. |
[11] | P. Fränti, S. Sieranoja, How much k-means can be improved by using better initialization and repeats? Pattern Recogn., 93 (2019), 95-112. https://doi.org/10.1016/j.patcog.2019.04.014 |
[12] | C. T. Althoff, Scalable clustering for hierarchical content-based browsing of largescale image collections, Bachelor's thesis, University of Kaiserslautern, 2010. |
[13] | P. S. Bradley, K. P. Bennett, A. Demiriz, Constrained k-means clustering, Technical Report MSR-TR-2000-65, Microsoft Research, Redmond, 2000. |
[14] |
J. Han, H. Liu, F. Nie, A local and global discriminative framework and optimization for balanced clustering, IEEE T. Neur. Net. Lear. Syst., 30 (2018), 3059-3071. https://doi.org/10.1109/TNNLS.2018.2870131 doi: 10.1109/TNNLS.2018.2870131
![]() |
[15] |
Y. Liao, H. Qi, W. Li, Load-balanced clustering algorithm with distributed self-organization for wireless sensor networks, IEEE Sens. J., 13 (2013), 1498-1506. https://doi.org/10.1109/JSEN.2012.2227704 doi: 10.1109/JSEN.2012.2227704
![]() |
[16] | R. Nallusamy, K. Duraiswamy, R. Dhanalaksmi, P. Parthiban, Optimization of non-linear multiple traveling salesman problem using k-means clustering, shrink wrap algorithm and meta-heuristics, International Journal of Nonlinear Science, 9 (2010), 171-177. |
[17] |
A. Banerjee, J. Ghosh, Scalable clustering algorithms with balancing constraints, Data Min. Knowl. Disc., 13 (2006), 365-395. https://doi.org/10.1007/s10618-006-0040-z doi: 10.1007/s10618-006-0040-z
![]() |
[18] |
P. Fränti, S. Sieranoja, K. Wikström, T. Laatikainen, Clustering diagnoses from 58 million patient visits in finland between 2015 and 2018, JMIR Med. Inf., 10 (2022), e35422. https://doi.org/10.2196/35422 doi: 10.2196/35422
![]() |
[19] |
C. Zhong, M. Malinen, D. Miao, P. Fränti, A fast minimum spanning tree algorithm based on k-means, Inform. Sciences, 295 (2015), 1-17. https://doi.org/10.1016/j.ins.2014.10.012 doi: 10.1016/j.ins.2014.10.012
![]() |
[20] |
H.-Y. Xu, H.-Y. Lan, An adaptive layered clustering framework with improved genetic algorithm for solving large-scale traveling salesman problems, Electronics, 12 (2023), 1681. https://doi.org/10.3390/electronics12071681 doi: 10.3390/electronics12071681
![]() |
[21] |
W. Tang, Y. Yang, L. Zeng, Y. Zhan, Optimizing mse for clustering with balanced size constraints, Symmetry, 11 (2019), 338. https://doi.org/10.3390/sym11030338 doi: 10.3390/sym11030338
![]() |
[22] |
S. Zhu, D. Wang, T. Li, Data clustering with size constraints, Knowledge-Based Systems, 23 (2010), 883-889. https://doi.org/10.1016/j.knosys.2010.06.003 doi: 10.1016/j.knosys.2010.06.003
![]() |
[23] | I. D. Luptáková, M. Šimon, L. Huraj, J. Pospíchal, Neural gas clustering adapted for given size of clusters, Math. Probl. Eng., 2016 (2016). https://doi.org/10.1155/2016/9324793 |
[24] |
N. Rujeerapaiboon, K. Schindler, D. Kuhn, W. Wiesemann, Size matters: cardinality-constrained clustering and outlier detection via conic optimization, SIAM J. Optimiz., 29 (2019), 1211-1239. https://doi.org/10.1137/17M1150670 doi: 10.1137/17M1150670
![]() |
[25] |
D. Chakraborty, S. Das, Modified fuzzy c-mean for custom-sized clusters, Sādhanā, 44 (2019), 182. https://doi.org/10.1007/s12046-019-1166-1 doi: 10.1007/s12046-019-1166-1
![]() |
[26] |
Q. Zhou, J. Hao, Q. Wu, Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering, Inform. Sciences, 569 (2021), 184-204. https://doi.org/10.1016/j.ins.2021.04.014 doi: 10.1016/j.ins.2021.04.014
![]() |
[27] |
R. Martín-Santamaría, J. Sánchez-Oro, S. Pérez-Peló, A. Duarte, Strategic oscillation for the balanced minimum sum-of-squares clustering problem, Inform. Sciences, 585 (2022), 529-542. https://doi.org/10.1016/j.ins.2021.11.048 doi: 10.1016/j.ins.2021.11.048
![]() |
[28] |
A. Banerjee, J. Ghosh, Frequency-sensitive competitive learning for scalable balanced clustering on high-dimensional hyperspheres, IEEE T. Neural Networks, 15 (2004), 702-719. https://doi.org/10.1109/TNN.2004.824416 doi: 10.1109/TNN.2004.824416
![]() |
[29] | T. Althoff, A. Ulges, A. Dengel, Balanced clustering for content-based image browsing, Informatiktage, (2011), 27-30. |
[30] | H. Liu, Z. Huang, Q. Chen, M. Li, Y. Fu, L. Zhang, Fast clustering with flexible balance constraints, 2018 IEEE International Conference on Big Data (Big Data), (2018), 743-750. |
[31] | H. Liu, J. Han, F. Nie, X. Li, Balanced clustering with least square regression, Proceedings of the AAAI Conference on Artificial Intelligence, 31 (2017). https://doi.org/10.1609/aaai.v31i1.10877 |
[32] | Z. Li, F. Nie, X. Chang, Z. Ma, Y. Yang, Balanced clustering via exclusive lasso: A pragmatic approach, Proceedings of the AAAI Conference on Artificial Intelligence, 32 (2018). https://doi.org/10.1609/aaai.v32i1.11702 |
[33] | Y. Zhou, R.Jin, S. C. H. Hoi, Exclusive lasso for multitask feature selection, J. Mach. Learn. Res., 9 (2010), 988-995. |
[34] | S. Gupta, A. Jain, P. Jeswani, Generalized method to produce balanced structures through k-means objective function, 2018 2nd International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud)(I-SMAC) I-SMAC (IoT in Social, Mobile, Analytics and Cloud)(I-SMAC), 2018 2nd International Conference On, (2018), 586-590. IEEE. |
[35] |
Y. Lin, H. Tang, Y. Li, C. Fang, Z. Xu, Y. Zhou, et al., Generating clusters of similar sizes by constrained balanced clustering, Appl. Intell., 52 (2022), 5273-5289. https://doi.org/10.1007/s10489-021-02682-y doi: 10.1007/s10489-021-02682-y
![]() |
[36] |
M. I. Malinen, P. Fränti, All-pairwise squared distances lead to more balanced clustering, Applied Computing and Intelligence, 3 (2023), 93-115. https://doi.org/10.3934/aci.2023006 doi: 10.3934/aci.2023006
![]() |
[37] |
P. Fränti, S. Sieranoja, K-means properties on six clustering benchmark datasets, Appl. Intell., 48 (2018), 4743-4759. https://doi.org/10.1007/s10489-018-1238-7 doi: 10.1007/s10489-018-1238-7
![]() |
[38] |
M. Rezaei, P. Fränti, Set-matching methods for external cluster validity, IEEE T. Knowl. Data Eng., 28 (2016), 2173-2186. https://doi.org/10.1109/TKDE.2016.2551240 doi: 10.1109/TKDE.2016.2551240
![]() |
[39] |
T. Zhang, R. Ramakrishnan, M. Livny, Birch: a new data clustering algorithm and its applications, Data Min. Knowl. Disc., 1 (1997), 141-182. https://doi.org/10.1023/A:1009783824328 doi: 10.1023/A:1009783824328
![]() |
[40] | D. Dua, C. Graff, UCI Machine Learning Repository, University of California, School of Information and Computer Sciences, Irvine, 2017. |
[41] |
H. T. Kahraman, S. Sagiroglu, I. Colak, Developing intuitive knowledge classifier and modeling of users' domain dependent data in web, Knowledge Based Systems, 37 (2013), 283-295. https://doi.org/10.1016/j.knosys.2012.08.009 doi: 10.1016/j.knosys.2012.08.009
![]() |
[42] | A. Strehl, J. Ghosh, Cluster ensembles - a knowledge reuse framework for combining multiple partitions, J. Mach. Learn. Res., 3 (2002), 583-617. |
[43] | A. Strehl, J. Ghosh, R. Mooney, Impact of similarity measures on web-page clustering, Workshop on Artificial Intelligence for Web Search (AAAI 2000), 58 (2000), 64. |
[44] |
R. Mariescu-Istodor, P. Fränti, Solving the large-scale tsp problem in 1 h: Santa claus challenge 2020, Front. Robot. AI, 8 (2021), 689908. https://doi.org/10.3389/frobt.2021.689908 doi: 10.3389/frobt.2021.689908
![]() |
[45] |
P. Fränti, Efficiency of random swap clustering, Journal of big data, 5 (2018), 1-29. https://doi.org/10.1186/s40537-018-0122-y doi: 10.1186/s40537-018-0122-y
![]() |
[46] |
S. Sieranoja, P. Fränti, Adapting k-means for graph clustering, Knowl. Inf. Syst., 64 (2022), 115-142. https://doi.org/10.1007/s10115-021-01623-y doi: 10.1007/s10115-021-01623-y
![]() |
[47] |
M. Rezaei, P. Fränti, K-sets and k-swaps algorithms for clustering sets, Pattern Recogn., 139 (2023), 109454. https://doi.org/10.1016/j.patcog.2023.109454 doi: 10.1016/j.patcog.2023.109454
![]() |
1. | N. Ramesh Babu, P. Balasubramaniam, Master-slave synchronization of a new fractal-fractional order quaternion-valued neural networks with time-varying delays, 2022, 162, 09600779, 112478, 10.1016/j.chaos.2022.112478 | |
2. | Călin-Adrian Popa, Mittag–Leffler stability and synchronization of neutral-type fractional-order neural networks with leakage delay and mixed delays, 2023, 360, 00160032, 327, 10.1016/j.jfranklin.2022.11.011 | |
3. | Qiu Peng, Jigui Jian, Synchronization analysis of fractional-order inertial-type neural networks with time delays, 2023, 205, 03784754, 62, 10.1016/j.matcom.2022.09.023 | |
4. | Călin-Adrian Popa, Neutral-Type and Mixed Delays in Fractional-Order Neural Networks: Asymptotic Stability Analysis, 2022, 7, 2504-3110, 36, 10.3390/fractalfract7010036 | |
5. | Ravi Agarwal, Snezhana Hristova, Donal O'Regan, Integral presentations of the solution of a boundary value problem for impulsive fractional integro-differential equations with Riemann-Liouville derivatives, 2022, 7, 2473-6988, 2973, 10.3934/math.2022164 | |
6. | Gani Stamov, Ivanka Stamova, Extended Stability and Control Strategies for Impulsive and Fractional Neural Networks: A Review of the Recent Results, 2023, 7, 2504-3110, 289, 10.3390/fractalfract7040289 | |
7. | Bibo Zheng, Zhanshan Wang, Event-based delayed impulsive control for fractional-order dynamic systems with application to synchronization of fractional-order neural networks, 2023, 35, 0941-0643, 20241, 10.1007/s00521-023-08738-z | |
8. | Junshuang Zhou, Deyi Li, Guici Chen, Shiping Wen, Projective synchronization for distinct fractional-order neural networks consist of inconsistent orders via sliding mode control, 2024, 133, 10075704, 107986, 10.1016/j.cnsns.2024.107986 | |
9. | Jinsen Zhang, Xiaobing Nie, Multiple exponential stability for short memory fractional impulsive Cohen-Grossberg neural networks with time delays, 2025, 486, 00963003, 129066, 10.1016/j.amc.2024.129066 | |
10. | Jinde Cao, K. Udhayakumar, R. Rakkiyappan, Xiaodi Li, Jianquan Lu, A Comprehensive Review of Continuous-/Discontinuous-Time Fractional-Order Multidimensional Neural Networks, 2023, 34, 2162-237X, 5476, 10.1109/TNNLS.2021.3129829 | |
11. | Trayan Stamov, Gani Stamov, Ivanka Stamova, Ekaterina Gospodinova, Lyapunov approach to manifolds stability for impulsive Cohen–Grossberg-type conformable neural network models, 2023, 20, 1551-0018, 15431, 10.3934/mbe.2023689 | |
12. | Călin-Adrian Popa, Neutral-type, leakage, and mixed delays in fractional-order neural networks: asymptotic synchronization analysis, 2023, 8, 2473-6988, 15969, 10.3934/math.2023815 | |
13. | Ivanka Stamova, Gani Stamov, 2025, 9780443301346, 83, 10.1016/B978-0-44-330134-6.00010-X | |
14. | Ivanka Stamova, Gani Stamov, 2025, 9780443301346, 159, 10.1016/B978-0-44-330134-6.00011-1 | |
15. | Ivanka Stamova, Gani Stamov, 2025, 9780443301346, 1, 10.1016/B978-0-44-330134-6.00008-1 | |
16. | 2025, 9780443301346, 303, 10.1016/B978-0-44-330134-6.00012-3 | |
17. | Sriraman R., Manoj N., Pratap Anbalagan, Decomposition method-based global Mittag-Leffler synchronization for fractional-order Clifford-valued neural networks with transmission delays and impulses, 2025, 08936080, 107564, 10.1016/j.neunet.2025.107564 | |
18. | Haibo Bao, Xuelian Li, Output synchronization for fractional-order reaction–diffusion coupled neural networks with output coupling via event-triggered impulsive control, 2025, 674, 03784371, 130695, 10.1016/j.physa.2025.130695 |