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

Non-negative Tucker decomposition with double constraints for multiway dimensionality reduction

  • Received: 23 May 2024 Revised: 28 June 2024 Accepted: 01 July 2024 Published: 08 July 2024
  • MSC : 15A69, 62H30, 68U10

  • Nonnegative Tucker decomposition (NTD) is one of the renowned techniques in feature extraction and representation for nonnegative high-dimensional tensor data. The main focus behind the NTD-like model was how to factorize the data to get ahold of a high quality data representation from multidimensional directions. However, existing NTD-like models do not consider relationship and properties between the factor matrix of columns while preserving the geometric structure of the data space. In this paper, we managed to capture nonlinear local features of data space and further enhance expressiveness of the NTD clustering method by syncretizing organically approximately orthogonal constraint and graph regularized constraint. First, based on the uni-side and bi-side approximate orthogonality, we flexibly proposed two novel approximately orthogonal NTD with graph regularized models, which not only in part make the factor matrix tend to be orthogonality, but also preserve the geometrical information from high-dimensional tensor data. Second, we developed the iterative updating algorithm dependent on the multiplicative update rule to solve the proposed models, and provided its convergence and computational complexity. Finally, we used numerical experimental results to demonstrate the effectiveness, robustness, and efficiency of the proposed new methods on the real-world image datasets.

    Citation: Xiang Gao, Linzhang Lu, Qilong Liu. Non-negative Tucker decomposition with double constraints for multiway dimensionality reduction[J]. AIMS Mathematics, 2024, 9(8): 21755-21785. doi: 10.3934/math.20241058

    Related Papers:

    [1] Tian Yue . Barbashin type characterizations for nonuniform h-dichotomy of evolution families. AIMS Mathematics, 2023, 8(11): 26357-26371. doi: 10.3934/math.20231345
    [2] Cheng-Xiu Qiang, Jian-Ping Sun, Ya-Hong Zhao . Exponential stability analysis for nonlinear time-varying perturbed systems on time scales. AIMS Mathematics, 2023, 8(5): 11131-11150. doi: 10.3934/math.2023564
    [3] Yuxiao Zhao, Hong Lin, Xiaoyan Qiao . Persistence, extinction and practical exponential stability of impulsive stochastic competition models with varying delays. AIMS Mathematics, 2023, 8(10): 22643-22661. doi: 10.3934/math.20231152
    [4] Boonyachat Meesuptong, Peerapongpat Singkibud, Pantiwa Srisilp, Kanit Mukdasai . New delay-range-dependent exponential stability criterion and H performance for neutral-type nonlinear system with mixed time-varying delays. AIMS Mathematics, 2023, 8(1): 691-712. doi: 10.3934/math.2023033
    [5] Tijani A. Apalara, Aminat O. Ige, Cyril D. Enyi, Mcsylvester E. Omaba . Uniform stability result of laminated beams with thermoelasticity of type Ⅲ. AIMS Mathematics, 2023, 8(1): 1090-1101. doi: 10.3934/math.2023054
    [6] Li Zhu, Er-yong Cong, Xian Zhang . Global exponential stability conditions for quaternion-valued neural networks with leakage, transmission and distribution delays. AIMS Mathematics, 2023, 8(8): 19018-19038. doi: 10.3934/math.2023970
    [7] Xuelian Jin . Exponential stability analysis and control design for nonlinear system with time-varying delay. AIMS Mathematics, 2021, 6(1): 102-113. doi: 10.3934/math.2021008
    [8] Jing Ge, Xiaoliang Li, Bo Du, Famei Zheng . Almost periodic solutions of neutral-type differential system on time scales and applications to population models. AIMS Mathematics, 2025, 10(2): 3866-3883. doi: 10.3934/math.2025180
    [9] Fidel Meléndez-Vázquez, Guillermo Fernández-Anaya, Aldo Jonathan Muñóz-Vázquez, Eduardo Gamaliel Hernández-Martínez . Generalized conformable operators: Application to the design of nonlinear observers. AIMS Mathematics, 2021, 6(11): 12952-12975. doi: 10.3934/math.2021749
    [10] Yuanlin Ding . Existence and stability analysis of solutions for periodic conformable differential systems with non-instantaneous impulses. AIMS Mathematics, 2025, 10(2): 4040-4066. doi: 10.3934/math.2025188
  • Nonnegative Tucker decomposition (NTD) is one of the renowned techniques in feature extraction and representation for nonnegative high-dimensional tensor data. The main focus behind the NTD-like model was how to factorize the data to get ahold of a high quality data representation from multidimensional directions. However, existing NTD-like models do not consider relationship and properties between the factor matrix of columns while preserving the geometric structure of the data space. In this paper, we managed to capture nonlinear local features of data space and further enhance expressiveness of the NTD clustering method by syncretizing organically approximately orthogonal constraint and graph regularized constraint. First, based on the uni-side and bi-side approximate orthogonality, we flexibly proposed two novel approximately orthogonal NTD with graph regularized models, which not only in part make the factor matrix tend to be orthogonality, but also preserve the geometrical information from high-dimensional tensor data. Second, we developed the iterative updating algorithm dependent on the multiplicative update rule to solve the proposed models, and provided its convergence and computational complexity. Finally, we used numerical experimental results to demonstrate the effectiveness, robustness, and efficiency of the proposed new methods on the real-world image datasets.



    Structural stability of systems is important since structural stable systems can resist external disturbance; we refer the reader to [10,11,12,13,14,15,16,17,18,19,20,21,22]. Many researchers provided sufficient conditions for structural stability of planar (2-dimension) polynomial vector fields under polynomial perturbations [30,31,32,33,34,35,36]. In this paper, we focus on the high-dimensional systems. Usually authors study structural stability under the assumption that the linear system has some hyperbolic property and in most papers the authors assume that the linear system admits (classical or uniform) exponential dichotomy [7,8]. However, it is argued that (uniform) exponential dichotomy restrict the behavior of dynamical systems. For this reason, we need a more general concept of hyperbolicity. Recently, nonuniform exponential behavior and nonuniform exponential dichotomy was introduced (see e.g. [1,3,4,5,6,20,21]). As a result a natural question arises: if the linear system admits a nonuniform exponential dichotomy, can structural stability of systems be destroyed by the nonuniformity? This paper gives a nonuniform version of structural stability of nonlinear systems.

    In this section, we state our main theorem. Consider the systems

    ˙x(t)=A(t)x(t), (2.1)
    ˙x(t)=A(t)x(t)+f(t,x), (2.2)

    where tR,xRn, A(t) is a continuous matrix function, and f:R×RnRn is a piecewise continuous function. Let T(t,s) be the evolution operator satisfying x(t)=T(t,s)x(s), t,sR, where x(t) is a solution of the system (2.1).

    Definition 2.1. The linear system (2.1) is said to admit a nonuniform exponential dichotomy if there exists a projection P(t) (P2=P) and constants α>0,K>0,ε0, such that

    {T(t,s)P(s)Keα(ts)eε|s|,ts,T(t,s)Q(s)Keα(ts)eε|s|,ts, (2.3)

    where P(t)+Q(t)=Id(identity),T(t,s)P(s)=P(t)T(t,s),t,sR, and is the Euclidean norm (see e.g. [1,2,27]).

    Remark 2.1. The nonuniform exponential dichotomy reduces to the classical (uniform) exponential dichotomy by taking ε=0 in (2.3). In bad situations, an example is given in [1,2] to show that linear system does not admit an exponential dichotomy, but it admits a nonuniform exponential dichotomy.

    Let f:R×RnRn be a piecewise continuous function. There exists Lf>0 such that for any x1,x2Rn,tR, the piecewise continuous function f(t,x) satisfies (here ε0 as above)

    (H1) f(t,x1)f(t,x2)Lfeε|t|x1x2.

    For a small enough number 0<γ<1, denote

    S={f(t,x)|f(t,x)satisfies (H1)2KLfα1γ andsuptRt+1tf(σ,0)eε|σ|dσ<+}.

    Since the conditions in S are used in the following proof, for sake of convenience, we denote

    (H2) 2KLfα1γ,

    (H3) suptRt+1tf(σ,0)eε|σ|dσ<+.

    For any f(t,x)S, define Lf=inf{c>0|f(t,x1)f(t,x2)ceε|t|x1x2}. Taking f(t,x)1=max{Lf|fS}, then S is a normed linear vector space with norm 1. If ˙x(t)=A(t)x+f(t,x) is topologically conjugated to ˙y(t)=A(t)y+g(t,y), we denote it by fg. For detailed definition of a topological conjugacy, for example, one can refer to [11,13,23,26,27,28,29].

    Definition 2.2. The differential equation ˙x(t)=A(t)x+f(t,x) is said to be structurally stable in S, if for any g(t,y)S, we have ˙y(t)=A(t)y+g(t,y) is topologically conjugated to ˙x(t)=A(t)x+f(t,x) (i.e. gf).

    Theorem 2.1. For any f(t,x)S, if the linear system (2.1) admits a nonuniform exponential dichotomy, then system (2.2) is structurally stable in S.

    To prove the main result, some preliminary lemmas are needed.

    Lemma 3.1([26]) Let φ(t) be a non-negative locally integrable function on R. If there exist constants p>0,C>0 such that

    1pt+ptφ(s)dsC,

    then for any β>0, we have

    tφ(s)eβ(ts)ds(1eβp)1Cp,
    +tφ(s)eβ(ts)ds(1eβp)1Cp.

    Lemma 3.2 Suppose that system (2.1) admits a nonuniform exponential dichotomy with the constants ε,α. If the nonlinear term f(t,x)S, then the nonlinear system (2.2) has a unique bounded solution y(t) satisfying

    y(t)=tT(t,s)P(s)f(s,y(s))ds+tT(t,s)Q(s)f(s,y(s))ds. (3.1)

    Proof. Now we prove this lemma in three steps.

    Step 1. First, we prove that the nonlinear system (2.2) has a unique bounded solution. For this purpose, let suptRt+1tf(σ,0)eε|σ|dσ=M, x0(t)0, and

    x1(t)=tT(t,s)P(s)f(s,x0(s))ds+tT(t,s)Q(s)f(s,x0(s))ds.

    Take tR. From (H1) and Lemma 3.1, it is easy to obtain that

    x1(t)2KM(1eα)1,

    which implies x1(t) is bounded. Assume that xm(t) is bounded. Define xm+1(t) as

    xm+1(t)=tT(t,s)P(s)f(s,xm(s))ds+tT(t,s)Q(s)f(s,xm(s))ds.

    From (2.3) and (H2), we have

    xm+1(t)tKeα(ts)eε|s|[δxm(s)eε|s|+f(s,0)]ds++tKeα(ts)eε|s|[Lfxm(s)eε|s|+f(s,0)]ds=tKeα(ts)dsLfxm(s)+tKeα(ts)f(s,0)eε|s|ds++tKeα(ts)Lfxm(s)++tKeα(ts)f(s,0)eε|s|ds.

    It follows from (H1) and Lemma 3.1 that

    xm+1(t)2KLfαxm(t)+2KM(1eα)1,

    and this implies

    xm(t)2KLfαxm1(t)+2KM(1eα)1.

    Consequently, we have

    xm+1(t)2KLfα(2KLfαxm1(t)+2KM(1eα)1)+2KM(1eα)1[(2KLfα)m+(2KLfα)m1++2KLfα]x1(t)+2KM(1eα)11(2KLfα)m12KLfα2KLfαx1(t)+2KM(1eα)1.

    In view of (H3), 2KLfα<1, we obtain

    xm+1(t)112KLfα2KLfα2KM(1eα)1+2KM(1eα)1,

    which implies that the sequence of function {xm(t)} is bounded on R. Also,

    xm+1(t)xm(t)tKeα(ts)eε|s|(Lfxm(s)xm1(s)eε|s|)ds++tKeα(ts)eε|s|(Lfxm(s)xm1(s)eε|s|)ds=tKLfeα(ts)xm(s)xm1(s)ds++tKLfeα(ts)xm(s)xm1(s)ds.

    Let Tm=suptRxm(t)xm1(t). It follows from (H3) that

    Tm+1tKLfeα(ts)Tmds++tKLfeα(ts)Tmds2KLfα1TmγTm.

    Since 0<γ<1, the series +m=1xm(t)xm1(t) converges uniformly on R. Denote limmxm(t)=y(t), and note y(t) is bounded. In addition,

    y(t)=tT(t,s)P(s)f(s,y(s))ds+tT(t,s)Q(s)f(s,y(s))ds.

    Step 2. We will prove that any bounded solution of system (2.2) can be expressed by formula (3.1). Now assume that system (2.2) has another bounded solution x(t) satisfying x(0)=x0,x(t)ϑ. We have

    x(t)=T(t,0)x(0)+t0T(t,s)Iidf(s,x(s))ds=T(t,0)x(0)+t0T(t,s)(P(s)+Q(s))f(s,x(s))ds=T(t,0)x(0)+t0T(t,s)P(s)f(s,x(s))ds+t0T(t,s)Q(s)f(s,x(s))ds=T(t,0)x(0)+tT(t,s)P(s)f(s,x(s))ds0T(t,s)P(s)f(s,x(s))ds++0T(t,s)Q(s)f(s,x(s))ds+tT(t,s)Q(s)f(s,x(s))ds=tT(t,s)P(s)f(s,x(s))ds+tT(t,s)Q(s)f(s,x(s))ds+T(t,0)[x00T(0,s)P(s)f(s,x(s))ds++0T(0,s)Q(s)f(s,x(s))ds]. (3.2)

    From Lemma 3.1, we have

    tT(t,s)P(s)f(s,x(s))ds+tT(t,s)Q(s)f(s,x(s))ds|tKeα(ts)eε|s|(Lfx(s)eε|s|+f(s,0))|ds+|+tKeα(ts)eε|s|(Lfx(s)eε|s|+f(s,0))|ds|tKeα(ts)(Lfϑ+M)ds|+|+tKeα(ts)(Lfϑ+M)ds|2K(1eα)1(αϑ+M).

    Hence, we see that

    T(t,0)[x00T(0,s)P(s)f(s,x(s))ds++0T(0,s)Q(s)f(s,x(s))ds]

    is bounded. In addition, the above formula is the solution of system (2.1), so it is a bounded solution. Note that the linear system has no non-trival bounded solution due to the nonuniform exponential dichotomy. Thus we have

    T(t,0)[x00T(0,s)P(s)f(s,x(s))ds++0T(0,s)Q(s)f(s,x(s))ds]=0,

    and therefore,

    x(t)=tT(t,s)P(s)f(s,x(s))ds+tT(t,s)Q(s)f(s,x(s))ds.

    Step 3. We prove the uniqueness of the bounded solution. From (2.3), (H2) and (H3), we have

    y(t)x(t)tKeα(ts)eε|s|Lfy(s)x(s)eε|s|ds++tKeα(ts)eε|s|Lfy(s)x(s)eε|s|ds2KLfα1suptRy(t)x(t)γsuptRy(t)x(t).

    That is, suptRy(t)x(t)γsuptRy(t)x(t), which implies y(t)=x(t). Thus, the uniqueness is proved.

    Remark 3.1 In the proof, the function sequence {xm(t)} can be seen as the approximation sequence of the solution of system (2.2) and we conclude that {xm(t)} is bounded on R.

    Lemma 3.3 Suppose that the system (2.1) admits a nonuniform exponential dichotomy, fi(t,x)S,(i=1,2) and 2KLfiα1γ. Let y(t,ϱ,x) be the bounded solution of

    ˙z(t)=A(t)z+f1(t,x) (3.3)

    with φ(ϱ,ϱ,x)=x. Then for any xRn,ϱR, the following differential equation

    ˙z(t)=A(t)z+f2(t,z+φ(t,ϱ,x))f1(t,φ(t,ϱ,x)) (3.4)

    has a unique bounded solution z(ϱ,x)(t) satisfying

    z(ϱ,x)(t)=tT(t,s)P(s)[f2(s,z(ϱ,x)(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds++tT(t,s)Q(s)[f2(s,z(ϱ,x)(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds. (3.5)

    Moreover, z(ϱ,x)(ϱ) uniformly converges to z(ϱ,x0)(ϱ) for xx0Rn.

    Proof. For fixed (ϱ,x)R×Rn, clearly, system (3.4) satisfies the conditions of Lemma 3.2. Thus, (3.4) has a unique bounded solution z(ϱ,x)(t) satisfying (3.5). Now we construct a sequence {z(ϱ,x)m(t)}. Let z(ϱ,x)0(t)0, and

    z(ϱ,x)1(t)=tT(t,s)P(s)[f2(s,z(ϱ,x)0(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds+tT(t,s)Q(s)[f2(s,z(ϱ,x)0(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds.

    Assume that z(ϱ,x)m(t) is well defined. Take

    z(ϱ,x)m+1(t)=tT(t,s)P(s)[f2(s,z(ϱ,x)m(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds+tT(t,s)Q(s)[f2(s,z(ϱ,x)m(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds.

    From Remark 3.1 and Lemma 3.2, the approximation sequence {z(ϱ,x)m(t)} of the solution of system (3.4) uniformly converges to z(ϱ,x)(t) on R×(R×Rn).

    Now we claim that for any non-negative integer m, x0Rn,h>0, z(ϱ,x)m(t) uniformly converges to z(ϱ,x0)m(t) on |tϱ|h, for xx0.

    For m=0, z(ϱ,x)0(t)=0, the claim is clear. Assume that the above claim holds for m=k. Now we consider m=k+1. For x0Rn,h>0, we prove that for any ε>0, there exists a constant δ such that

    z(ϱ,x)k+1(t)z(ϱ,x0)k+1(t)<ε,|tϱ|h,

    where xx0<δ.

    Since fi(t,x)S,i=1,2, let suptRt+1tfi(σ,0)eε|σ|dσ=Mi,i=1,2.

    From (2.3) and (H1), we have

    z(ϱ,x)k+1(t)z(ϱ,x0)k+1(t)=tT(t,s)P(s)[f2(s,z(ϱ,x)k(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]ds+tT(t,s)Q(s)[f2(s,z(ϱ,x)k(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))]dstT(t,s)P(s)[f2(s,z(ϱ,x0)k(s)+φ(s,ϱ,x0))f1(s,φ(s,ϱ,x0))]ds++tT(t,s)Q(s)[f2(s,z(ϱ,x0)k(s)+φ(s,ϱ,x0))f1(s,φ(s,ϱ,x0))]dstKeα(ts)eε|s|[f2(s,z(ϱ,x)k(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))][f2(s,z(ϱ,x0)k(s)+φ(s,ϱ,x0))f1(s,y(s,ϱ,x0))]ds++tKeα(ts)eε|s|[f2(s,z(ϱ,x)k(s)+φ(s,ϱ,x))f1(s,φ(s,ϱ,x))][f2(s,z(ϱ,x0)k(s)+φ(s,ϱ,x0))f1(s,φ(s,ϱ,x0))]ds=tτJds+ttτJds+t+τtJds++t+τJds,

    where τ=1α|lnεα8[(Lf1+Lf2)¯M+2M]|. From Remark 3.1 and Lemma 3.2, we see that the approximation sequence {z(ϱ,x)m(t)} of the solution of system (3.4) is bounded on R. Also, y(s,ϱ,x) is bounded on R. Without loss of generality, we assume that they are all bounded above by ¯M. Since fi(t,x)S,(i=1,2), a standard computations lead us to

    tτJdstτKeα(ts)eε|s|[(2Lf1+2Lf2)¯M+4M]eε|s|dsε4,
    +t+τJds+t+τKeα(ts)eε|s|[(2Lf1+2Lf2)¯M+4M]eε|s|dsε4,
    ttτJdsttτKeα(ts)eε|s|[Lf2z(ϱ,x)k(s)+φ(s,ϱ,x)z(ϱ,x0)k(s)φ(s,ϱ,x0)eε|s|+Lf1φ(s,ϱ,x)φ(s,ϱ,x0)eε|s|]dsttτKeα(ts)γ[z(ϱ,x)k(s)z(ϱ,x0)k(s)+2φ(s,ϱ,x)φ(s,ϱ,x0)]ds

    By assumption, for the above ε>0, there exists a constant δk>0 such that when xx0<δk, z(ϱ,x)k(t)z(ϱ,x0)k(t)<ε,|tϱ|h. Since φ(t,ϱ,x) is the solution of (2.2),

    φ(t,ϱ,x)=x+tϱ[A(s)φ(s,ϱ,x)+f(s,φ(s,ϱ,x))]ds.

    Due to the continuity, we can assume that there is a positive constant θ such that A(t)θ, for |tϱ|h+τ. We have

    φ(t,ϱ,x)φ(t,ϱ,x0)xx0+tϱ(θ+Lf)φ(s,ϱ,x)φ(s,ϱ,x0)dsxx0+(θ+γ2Kα)tϱφ(s,ϱ,x)φ(s,ϱ,x0)ds.

    It follows from Bellmen's inequality that

    φ(t,ϱ,x)φ(t,ϱ,x0)xx0e(θ+γ2Kα)|tϱ|xx0e(θ+γ2Kα)h.

    That is, for the above ε>0, there exists a constant δ0 such that

    φ(t,ϱ,x)φ(t,ϱ,x0)<ε,|tϱ|h,

    where xx0<δ0. Consequently,

    ttτJdsttτKeα(ts)γ2Kα3εds3γ2,|tϱ|h.

    Similarly, there exists a constant δ_>0, for xx0<δ_, t+τtJds3γ2,|tϱ|h. Taking δ=min{¯δ,δ_}, then for |xx0|<δ, we have

    z(ϱ,x)k+1(t)z(ϱ,x0)k+1(t)ε2+3γε<4ε,|tϱ|h.

    Therefore, for any x0Rn,h>0, when xx0, z(ϱ,x)k+1(t) uniformly converges to z(ϱ,x0)k+1(t) on |tϱ|h. From the induction principle, for any non-negative integer m, x0Rn and h>0, if xx0, then z(ϱ,x)m(t) uniformly converges to z(ϱ,x0)m(t) on |tϱ|h.

    In particular, taking h=0, we have for any non-negative integer m, x0Rn, if xx0, then z(ϱ,x)m(ϱ) uniformly converges to z(ϱ,x0)m(ϱ).

    We finally need to prove that for xx0, z(ϱ,x)(ϱ) uniformly converges to z(ϱ,x0)(ϱ) on R. In fact, for any ˜ε>0, since {z(ϱ,x)m(ϱ)} uniformly converges to z(ϱ,x)(ϱ) on R, there exists a constant m0 such that

    z(ϱ,x)m0(ϱ)z(ϱ,x)(ϱ)<˜ε,ϱR,xRn.

    In addition, for xx0, since {z(ϱ,x)m0(ϱ)} uniformly converges to z(ϱ,x0)m0(ϱ) on R, there exists a constant δ, xx0<δ such that for the above ˜ε>0,

    |z(ϱ,x)m0(ϱ)z(ϱ,x0)m0(ϱ)|<˜ε,ϱR.

    Hence, for |xx0|<δ,

    |z(ϱ,x)(ϱ)z(ϱ,x0)(ϱ)||z(ϱ,x)(ϱ)z(ϱ,x)m0(ϱ)|+|z(ϱ,x)m0(ϱ)z(ϱ,x0)m0(ϱ)|+|z(ϱ,x0)m0(ϱ)z(ϱ,x0)(ϱ)|<3˜ε.

    Therefore, for xx0, z(ϱ,x)(ϱ) uniformly converges to z(ϱ,x0)(ϱ) on R. This completes the proof of Lemma 3.3.

    Proof of Theorem 2.1. For any g in S, it suffices to prove that

    ˙x(t)=A(t)x+f1(t,x). (3.6)

    is topologically conjugated to

    ˙x(t)=A(t)x+f2(t,x). (3.7)

    For any ϱR,xRn, let y(t,ϱ,x) be a solution of system (2.2) and y(ϱ,ϱ,x)=x. From Lemma 3.3, the differential function (3.4) has a unique bounded solution z(ϱ,x)(t) satisfying (3.5). For xx0R, z(ϱ,x)(ϱ)z(ϱ,x0)(ϱ) uniformly with respect to ϱ. Now we take

    H(ϱ,x)=x+z(ϱ,x)(ϱ).

    Then by a similar argument as in [9] or [25,26], it is not difficult to prove the conjugacy between system (3.6) and (3.7).

    This paper provides a nonuniform version of the theorem on the structural stability of nonlinear systems. We show that if the linear system ˙x(t)=A(t)x(t) admits a nonuniform exponential dichotomy, then the perturbed nonautonomous system ˙x(t)=A(t)x(t)+f(t,x) is structurally stable under suitable conditions.

    This work was supported by the National Natural Science Foundation of China under Grant (No. 11671176 and No. 11931016), Natural Science Foundation of Zhejiang Province under Grant (No. LY20A010016).

    The authors declare that there is no conflict of interests regarding the publication of this article.

    Yonghui Xia conceived of the study, outlined the proof, proposed the project, drafted the manuscript. Yuzhen Bai participated in the discussion, smooth the English, made the corrections and proofread the final version. Xiaoqing Yuan carried out some part of computations in the proof. Donal O'Regan participated in the discussion and help to smooth the manuscript. All authors read and approved the final manuscript.



    [1] P. Deng, T. Li, H. Wang, S. Horng, Z. Yu, X. Wang, Tri-regularized non-negative matrix tri-factorization for co-clustering, Knowl. Based Syst., 226 (2021), 107101. https://doi.org/10.1016/j.knosys.2021.107101 doi: 10.1016/j.knosys.2021.107101
    [2] S. Li, W. Li, J. Hu, Y. Li, Semi-supervised bi-orthogonal constraints dual-graph regularized NMF for subspace clustering, Appl. Intell., 52 (2022), 3227–3248. https://doi.org/10.1007/s10489-021-02522-z doi: 10.1007/s10489-021-02522-z
    [3] B. Cai, G. Lu, Tensor subspace clustering using consensus tensor low-rank representation, Inf. Sci., 609 (2022), 46–59. https://doi.org/10.1016/j.ins.2022.07.049 doi: 10.1016/j.ins.2022.07.049
    [4] M. Wall, A. Rechtsteiner, L. Rocha, Singular value decomposition and principal component analysis, In: D. P. Berrar, W. Dubitzky, M. Granzow, A practical approach to microarray data analysis, Springer, 2003, 91–109. https://doi.org/10.1007/0-306-47815-3_5
    [5] S. Roweis, L. Saul, Nonlinear dimensionality reduction by locally linear embedding, Science, 290 (2000), 2323–2326. https://doi.org/10.1126/science.290.5500.2323 doi: 10.1126/science.290.5500.2323
    [6] W. Yin, Z. Ma, LE and LLE regularized nonnegative Tucker decomposition for clustering of high dimensional datasets, Neurocomputing, 364 (2019), 77–94. https://doi.org/10.1016/j.neucom.2019.06.054 doi: 10.1016/j.neucom.2019.06.054
    [7] A. Gersho, R. Gray, Vector quantization and signal compression, Springer, 2012. https://doi.org/10.1007/978-1-4615-3626-0
    [8] S. Wold, K. Esbensen, P. Geladi, Principal component analysis, Chemometr. Intell. Lab. Syst., 2 (1987), 37–52. https://doi.org/10.1016/0169-7439(87)80084-9 doi: 10.1016/0169-7439(87)80084-9
    [9] Y. Zhao, C. Jiao, M. Wang, J. Liu, J. Wang, C. Zheng, Htrpca: hypergraph regularized tensor robust principal component analysis for sample clustering in tumor omics data, Interdiscip. Sci., 14 (2022), 22–33. https://doi.org/10.1007/s12539-021-00441-8 doi: 10.1007/s12539-021-00441-8
    [10] D. Lee, H. Seung, Learning the parts of objects by non-negative matrix factorization, Nature, 401 (1999), 788–791. https://doi.org/10.1038/44565 doi: 10.1038/44565
    [11] D. Lee, H. Seung, Algorithms for non-negative matrix factorization, Adv. Neural Inf. Process. Syst., 13 (2000), 556–562.
    [12] P. De Handschutter, N. Gillis, A consistent and flexible framework for deep matrix factorizations, Pattern Recogn., 134 (2023), 109102. https://doi.org/10.1016/j.patcog.2022.109102 doi: 10.1016/j.patcog.2022.109102
    [13] Z. Wang, P. Dellaportas, I. Kosmidis, Bayesian tensor factorisations for time series of counts, Mach. Learn., 113 (2023), 3731–3750. https://doi.org/10.1007/s10994-023-06441-7 doi: 10.1007/s10994-023-06441-7
    [14] B. Chen, J. Guan, Z. Li, Unsupervised feature selection via graph regularized non-negative CP decomposition, IEEE Trans. Pattern Anal. Mach. Intell., 45 (2022), 2582–2594. https://doi.org/10.1109/TPAMI.2022.3160205 doi: 10.1109/TPAMI.2022.3160205
    [15] M. Che, Y. Wei, Randomized algorithms for the approximations of Tucker and the tensor train decompositions, Adv. Comput. Math., 45 (2019), 395–428. https://doi.org/10.1007/s10444-018-9622-8 doi: 10.1007/s10444-018-9622-8
    [16] T. Kolda, B. Bader, Tensor decompositions and applications, SIAM Rev., 51 (2009), 455–500. https://doi.org/10.1137/07070111X doi: 10.1137/07070111X
    [17] Y. Kim, S. Choi, Nonnegative Tucker decomposition, 2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007. https://doi.org/10.1109/CVPR.2007.383405
    [18] H. Huang, Z. Ma, G. Zhang, Dimensionality reduction of tensors based on manifold-regularized tucker decomposition and its iterative solution, Int. J. Mach. Learn. Cybern., 13 (2022), 509–522. https://doi.org/10.1007/s13042-021-01422-5 doi: 10.1007/s13042-021-01422-5
    [19] J. Zhang, Y. Han, J. Jiang, Semi-supervised tensor learning for image classification, Multimedia Syst., 23 (2017), 63–73. https://doi.org/10.1007/s00530-014-0416-7 doi: 10.1007/s00530-014-0416-7
    [20] X. Zhang, M. Ng, Sparse nonnegative Tucker decomposition and completion under noisy observations, arXiv, 2022. https://doi.org/10.48550/arXiv.2208.08287
    [21] Q. Liu, L. Lu, Z. Chen, Nonnegative Tucker decomposition with graph regularization and smooth constraint for clustering, Pattern Recogn., 148 (2023), 110207. https://doi.org/10.1016/j.patcog.2023.110207 doi: 10.1016/j.patcog.2023.110207
    [22] Y. Qiu, G. Zhou, Y. Zhang, S. Xie, Graph regularized nonnegative Tucker decomposition for tensor data representation, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing, 2019, 8613–8617. https://doi.org/10.1109/ICASSP.2019.8683766 doi: 10.1109/ICASSP.2019.8683766
    [23] Y. Qiu, G. Zhou, Y. Wang, Y. Zhang, S. Xie, A generalized graph regularized non-negative Tucker decomposition framework for tensor data representation, IEEE Trans. Cybern., 52 (2020), 594–607. https://doi.org/10.1109/TCYB.2020.2979344 doi: 10.1109/TCYB.2020.2979344
    [24] D. Chen, G. Zhou, Y. Qiu, Y. Yu, Adaptive graph regularized non-negative Tucker decomposition for multiway dimensionality reduction, Multimedia Tools Appl., 83 (2024), 9647–9668. https://doi.org/10.1007/s11042-023-15622-4 doi: 10.1007/s11042-023-15622-4
    [25] X. Li, M. Ng, G. Cong, Y. Ye, Q. Wu, MR-NTD: manifold regularization nonnegative tucker decomposition for tensor data dimension reduction and representation, IEEE Trans. Neural Networks Lear. Syst., 28 (2016), 1787–1800. https://doi.org/10.1109/TNNLS.2016.2545400 doi: 10.1109/TNNLS.2016.2545400
    [26] Z. Huang, G. Zhou, Y. Qiu, Y. Yun, Y. Dai, A dynamic hypergraph regularized non-negative Tucker decomposition framework for multiway data analysis, Int. J. Mach. Learn. Cybern., 13 (2022), 3691–3710. https://doi.org/10.1007/s13042-022-01620-9 doi: 10.1007/s13042-022-01620-9
    [27] W. Jing, L. Lu, Q. Liu, Graph regularized discriminative nonnegative Tucker decomposition for tensor data representation, Appl. Intell., 53 (2023), 23864–23882. https://doi.org/10.1007/s10489-023-04738-7 doi: 10.1007/s10489-023-04738-7
    [28] Y. Qiu, G. Zhou, X. Chen, D. Zhang, X. Zhao, Q. Zhao, Semi-supervised non-negative Tucker decomposition for tensor data representation, Sci. China Technol. Sci., 64 (2021), 1881–1892. https://doi.org/10.1007/s11431-020-1824-4 doi: 10.1007/s11431-020-1824-4
    [29] L. Ren, R. Hu, Y. Liu, D. Li, J. Wu, Y. Zang, et al., Improving fraud detection via imbalanced graph structure learning, Mach. Learn., 113 (2023), 1069–1090. https://doi.org/10.1007/s10994-023-06464-0 doi: 10.1007/s10994-023-06464-0
    [30] M. Zhao, W. Li, L. Li, P. Ma, Z. Cai, R. Tao, Three-order tensor creation and Tucker decomposition for infrared small-target detection, IEEE Trans. Geosci. Remote Sens., 60 (2021), 1–16. https://doi.org/10.1109/TGRS.2021.3057696 doi: 10.1109/TGRS.2021.3057696
    [31] T. Jiang, M. K. Ng, J. Pan, G. Song, Nonnegative low rank tensor approximations with multidimensional image applications, Numer. Math., 153 (2023), 141–170. https://doi.org/10.1007/s00211-022-01328-6 doi: 10.1007/s00211-022-01328-6
    [32] C. Ding, X. He, H. Simon, On the equivalence of non-negative matrix factorization and spectral clustering, Proceedings of the 2005 SIAM International Conference on Data Mining, 2005,606–610. https://doi.org/10.1137/1.9781611972757.70 doi: 10.1137/1.9781611972757.70
    [33] J. Pan, M. Ng, Y. Liu, X. Zhang, H. Yan, Orthogonal nonnegative Tucker decomposition, SIAM J. Sci. Comput., 43 (2021), B55–B81. https://doi.org/10.1137/19M1294708 doi: 10.1137/19M1294708
    [34] B. Li, G. Zhou, A. Cichocki, Two efficient algorithms for approximately orthogonal nonnegative matrix factorization, IEEE Signal Process. Lett., 22 (2015), 843–846. https://doi.org/10.1109/LSP.2014.2371895 doi: 10.1109/LSP.2014.2371895
    [35] Y. Qiu, W. Sun, Y. Zhang, X. Gu, G. Zhou, Approximately orthogonal nonnegative Tucker decomposition for flexible multiway clustering, Sci. China Technol. Sci., 64 (2021), 1872–1880. https://doi.org/10.1007/s11431-020-1827-0 doi: 10.1007/s11431-020-1827-0
    [36] D. Cai, X. He, J. Han, T. Huang, Graph regularized nonnegative matrix factorization for data representation, IEEE Trans. Pattern Anal. Mach. Intell., 33 (2010), 1548–1560. https://doi.org/10.1109/TPAMI.2010.231 doi: 10.1109/TPAMI.2010.231
    [37] F. Shang, L. Jiao, J. Shi, F. Wang, M. Gong, Fast affinity propagation clustering: a multilevel approach, Pattern Recogn., 45 (2012), 474–486. https://doi.org/10.1016/j.patcog.2011.04.032 doi: 10.1016/j.patcog.2011.04.032
    [38] F. Shang, L. Jiao, F. Wang, Graph dual regularization non-negative matrix factorization for co-clustering, Pattern Recogn., 45 (2012), 2237–2250. https://doi.org/10.1016/j.patcog.2011.12.015 doi: 10.1016/j.patcog.2011.12.015
  • 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(1032) PDF downloads(41) Cited by(0)

Figures and Tables

Figures(9)  /  Tables(8)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog