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

Modified artificial rabbits optimization combined with bottlenose dolphin optimizer in feature selection of network intrusion detection

  • Received: 31 December 2023 Revised: 19 February 2024 Accepted: 20 February 2024 Published: 29 February 2024
  • For the feature selection of network intrusion detection, the issue of numerous redundant features arises, posing challenges in enhancing detection accuracy and adversely affecting overall performance to some extent. Artificial rabbits optimization (ARO) is capable of reducing redundant features and can be applied for the feature selection of network intrusion detection. The ARO exhibits a slow iteration speed in the exploration phase of the population and is prone to an iterative stagnation condition in the exploitation phase, which hinders its ability to deliver outstanding performance in the aforementioned problems. First, to enhance the global exploration capabilities further, the thinking of ARO incorporates the mud ring feeding strategy from the bottlenose dolphin optimizer (BDO). Simultaneously, for adjusting the exploration and exploitation phases, the ARO employs an adaptive switching mechanism. Second, to avoid the original algorithm getting trapped in the local optimum during the local exploitation phase, the levy flight strategy is adopted. Lastly, the dynamic lens-imaging strategy is introduced to enhance population variety and facilitate escape from the local optimum. Then, this paper proposes a modified ARO, namely LBARO, a hybrid algorithm that combines BDO and ARO, for feature selection in the network intrusion detection model. The LBARO is first empirically evaluated to comprehensively demonstrate the superiority of the proposed algorithm, using 8 benchmark test functions and 4 UCI datasets. Subsequently, the LBARO is integrated into the feature selection process of the network intrusion detection model for classification experimental validation. This integration is validated utilizing the NSL-KDD, UNSW NB-15, and InSDN datasets, respectively. Experimental results indicate that the proposed model based on LBARO successfully reduces redundant characteristics while enhancing the classification capabilities of network intrusion detection.

    Citation: Fukui Li, Hui Xu, Feng Qiu. Modified artificial rabbits optimization combined with bottlenose dolphin optimizer in feature selection of network intrusion detection[J]. Electronic Research Archive, 2024, 32(3): 1770-1800. doi: 10.3934/era.2024081

    Related Papers:

    [1] Dongxing Fu, Xiaowei Xu, Zhibing Zhao . Generalized tilting modules and Frobenius extensions. Electronic Research Archive, 2022, 30(9): 3337-3350. doi: 10.3934/era.2022169
    [2] Jiangsheng Hu, Dongdong Zhang, Tiwei Zhao, Panyue Zhou . Balance of complete cohomology in extriangulated categories. Electronic Research Archive, 2021, 29(5): 3341-3359. doi: 10.3934/era.2021042
    [3] Dong Su, Shilin Yang . Representation rings of extensions of Hopf algebra of Kac-Paljutkin type. Electronic Research Archive, 2024, 32(9): 5201-5230. doi: 10.3934/era.2024240
    [4] Haiyu Liu, Rongmin Zhu, Yuxian Geng . Gorenstein global dimensions relative to balanced pairs. Electronic Research Archive, 2020, 28(4): 1563-1571. doi: 10.3934/era.2020082
    [5] Agustín Moreno Cañadas, Isaías David Marín Gaviria, Pedro Fernando Fernández Espinosa . Brauer configuration algebras and Kronecker modules to categorify integer sequences. Electronic Research Archive, 2022, 30(2): 661-682. doi: 10.3934/era.2022035
    [6] Yajun Ma, Haiyu Liu, Yuxian Geng . A new method to construct model structures from left Frobenius pairs in extriangulated categories. Electronic Research Archive, 2022, 30(8): 2774-2787. doi: 10.3934/era.2022142
    [7] Yongjie Wang, Nan Gao . Some properties for almost cellular algebras. Electronic Research Archive, 2021, 29(1): 1681-1689. doi: 10.3934/era.2020086
    [8] Xiuhai Fei, Cuixian Lu, Haifang Zhang . Nonlinear Jordan triple derivable mapping on -type trivial extension algebras. Electronic Research Archive, 2024, 32(3): 1425-1438. doi: 10.3934/era.2024066
    [9] Kailash C. Misra, Sutida Patlertsin, Suchada Pongprasert, Thitarie Rungratgasame . On derivations of Leibniz algebras. Electronic Research Archive, 2024, 32(7): 4715-4722. doi: 10.3934/era.2024214
    [10] Agustín Moreno Cañadas, Robinson-Julian Serna, Isaías David Marín Gaviria . Zavadskij modules over cluster-tilted algebras of type A. Electronic Research Archive, 2022, 30(9): 3435-3451. doi: 10.3934/era.2022175
  • For the feature selection of network intrusion detection, the issue of numerous redundant features arises, posing challenges in enhancing detection accuracy and adversely affecting overall performance to some extent. Artificial rabbits optimization (ARO) is capable of reducing redundant features and can be applied for the feature selection of network intrusion detection. The ARO exhibits a slow iteration speed in the exploration phase of the population and is prone to an iterative stagnation condition in the exploitation phase, which hinders its ability to deliver outstanding performance in the aforementioned problems. First, to enhance the global exploration capabilities further, the thinking of ARO incorporates the mud ring feeding strategy from the bottlenose dolphin optimizer (BDO). Simultaneously, for adjusting the exploration and exploitation phases, the ARO employs an adaptive switching mechanism. Second, to avoid the original algorithm getting trapped in the local optimum during the local exploitation phase, the levy flight strategy is adopted. Lastly, the dynamic lens-imaging strategy is introduced to enhance population variety and facilitate escape from the local optimum. Then, this paper proposes a modified ARO, namely LBARO, a hybrid algorithm that combines BDO and ARO, for feature selection in the network intrusion detection model. The LBARO is first empirically evaluated to comprehensively demonstrate the superiority of the proposed algorithm, using 8 benchmark test functions and 4 UCI datasets. Subsequently, the LBARO is integrated into the feature selection process of the network intrusion detection model for classification experimental validation. This integration is validated utilizing the NSL-KDD, UNSW NB-15, and InSDN datasets, respectively. Experimental results indicate that the proposed model based on LBARO successfully reduces redundant characteristics while enhancing the classification capabilities of network intrusion detection.



    Right (resp., left, null) quasi-Frobenius extensions of rings were first introduced by Müller [1] as a generalization of quasi-Frobenius rings and Frobenius extensions. They are closely related with separable extensions and group rings [1,2]. For instance, K. Hirata [2] established that a central projective separable extension equivalently characterized as a quasi-Frobenius extension. Extensive research has focused on the invariant properties of rings under right (resp., null) quasi-Frobenius extensions. Notably, key homological invariants such as the dominant dimension, injectivity, and related properties are preserved under quasi-Frobenius extensions, as demonstrated in [1,3].

    In the 1960s, Auslander and Bridge [4] initially introduced the concept of finitely generated modules having Gorenstein dimension zero over a Noetherian ring; these modules are now widely termed Gorenstein projective (see [4,5] for further details). A number of studies, including [6,7,8,9,10], have explored the invariance of Gorenstein projective modules under various ring extensions such as excellent extensions, Frobenius extensions, trivial ring extensions, and separable equivalences.

    It is known that the Gorenstein algebra, the Cohen-Macaulay finite algebra (CM-finite algebra, for short), and the Cohen-Macaulay finite algebra (CM-free algebra, for short) are characterized in terms of Gorenstein projective modules [3,11]. Recall that a ring Λ is called a Gorenstein ring, if the injective dimension of ΛΛ and that of ΛΛ are finite. Let ΓΛ be a quasi-Frobenius extension of Λ with ΓΛ a generator for Λ-modules. It follows from [3, Proposition 7] that Λ is a Gorenstein ring when Γ is so. Note that a generator for Λ-modules is completely faithful, but a completely faithful module is not a generator in general (see [12, P234], for detail). In this study, we shall develop their arguments and apply obtained results to right quasi-Frobenius extensions ultimately establishing the following theorem.

    Theorem A. Let Γ be a right quasi-Frobenius extension of a two-sided Noetherian ring Λ.

    (1) Suppose that Γ is a completely faithful left Λ-module. Then, Λ is a Gorenstein ring, when Γ is so.

    (2) Suppose that Γ is a separable extension of Λ. Then, Γ is a Gorenstein ring, when Λ is so.

    In [10], Zhao proved that CM-free (resp., CM-finite) properties are invariant under separable Frobenius extensions of commutative Artin rings. It is shown by Huang et al. [7] that CM-free (resp., CM-finite) properties are invariant under the strongly separable quasi-Frobenius extensions. In this paper, we shall improve them and prove the same results for right quasi-Frobenius extensions of Artin algebras.

    Theorem B. Let Γ be a separable right quasi-Frobenius extension of an Artin algebra Λ.

    (1) If Λ is CM-free, then so is Γ. Furthermore, if Γ is a generator for Λ-modules, the converse also holds.

    (2) If Λ is CM-finite, then so is Γ. Furthermore, if M is a relative generator for FG(Γ), where FG(Γ) is the category formed by all finitely generated Gorenstein projective left Λ-modules, then EndΛM is a right quasi-Frobenius extension of EndΓM.

    Essential definitions and results frequently employed in this work are given in Section 2. Theorems A and B are proved in Section 3.

    In this study, unless otherwise specified, all rings are assumed to be two-sided Noetherian rings, and all modules are finitely generated left modules. Given a ring Λ, the category composed of all finitely generated left Λ-modules is denoted by modΛ.

    Definition 2.1. ([1, Definition 1.1]) Let Λ be a subring of Γ containing the identity of Γ. Then Γ is said to be a ring extension of Λ, represented as ΓΛ. Such an extension ΓΛ is said to be a right quasi-Frobenius extension (right QF-extension, for short), if

    (1) ΓΛ is projective;

    (2) ΛΓΓaddΛ(HomΛ(ΓΓΛ,ΛΛΛ)Γ, where addΛ(HomΛ(ΓΓΛ,ΛΛΛ)Γ denotes the category formed by direct summands of finite copies of ΛHomΛ(ΓΓΛ,ΛΛΛ)Γ.

    The definition of a left quasi-Frobenius extension follows analogously. When a right QF-extension ΓΛ additionally satisfies the criteria for a left QF-extension, it is termed a quasi-Frobenius extension (QF-extension, for short). Moreover, a QF-extension ΓΛ is called a Frobenius extension if there is a bimodule isomorphism ΛΓΓΛHomΛ(ΓΓΛ,ΛΛΛ)Γ; see [13, Theorem 1.2] for detail.

    The following remark is easy, which is important for our arguments.

    Remark 2.2. Let ΓΛ be a right QF-extension, then

    (1) ΓHomΛ(ΛΓΓ,ΛΛ)ΛaddΓΓΛ.

    (2) ΛΓ is projective.

    Recall from [13, Section 2.4] that a ring extension ΓΛ is said to be a separable extension, if the map

    π:ΓΛΓΓviaπ(ab)=ab

    is a split epimorphism of the Γ-bimodule. By the definition of separable extensions, we have the following lemma.

    Lemma 2.3. Let ΓΛ be a separable extension and NmodΓ. Then, we have ΓNaddΓ(ΓΛN).

    Proof. By the definition of separable extensions, there exist a Γ-bimodule Y and a Γ-bimodule isomorphism ΓΓΓΓYΓΓ(ΓΛΓ)Γ. Then, for a Γ-module N, one gets Γ-module isomorphisms

    ΓΓΛNΓ(ΓΛΓ)ΓNΓ(ΓY)ΓNΓNΓ(YΓN).

    Thus, we have ΓNaddΓ(ΓΛN).

    For a module MmodΛ with the projective presentation,

    P1fP0M0.

    Following [4], the transpose of M, denoted by TrM, is defined as the cokernel of the dualized map of f, where ()=HomΛ(,Λ).

    Lemma 2.4. ([6, Lemma 3.1]) Suppose that ΓΛ is a ring extension.

    (1) For any MmodΛ, there exist projective right Γ-modules Q1,Q2 and a right Γ-module isomorphism Tr(ΓΛM)ΓQ1(TrMΛΓ)ΓQ2.

    (2) If ΓΛ is projective and NmodΓ, then there exist projective right Λ-modules P1,P2 and a right Λ-module isomorphism (TrN)ΛP1TrNΓHomΛ(ΛΓΓ,ΛΛ)ΛP2.

    Recall from [4, Proposition 3.8] that M is said to have Gorenstein dimension zero, denoted by GpdΛM=0, if Ext1Λ(ΛM,Λ)=0=Ext1Λo((TrM)Λ,Λ). These modules are now often termed Gorenstein projective (see [5, Definition 10.2.1] for detail). The full subcategory of modΛ comprising all finitely generated Gorenstein projective modules is denoted by FG(Λ). The Gorenstein projective dimension (or Gorenstein dimension) of M, denoted by GpdΛM, is defined as the minimal integer n1 for which there exists an exact sequence in modΛ: 0DnD1D0M0 with each DiFG(Λ) (see [4,14] for detail). If no such finite sequence exists, GpdΛM is defined to be infinite. The finitistic dimension of Λ, denoted fin.dimΛ, is defined as the supremum of projective dimensions across all modules M in modΛ having finite projective dimensions.

    Lemma 2.5. [6, Lemma 2.5] For a two-sided Noetherian ring Λ, fin.dimΛ=sup{GpdMMmodΛ and GpdM<}.

    Let B be a Λ-module. From [15, P87], we know that its character module B+ is the right Λ-module HomZ(B,Q/Z). Recall from [12, P233] that B is called completely faithful, provided that for every homomorphism f, fΛB=0 implies f=0. Recall that B is a generator (resp., cogenerator) for Λ-modules if each Λ-module is a quotient (resp., submodule) of direct sums (resp., products) of B. Clearly, every generator is completely faithful, but the converse is not true in general.

    Lemma 2.6. ([12, P234]) The equivalence of the following statements holds for a projective Λ-module Q.

    (1) Q is a completely faithful module.

    (2) Let V be a right Λ-module. Then, VΛQ=0 implies V=0,

    (3) The character module Q+ is a cogenerator in modΛop.

    Lemma 2.7. Let Λ and Γ be Noetherian rings.

    (1) [15, Corollary 10.65] In the situation (ΛA,ΓBΛ,ΓC), assume that BΛ is projective. Then, for any n1, there is an isomorphism

    ExtnΓ(BΛA,C)ExtnΛ(A,HomΓ(B,C)).

    (2) [5, Theorem 3.2.15] In the situation (ΛA,ΓBΛ,ΓC), assume that ΛA is projective. Then, for any n1, there is an isomorphism

    ExtnΓ(C,BΛA)ExtnΓ(C,B)ΛA.

    Lemma 3.1. Let ΓΛ be a right QF-extension, and XmodΛ. Then, for any i1, we have the following isomorphisms

    (1) ExtiΓ(ΓΛX,Γ)ExtiΛ(X,Λ)ΛΓ;

    (2) ExtiΓ(ΓΛX,Γ)ExtiΛ(ΛX,ΛΓ).

    Proof. Noting that ΛΓ and ΓΛ are projective by assumption and by Remark 2.2(2), the assertion follows directly from Lemma 2.7.

    Lemma 3.2. Suppose that ΓΛ is a right QF-extension with ΛΓ completely faithful. Then,

    (1) HomΛ(ΛΓ,ΛΛΛ) is a completely faithful right Λ-module.

    (2) ΓΛ is completely faithful.

    Proof. (1) It suffices to prove that the character module HomΛ(ΛΓ,ΛΛΛ)+Λ is a cogenerator by Lemma 2.6(3), because HomΛ(ΛΓ,ΛΛΛ)Λ is projective by Remark 2.2(1).

    Let X be a finitely generated right Λ-module satisfying HomΛ(X,HomΛ(ΛΓΓ,ΛΛΛ)+)=0. Since ΛΓ is projective, by [14, P78,Theorem 3.2.11], there are isomorphisms

    0=HomΛ(XΛ,HomΛ(ΛΓΓ,Λ)+Λ)HomΛ(XΛ,Λ+ΛΓ)HomΛ(XΛ,Λ+)ΛΓ,

    So, HomΛ(ΛX,Λ+)=0 by the completely faithful property of ΛΓ. Since Λ+ is also a cogenerator, X=0, which implies that HomΛ(ΛΓ,ΛΛ)+ is a cogenerator. Thus, we obtain our claim by Lemma 2.6(3).

    (2) Since HomΛ(ΛΓΓ,Λ)ΛaddΓΛ by Remark 2.2(1), Γ is a completely faithful right Λ-module as desired.

    Remark 3.3. (1) Let ΓΛ be a right QF-extension such that Γ is a completely faithful right Λ-module. It is not known that Γ is completely faithful as a left Λ-module.

    (2) Let ΓΛ be a right QF-extension with ΛΓ a generator for Λ-modules, then ΓΛ is completely faithful by Lemma 3.2. For example, if Γ is an excellent extension of Λ. It follows from [6, Proposition 4.3] that Γ is a right QF-extension of Λ. By the definition of excellent extensions, Γ is a free Λ-module. It follows from Lemma 3.2 that Γ is a completely faithful right Λ-module.

    Proposition 3.4. Let ΓΛ be a right QF-extension, and let MmodΛ. If ΛM is Gorenstein projective, so is Γ(ΓΛM). Furthermore, if ΛΓ is a completely faithful Λ-module, then the converse holds.

    Proof. By assumption, for any i1, we have ExtiΛ(M,Λ)=0=ExtiΛ((TrM)Λ,Λ). Since ΓΛ is a right QF-extension, one obtains that ΛΓ is projective by Remark 2.2(2). By Lemma 3.1(1), one has ExtiΓ(ΓΛM,Γ)ExtiΛ(M,Λ)ΛΓ=0 for any i1. On the other hand, since both ΛΓ and ΓΛ are projective, by Lemma 2.4 and Lemma 3.1(2), for any i1, there are isomorphisms

    ExtiΓ(Tr(ΓΛM)Γ,Γ)ExtiΓ((TrM)ΛΓ,Γ)ExtiΛ(TrM,Γ)=0.

    This implies that ΓΛMFG(Γ).

    Conversely, assume that ΛΓ is completely faithful and ΓΛMFG(Γ). Then, ExtiΓ(ΓΛM,Γ)=0=ExtiΓ(Tr(ΓΛM),Γ) for any i1.

    By Lemma 3.1(1), one gets 0=ExtiΓ(ΓΛM,Γ)ExtiΛ(M,Λ)ΛΓ for any i1. Since ΛΓ is completely faithful, by Lemma 2.6(2), ExtiΛ(M,Λ)=0 for each i1.

    It remains to show Ext1Λ(TrM,Λ)=0. Since ΛΓ is projective by Remark 2.2(2), for i1, we have

    0=ExtiΓ(Tr(ΓΛM),ΓΓ)ExtiΓ(TrMΛΓ,ΓΓ) (by Lemma 2.4)ExtiΛ((TrM)Λ,ΓΛ)ExtiΛ((TrM)Λ,ΓΛΛ)ΓΛExtiΛ(TrM,Λ). (by Lemma 2.7(2))

    Note that Γ is a completely faithful right Λ-module by Lemma 3.2(2), then Ext1Λ((TrM)Λ,ΛΛ) = 0.

    Corollary 3.5. Let ΓΛ be a right QF-extension with ΛΓ completely faithful, and let MmodΛ. Then

    GpdΓ(ΓΛM)=GpdΛM.

    Proof. Since ΓΛ is projective, by [6, Proposition 3.2], one obtains GpdΓ(ΓΛM)GpdΛM.

    On the other hand, without loss of generality, let GpdΓ(ΓΛM)=n<. Taking an exact sequence in modΛ,

    0KnGn1G1G0M0

    with each GiFG(Λ). Applying the exact functor ΓΛ to the above sequence yields an exact sequence in modΓ

    0ΓΛKnΓΛGn1ΓΛG1ΓΛG0ΓΛM0.

    By the first part of Proposition 3.4, one gets ΓΛGiFG(Γ) for all 0in1. So, ΓΛKnFG(Γ) by assumption and by [16, Theorem 2.20]. It follows from the second part of Proposition 3.4 that KnFG(Λ). This implies GpdΛMn by [16, Corollary 2.21].

    Corollary 3.6. Suppose that ΓΛ is a right QF-extension of Λ and MmodΛ. If M is Gorenstein projective as a Λ-module, then so is HomΛ(ΛΓΓ,M) as a Γ-module.

    Proof. Since ΓΛ is a right QF-extension, from Remark 2.2 one has HomΛ(ΛΓΓ,M)HomΛ(ΛΓΓ,Λ)ΛM addΓ(ΓΛM). By Proposition 3.4, ΓΛM is Gorenstein projective. The assertion follows from [16, Theorem 2.5].

    Proposition 3.7. Let Γ be a right QF-extension of Λ and NmodΓ. Suppose that N is Gorenstein projective as a Γ-module, then so is the underlying module N as a Λ-module. Furthermore, the converse holds when ΓΛ is separable.

    Proof. By assumption, for any i1, one has ExtiΓ(N,Γ)=0=ExtiΓ((TrN)Γ,Γ). Hence, for each i1, ExtiΓ(ΓN,HomΛ(ΛΓΓ, Λ))=0, because ΓHomΛ(ΛΓΓ,Λ) is projective by Remark 2.2(1). By Lemma 2.7(1), for any positive integer i, we have

    ExtiΛ(ΛN,Λ)ExtiΛ(ΛΓΓN,Λ)ExtiΓ(ΓN,HomΛ(ΛΓΓ,ΛΛ))=0.

    On the other hand, since ΛΓ is projective by Remark 2.2(2), for any positive integer i, we have

        ExtiΛ((TrN)Λ,Λ)ExtiΛ(TrΓNΓHomΛ(ΛΓΓ,ΛΛ),Λ) (by Lemma 2.4)ExtiΓ(TrΓN,HomΛ(HomΛ(ΛΓΓ,ΛΛ),Λ)) (by Lemma 2.7(1))ExtiΓ((TrN)Γ,Γ)=0.

    This means ΛNFG(Λ) as desired.

    Conversely, assume that NFG(Λ). By the first part of Proposition 3.4, ΓΛNFG(Γ). Noting that ΓΛ is separable, then, by Lemma 2.3, we obtain ΓNaddΓ(ΓΛN). Thus, by [16, Theorem 2.5], one gets NFG(Γ).

    Proposition 3.8. Let ΓΛ be a right QF-extension, and let NmodΓ. Then, GpdΛNGpdΓN. Moreover, the equality holds true when ΓΛ is separable.

    Proof. We may assume, without loss of generality, that GpdΓN=m, then we have the following exact sequence in modΓ:

    0DmDm1D0N0

    in modΓ, where each ΓDi lies in FG(Γ). Clearly, the above sequence remains exact in modΛ. Also, by the first part of Proposition 3.7, we have ΛDiFG(Λ), for each 0im. This implies GpdΛNm.

    Let ΓΛ be a separable right QF-extension, and we have ΓNaddΓ(ΓΛN), by Lemma 2.3. So, one has GpdΓNGpdΓ(ΓΛN)GpdΛN by ([6, Proposition 3.2].

    Theorem 3.9. If ΓΛ is a separable right QF-extension with ΛΓ completely faithful, then

    fin.dimΓ=fin.dimΛ.

    Proof. This assertion follows immediately from Lemma 2.5, Corollary 3.5, and the second part of Proposition 3.8.

    Theorem 3.10. Let Γ and Λ be two Artin algebras.

    (1) Let ΓΛ be a right QF-extension with ΛΓ completely faithful. If Γ is Gorenstein, then so is Λ.

    (2) Let ΓΛ be a separable right QF-extension. If Λ is Gorenstein, then so is Γ.

    Proof. According to [17, Theorem 1.1], an Artin algebra is Gorenstein precisely when every finitely generated left module has finite Gorenstein projective dimension. (1) follows directly from Corollary 3.5, while (2) is an immediate consequence of the first part of Proposition 3.8.

    Let Λ be an Artin algebra over a commutative Artin ring R. Recall from [18, Section 1] that a Λ-module M is termed semi-Gorenstein projective, provided Ext1Λ(M,Λ)=0. We write Λ={XmodΛ|Ext1Λ(X,Λ)=0}. Λ is termed left weakly Gorenstein, if GP(Λ)=Λ. The notion of left weakly Gorenstein algebras is a generalization of that of Gorenstein algebras. Hence, Λ is left weakly Gorenstein if, and only if, every semi-Gorenstein projective Λ-module is Gorenstein projective.

    Theorem 3.11. Let Γ and Λ be two Artin R-algebras.

    (1) Let ΓΛ be a right QF-extension with ΛΓ completely faithful. If Γ is left weakly Gorenstein, then so is Λ.

    (2) Let ΓΛ be a separable right QF-extension. If Λ is left weakly Gorenstein, then so is Γ.

    Proof. (1) Let M be a semi-Gorenstein projective Λ-module. Then, one has Ext1Λ(M,Λ)=0. By assumption and by Remark 2.2(2), both ΛΓ and ΓΛ are projective. Then, by Lemma 2.7(1), for any i1, we have ExtiΓ(ΓΛM,Γ)ExtiΛ(M,Γ)=0, which implies that ΓΛM is semi-Gorenstein projective. So, ΓΛMFG(Γ) by assumption. It follows from the second part of Proposition 3.4 that MFG(Λ). Hence, Λ is a left weakly Gorenstein algebra.

    (2) suppose that Λ is left weakly Gorenstein. Given a semi-Gorenstein Γ-module N, by Lemma 2.7(1) and by [6, Proposition 3.2], there are isomorphisms ExtiΛ(N,Λ)ExtiΛ(ΓΓN,Λ)ExtiΓ(ΓN,HomΛ(ΛΓΓ,Λ)) = 0 for any i1, because ΓHomΛ(ΛΓΓ, Λ) is projective by Remark 2.2(1). It implies that N is also a semi-Gorenstein Λ-module, and, hence, one obtains NFG(Λ) by assumption. Therefore, NFG(Γ) by the second part of Proposition 3.7. Thus, we complete this proof.

    The following lemma is due to Y. Kitamura in [19].

    Lemma 3.12. [19, Theorem 1.2] Let ΓΛ be a right QF-extension and NmodΓ. If ΓΓΛNaddΓN, then EndΛNEndΓN also is a right QF-extension.

    Let Λ be an Artin R-algebra. By D(), we denote the standard duality HomR(,E(R/rad(R))), where E(R/rad(R)) is the injective envelope of R/rad(R). Following [11, Section 1], Λ is termed Cohen-Macaulay free, or simply, CM-free, provided FG(Λ)=P(Λ) (where P(Λ) is the category of finitely generated projective Λ-modules). Additionally, Λ is called Cohen-Macaulay finite[20, Section 8], or simply, CM-finite, if there exists a Gorenstein projective Λ-module G such that FG(Λ)=addΛG, and G is called a relative generator for FG(Λ). Clearly, a Cohen-Macaulay free algebra is Cohen-Macaulay finite.

    Theorem 3.13. Suppose Γ is a separable right QF-extension of an Artin R-algebra Λ. Then,

    Λ is CM free generator Γ is CM freeΛ is CM finiteΓ is CM finite.

    That is,

    (1) If Λ is CM-free, then so is Γ. Moreover, the converse holds when Γ is a generator for modΛ.

    (2) If Λ is CM-finite, then so is Γ. Moreover, if M is a relative generator for FG(Γ), then the ring homomorphism ρ:EndΓMEndΛM is a right QF-extension.

    Proof. (1) For NFG(Γ), one has NFG(Λ) by the first part of Proposition 3.7. Hence, by assumption, one obtains ΛNP(Λ). So, ΓΛNP(Γ). Noting that ΓΛ is separable, ΓNaddΓ(ΓΛN) by Lemma 2.3. Then, ΓN is projective. Thus, Γ is a CM-free algebra.

    Conversely, assume that ΛΓ is a generator, and Γ is CM-free. Let MFG(Λ). By Corollary 3.6, we have HomΛ(ΛΓΓ,M)FG(Γ), which is projective by assumption. Hence, D(HomΛ(ΛΓΓ,M)) is an injective right Γ-module. By [15, Lemma 3.60], there is an isomorphism D(HomΛ(ΛΓΓ,M))DMΛΓ. Hence, DM is injective by [3, Proposition 7], which implies that M is projective. Therefore, Λ is CM-free.

    (2) Assume that Λ is Cohen-Macaulay finite, with G being a relative generator for FG(Λ). By Proposition 3.4, we have ΓΛGFG(Γ). For any XFG(Γ), one gets ΛXFG(Λ) by Proposition 3.7. So, ΛXaddΛG and, hence, one gets Γ(ΓΛX)addΓ(ΓΛG). On the other hand, noting that the ring extension ΓΛ is separable, we have ΓXaddΓ(ΓΛX). It follows that ΓXaddΓ(ΓΛG), which means that Γ is CM-finite.

    By assumption and by the above discussion, one obtains that Γ is Cohen-Maulay finite. If M is a relative generator for FG(Γ), then we have that MFG(Λ) by Proposition 3.7. It follows from the first part of Proposition 3.4 that Γ(ΓΛM)FG(Γ). So, Γ(ΓΛM)addΓM by assumption and by Proposition 3.4, which satisfies the condition of Lemma 3.12. Therefore, EndΛMEndΓM is a right QF-extension as a direct consequence of Lemma 3.12.

    Recall that a separable extension ΓΛ is said to be strongly separable, if MaddΛ(ΓΛM) for any Λ-module M. Under this condition, ΛΓ is a generator for Λ-modules. Due to Theorems 3.10 and 3.13, we re-obtain results in [7].

    Corollary 3.14. Let Γ be a strongly separable quasi-Frobenius extension of Λ. Then

    (1) ([7, Corollary 3.9]) Λ is Gorenstein if, and only if, Γ is Gorenstein.

    (2) ([7, Corollary 3.10]) Λ is CM-free if, and only if, Γ is CM-free.

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

    This work was financially supported by NSFC 12061026 and Foundation for University Key Teacher by Henan Province 2019GGJS204.

    The authors declare there are no conflicts of interest.



    [1] M. H. Nasir, S. A. Khan, M. M. Khan, M. Fatima, Swarm intelligence inspired intrusion detection systems—a systematic literature review, Comput. Networks, 205 (2022), 1389–1286. https://doi.org/10.1016/j.comnet.2021.108708 doi: 10.1016/j.comnet.2021.108708
    [2] T. Dokeroglu, A. Deniz, H. E. Kiziloz, A comprehensive survey on recent metaheuristics for feature selection, Neurocomputing, 494 (2022), 269–296. https://doi.org/10.1016/j.neucom.2022.04.083 doi: 10.1016/j.neucom.2022.04.083
    [3] M. Rostami, K. Berahmand, E. Nasiri, S. Forouzandeh, Review of swarm intelligence-based feature selection methods, Eng. Appl. Artif. Intell., 100 (2021), 104210. https://doi.org/10.1016/j.engappai.2021.104210 doi: 10.1016/j.engappai.2021.104210
    [4] O. O. Akinola, A. E. Ezugwu, J. O. Agushaka, R. A. Zitar, L. Abualigah, Multiclass feature selection with metaheuristic optimization algorithms: a review, Neural Comput. Appl., 34 (2022), 19751–19790. https://doi.org/10.1007/s00521-022-07705-4 doi: 10.1007/s00521-022-07705-4
    [5] A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, H. Chen, Harris hawks optimization: algorithm and applications, Future Gener. Comput. Syst., 97 (2019), 849–872. https://doi.org/10.1016/j.future.2019.02.028 doi: 10.1016/j.future.2019.02.028
    [6] J. Kennedy, R. Eberhart, Particle swarm optimization, in Proceedings of ICNN'95 - International Conference on Neural Networks, 4 (1995), 1942–1948. https://doi.org/10.1109/ICNN.1995.488968
    [7] S. Mirjalili, S. M. Mirjalili, A. Lewis, Grey wolf optimizer, Adv. Eng. Software, 69 (2014), 46–61. https://doi.org/10.1016/j.advengsoft.2013.12.007 doi: 10.1016/j.advengsoft.2013.12.007
    [8] J. Nasiri, F. M. Khiyabani, A whale optimization algorithm (WOA) approach for clustering, Cogent Math. Stat., 5 (2018), 1483565. https://doi.org/10.1080/25742558.2018.1483565 doi: 10.1080/25742558.2018.1483565
    [9] Z. Sadeghian, E. Akbari, H. Nematzadeh, H. Motameni, A review of feature selection methods based on meta-heuristic algorithms, J. Exp. Theor. Artif. Intell., 35 (2023), 1–51. https://doi.org/10.1080/0952813X.2023.2183267 doi: 10.1080/0952813X.2023.2183267
    [10] L. Wang, Q. Cao, Z. Zhang, S. Mirjalili, W. Zhao, Artificial rabbits optimization: a new bio-inspired meta-heuristic algorithm for solving engineering optimization problems, Eng. Appl. Artif. Intell., 114 (2022), 105082. https://doi.org/10.1016/j.engappai.2022.105082 doi: 10.1016/j.engappai.2022.105082
    [11] A. Srivastava, D. K. Das, A bottlenose dolphin optimizer: an application to solve dynamic emission economic dispatch problem in the microgrid, Knowledge-Based Syst., 243 (2022), 108455. https://doi.org/10.1016/j.knosys.2022.108455 doi: 10.1016/j.knosys.2022.108455
    [12] R. Ramalingam, B. Saleena, S. Basheer, P. Balasubramanian, M. Rashid, G. Jayaraman, EECHS-ARO: energy-efficient cluster head selection mechanism for livestock industry using artificial rabbits optimization and wireless sensor networks, Electron. Res. Arch., 31 (2023), 3123–3144. https://doi.org/10.3934/era.2023158 doi: 10.3934/era.2023158
    [13] Y. Wang, Y. Xiao, Y. Guo, J. Li, Dynamic chaotic opposition-based learning-driven hybrid Aquila Optimizer and artificial rabbits optimization algorithm: framework and applications, Processes, 10 (2022), 2703. https://doi.org/10.3390/pr10122703 doi: 10.3390/pr10122703
    [14] D. Dangi, S. T. Chandel, D. K. Dixit, S. Sharma, A. Bhagat, An efficient model for sentiment analysis using artificial rabbits optimized vector functional link network, Expert Syst. Appl., 225 (2023), 119849. https://doi.org/10.1016/j.eswa.2023.119849 doi: 10.1016/j.eswa.2023.119849
    [15] S. Kumar, S. Gupta, S. Arora, Research trends in network-based intrusion detection systems: a review, IEEE Access, 9 (2021), 157761–157779. https://doi.org/10.1109/ACCESS.2021.3129775 doi: 10.1109/ACCESS.2021.3129775
    [16] H. Alazzam, A. Sharieh, K. E. Sabri, A feature selection algorithm for intrusion detection system based on pigeon inspired optimizer, Expert Syst. Appl., 148 (2020), 113249. https://doi.org/10.1016/j.eswa.2020.113249 doi: 10.1016/j.eswa.2020.113249
    [17] Q. M. Alzubi, M. Anbar, Y. Sanjalawe, M. A. Al-Betar, R. Abdullah, Intrusion detection system based on hybridizing a modified binary grey wolf optimization and particle swarm optimization, Expert Syst. Appl., 204 (2022), 117597. https://doi.org/10.1016/j.eswa.2022.117597 doi: 10.1016/j.eswa.2022.117597
    [18] A. Alzaqebah, I. Aljarah, O. Al-Kadi, R. Damaševičius, A modified grey wolf optimization algorithm for an intrusion detection system, Mathematics, 10 (2022), 999. https://doi.org/10.3390/math10060999 doi: 10.3390/math10060999
    [19] M. Injadat, A. Moubayed, A. B. Nassif, A. Shami, Multi-stage optimized machine learning framework for network intrusion detection, IEEE Trans. Netw. Serv. Manage., 18 (2020), 1803–1816. https://doi.org/10.1109/TNSM.2020.3014929 doi: 10.1109/TNSM.2020.3014929
    [20] J. Lee, J. Pak, M. Lee, Network intrusion detection system using feature extraction based on deep sparse autoencoder, in 2020 International Conference on Information and Communication Technology Convergence (ICTC), (2020), 1282–1287. https://doi.org/10.1109/ICTC49870.2020.9289253
    [21] M. D. Mauro, G. Galatro, G. Fortino, A. Liotta, Supervised feature selection techniques in network intrusion detection: a critical review, Eng. Appl. Artif. Intell., 101 (2021), 104216. https://doi.org/10.1016/j.engappai.2021.104216 doi: 10.1016/j.engappai.2021.104216
    [22] Y. Li, W. Xu, W. Li, A. Li, Z. Liu, Research on hybrid intrusion detection method based on the ADASYN and ID3 algorithms, Math. Biosci. Eng., 19 (2021), 2030–2042. https://doi.org/10.3934/mbe.2022095 doi: 10.3934/mbe.2022095
    [23] T. Wang, H. Zhou, H. Liu, Multi-label feature selection based on HSIC and sparrow search algorithm, Math. Biosci. Eng, 20 (2023), 14201–14221. https://doi.org/10.3934/mbe.2023635 doi: 10.3934/mbe.2023635
    [24] A. Dahou, M. A. Elaziz, S. A. Chelloug, M. A. Awadallah, M. A. Al-Betar, M. A. Al-qaness, et al., Intrusion detection system for ioT based on deep learning and modified reptile search algorithm, Comput. Intell. Neurosci., 2022 (2022), 6473507. https://doi.org/10.1155/2022/6473507 doi: 10.1155/2022/6473507
    [25] M. Imran, S. Khan, H. Hlavacs, F. A. Khan, S. Anwar, Intrusion detection in networks using cuckoo search optimization, Soft Comput., 26 (2022), 10651–10663. https://doi.org/10.1007/s00500-022-06798-2 doi: 10.1007/s00500-022-06798-2
    [26] H. Xu, Y. Lu, Q. Guo, Application of improved butterfly optimization algorithm combined with black widow optimization in feature selection of network intrusion detection, Electronics, 11 (2022), 3531. https://doi.org/10.3390/electronics11213531 doi: 10.3390/electronics11213531
    [27] H. Xu, Y. Hu, W. Cao, L. Han, An improved jump spider optimization for network traffic identification feature selection, CMC-Comput. Mater. Continua, 76 (2023), 3239–3255. https://doi.org/10.32604/cmc.2023.039227 doi: 10.32604/cmc.2023.039227
    [28] H. Xu, K. Przystupa, C. Fang, A. Marciniak, O. Kochan, M. Beshley, A combination strategy of feature selection based on an integrated optimization algorithm and weighted k-nearest neighbor to improve the performance of network intrusion detection, Electronics, 9 (2020), 1206. https://doi.org/10.3390/electronics9081206 doi: 10.3390/electronics9081206
    [29] F. Qiu, H. Xu, F. Li, Applying modified golden jackal optimization to intrusion detection for Software-Defined Networking, Electron. Res. Arch., 32 (2024), 418–444. https://doi.org/10.3934/era.2024021 doi: 10.3934/era.2024021
    [30] A. Berta, Whales, Dolphins, and Porpoises: A Natural History and Species Guide, University of Chicago Press, 2020. https://doi.org/10.7208/9780226183220
    [31] L. Sun, M. M. Li, J. C. Xu, Binary harris hawk optimization and its feature selection algorithm, Comput. Sci., 50 (2023), 277–291. https://doi.org/10.11896/jsjkx.220300269 doi: 10.11896/jsjkx.220300269
    [32] M. Chawla, M. Duhan, Levy flights in metaheuristics optimization algorithms–a review, Appl. Artif. Intell., 32 (2018), 802–821. https://doi.org/10.1080/08839514.2018.1508807 doi: 10.1080/08839514.2018.1508807
    [33] J. Li, Q. An, H. Lei, Q. Deng, G. G. Wang, Survey of lévy flight-based metaheuristics for optimization, Mathematics, 10 (2022), 2785. https://doi.org/10.3390/math10152785 doi: 10.3390/math10152785
    [34] P. Yuan, T. Zhang, L. Yao, Y. Lu, W. Zhuang, A hybrid golden jackal optimization and golden sine algorithm with dynamic lens-imaging learning for global optimization problems, Appl. Sci., 12 (2022), 9709. https://doi.org/10.3390/app12199709 doi: 10.3390/app12199709
    [35] W. Long, J. Jiao, M. Xu, M. Tang, T. Wu, S. Cai, Lens-imaging learning Harris hawks optimizer for global optimization and its application to feature selection, Expert Syst. Appl., 202 (2022), 117255. https://doi.org/10.1016/j.eswa.2022.117255 doi: 10.1016/j.eswa.2022.117255
    [36] I. M. El-Hasnony, S. I. Barakat, M. Elhoseny, R. R. Mostafa, Improved feature selection model for big data analytics, IEEE Access, 8 (2020), 66989–67004. https://doi.org/10.1109/ACCESS.2020.2986232 doi: 10.1109/ACCESS.2020.2986232
    [37] B. Venkatesh, J. Anuradha, A review of feature selection and its methods, Cybern. Inf. Technol., 19 (2019), 3–26. https://doi.org/10.2478/cait-2019-0001 doi: 10.2478/cait-2019-0001
    [38] O. Almomani, A feature selection model for network intrusion detection system based on PSO, GWO, FFA and GA algorithms, Symmetry, 12 (2020), 1046. https://doi.org/10.3390/sym12061046 doi: 10.3390/sym12061046
    [39] T. Le, Y. Kim, H. Kim, Network intrusion detection based on novel feature selection model and various recurrent neural networks, Appl. Sci., 9 (2019), 1392. https://doi.org/10.3390/app9071392 doi: 10.3390/app9071392
    [40] K. Hussain, M. N. M. Salleh, S. Cheng, R. Naseem, Common benchmark functions for metaheuristic evaluation: a review, Int. J. Inf. Vis., 1 (2017), 218–223. http://dx.doi.org/10.30630/joiv.1.4-2.65 doi: 10.30630/joiv.1.4-2.65
    [41] N. M. Yusof, A. K. Muda, S. F. Pratama, A. Abraham, A novel nonlinear time-varying sigmoid transfer function in binary whale optimization algorithm for descriptors selection in drug classification, Mol. Diversity, 27 (2023), 71–80. https://doi.org/10.1007/s11030-022-10410-y doi: 10.1007/s11030-022-10410-y
    [42] K. Zhang, Y. Liu, F. Mei, G. Sun, J. Jin, IBGJO: improved binary golden jackal optimization with chaotic tent map and cosine similarity for feature selection, Entropy, 25 (2023), 1128. https://doi.org/10.3390/e25081128 doi: 10.3390/e25081128
    [43] R. D. Ravipati, M. Abualkibash, Intrusion detection system classification using different machine learning algorithms on KDD-99 and NSL-KDD datasets-a review paper, Int. J. Comput. Sci. Inf. Technol., 11 (2019), 65–80. https://doi.org/10.2139/ssrn.3428211 doi: 10.2139/ssrn.3428211
    [44] M. Tavallaee, E. Bagheri, W. Lu, A. A. Ghorbani, A detailed analysis of the KDD CUP 99 data set, in 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, (2009), 1–6. https://doi.org/10.1109/CISDA.2009.5356528
    [45] T. Su, H. Sun, J. Zhu, S. Wang, Y. Li, BAT: deep learning methods on network intrusion detection using NSL-KDD dataset, IEEE Access, 8 (2020), 29575–29585. https://doi.org/10.1109/Access.6287639 doi: 10.1109/Access.6287639
    [46] M. K. Ngueajio, G. Washington, D. B. Rawat, Y. Ngueabou, Intrusion detection systems using support vector machines on the kddcup'99 and nsl-kdd datasets: a comprehensive survey, in Intelligent Systems and Applications, 543 (2022), 609–629. https://doi.org/10.1007/978-3-031-16078-3_42
    [47] N. Moustafa, J. Slay, UNSW-NB15: a comprehensive data set for network intrusion detection systems (UNSW-NB15 network data set), in 2015 Military Communications and Information Systems Conference (MilCIS), (2015), 1–6. https://doi.org/10.1109/MilCIS.2015.7348942
    [48] N. Moustafa, J. Slay, The evaluation of network anomaly detection systems: statistical analysis of the UNSW-NB15 data set and the comparison with the KDD99 data set, Inf. Secur. J.: Global Perspect., 25 (2016), 18–31. https://doi.org/10.1080/19393555.2015.1125974 doi: 10.1080/19393555.2015.1125974
    [49] M. S. Elsayed, N. A. Le-Khac, A. D. Jurcut, InSDN: a novel SDN intrusion dataset, IEEE Access, 8 (2020), 165263–165284. https://doi.org/10.1109/ACCESS.2020.3022633 doi: 10.1109/ACCESS.2020.3022633
    [50] M. Abdallah, N. A. L. Khac, H. Jahromi, A. D. Jurcut, A hybrid CNN-LSTM based approach for anomaly detection systems in SDNs, in ARES'21: Proceedings of the 16th International Conference on Availability, Reliability and Security, (2021), 1–7. https://doi.org/10.1145/3465481.3469190
  • 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(1568) PDF downloads(62) Cited by(7)

Figures and Tables

Figures(13)  /  Tables(10)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog