Research article Special Issues

Fast clustering algorithm based on MST of representative points


  • Received: 13 April 2023 Revised: 13 July 2023 Accepted: 20 July 2023 Published: 31 July 2023
  • Minimum spanning tree (MST)-based clustering algorithms are widely used to detect clusters with diverse densities and irregular shapes. However, most algorithms require the entire dataset to construct an MST, which leads to significant computational overhead. To alleviate this issue, our proposed algorithm R-MST utilizes representative points instead of all sample points for constructing MST. Additionally, based on the density and nearest neighbor distance, we improved the representative point selection strategy to enhance the uniform distribution of representative points in sparse areas, enabling the algorithm to perform well on datasets with varying densities. Furthermore, traditional methods for eliminating inconsistent edges generally require prior knowledge about the number of clusters, which is not always readily available in practical applications. Therefore, we propose an adaptive method that employs mutual neighbors to identify inconsistent edges and determine the optimal number of clusters automatically. The experimental results indicate that the R-MST algorithm not only improves the efficiency of clustering but also enhances its accuracy.

    Citation: Hui Du, Depeng Lu, Zhihe Wang, Cuntao Ma, Xinxin Shi, Xiaoli Wang. Fast clustering algorithm based on MST of representative points[J]. Mathematical Biosciences and Engineering, 2023, 20(9): 15830-15858. doi: 10.3934/mbe.2023705

    Related Papers:

    [1] Yuan Tian, Hua Guo, Wenyu Shen, Xinrui Yan, Jie Zheng, Kaibiao Sun . Dynamic analysis and validation of a prey-predator model based on fish harvesting and discontinuous prey refuge effect in uncertain environments. Electronic Research Archive, 2025, 33(2): 973-994. doi: 10.3934/era.2025044
    [2] Pinglan Wan . Dynamic behavior of stochastic predator-prey system. Electronic Research Archive, 2023, 31(5): 2925-2939. doi: 10.3934/era.2023147
    [3] Yanjiao Li, Yue Zhang . Dynamic behavior on a multi-time scale eco-epidemic model with stochastic disturbances. Electronic Research Archive, 2025, 33(3): 1667-1692. doi: 10.3934/era.2025078
    [4] Kimun Ryu, Wonlyul Ko . Global existence of classical solutions and steady-state bifurcation in a prey-taxis predator-prey system with hunting cooperation and a logistic source for predators. Electronic Research Archive, 2025, 33(6): 3811-3833. doi: 10.3934/era.2025169
    [5] Yifan Wu, Xiaohui Ai . Analysis of a stochastic Leslie-Gower predator-prey system with Beddington-DeAngelis and Ornstein–Uhlenbeck process. Electronic Research Archive, 2024, 32(1): 370-385. doi: 10.3934/era.2024018
    [6] Yuan Tian, Yang Liu, Kaibiao Sun . Complex dynamics of a predator-prey fishery model: The impact of the Allee effect and bilateral intervention. Electronic Research Archive, 2024, 32(11): 6379-6404. doi: 10.3934/era.2024297
    [7] Ailing Xiang, Liangchen Wang . Boundedness of a predator-prey model with density-dependent motilities and stage structure for the predator. Electronic Research Archive, 2022, 30(5): 1954-1972. doi: 10.3934/era.2022099
    [8] Fengrong Zhang, Ruining Chen . Spatiotemporal patterns of a delayed diffusive prey-predator model with prey-taxis. Electronic Research Archive, 2024, 32(7): 4723-4740. doi: 10.3934/era.2024215
    [9] Yichao Shao, Hengguo Yu, Chenglei Jin, Jingzhe Fang, Min Zhao . Dynamics analysis of a predator-prey model with Allee effect and harvesting effort. Electronic Research Archive, 2024, 32(10): 5682-5716. doi: 10.3934/era.2024263
    [10] Shuxia Pan . Asymptotic spreading in a delayed dispersal predator-prey system without comparison principle. Electronic Research Archive, 2019, 27(0): 89-99. doi: 10.3934/era.2019011
  • Minimum spanning tree (MST)-based clustering algorithms are widely used to detect clusters with diverse densities and irregular shapes. However, most algorithms require the entire dataset to construct an MST, which leads to significant computational overhead. To alleviate this issue, our proposed algorithm R-MST utilizes representative points instead of all sample points for constructing MST. Additionally, based on the density and nearest neighbor distance, we improved the representative point selection strategy to enhance the uniform distribution of representative points in sparse areas, enabling the algorithm to perform well on datasets with varying densities. Furthermore, traditional methods for eliminating inconsistent edges generally require prior knowledge about the number of clusters, which is not always readily available in practical applications. Therefore, we propose an adaptive method that employs mutual neighbors to identify inconsistent edges and determine the optimal number of clusters automatically. The experimental results indicate that the R-MST algorithm not only improves the efficiency of clustering but also enhances its accuracy.



    The study of population dynamics is an important branch of ecosystem models and has attracted the special interest of ecologists and applied mathematics at historical and contemporary stages [1,2]. Mathematical models play a key role in understanding changes in biological systems [3,4] and the effect of control measures [5]. In ecosystems, predation is an important way for species to interact and depend on each other. The pioneer work in mathematics that describes the interplay or dynamics between predator and prey belongs to the Lotka [6] and Volterra [7], which is well known as the Lotka-Voterra model. Subsequently, scholars have refined and enhanced the model in the application of different scenarios and proposed different kinds of uptake functions to characterize the predator's hunting ability [8,9,10,11]. The uptake function with a Holling type is representative and applicable to predation phenomena of different species, ranging from lower organisms such as algae and unicellular organisms to invertebrates and vertebrates, such as Holling-Ⅰ [12], Holling-Ⅱ [13], Holling-Ⅲ [14], Holling-(n+1) [15] and so on. The Holling-Ⅲ functional response showed that the predator's predation reached saturation when the number of prey reached a certain level [14], which is consistent with most of the actual situations. Therefore, it is of a great significance to study the dynamics of a predator-prey model with a Holling-Ⅲ functional response function.

    Over the long period of evolution, prey have evolved with a series of anti-predator behaviors. The anti-predator behaviors of prey can be classified into two categories: (ⅰ) defensive counterattacks [16] and (ⅱ) morphological or behavioral changes, including camouflage [17], seeking refuge [18,19], and so on. The benefit of anti-predator behaviors is that they reduce the risk of predation. Red colobus monkeys show siege when they are threatened by chimpanzees [16], cuttlefish choose to camouflage by matching background features [17], northern pigtailed macaques select trees with abundant branches and elevated sleeping locations in order to minimize the threat of predation [18], and white-headed langurs opt for cliff edges or caves as their nocturnal habitats, thus seeking refuge from predators such as leopard cats [19]. Anti-predator behaviors are widespread in nature and are essential to consider in the modeling process. Tang and Xiao [20] proposed a model of the first type of anti-predation behaviors by adding anti-predation terms to reduce the rate of predator growth. It was demonstrated that anti-predator behaviors inhibit predator-prey oscillations and decreased the likelihood of the coexistence between prey and predator [21]. However, many animals lack strong defenses against attacks and they often exhibit the second type anti-predation behavior. An anti-predator model for habitat selection or vigilance was proposed by Ives and Dobson [22], which takes the form:

    {dxdt=x[r(1xK)veεvqy1+ax],dydt=ceεvqxy1+axmy. (1.1)

    The existence of the anti-predator effect modulates the reproductive capacity of prey through the factor vx. For example, yellow-eyed juncos exhibit a heightened vigilance by dedicating more time to scanning for predators upon the release of a trained Harris hawk in their vicinity, thus resulting in a reduced time spent foraging for food [23]. It is hypothesized that the diminished feeding rates will ultimately either heighten the likelihood of starvation or hinder the ability to successfully rear offspring. Werner et al. discovered that when bass are present, bluegills will select not rich in resources but more hidden habitats, moreover, bluegills reared in the presence of bass attain only approximately 80% of the mass compared to those raised without the bass present [24]. Additionally, predators pay a price for the anti-predator effect, which is defined by the term eεv on the predator's hunting ability. Based on this consideration, a prey-predator model with a prey habitat selection is considered in this study.

    In reality, population systems are typically subjected to a wide range of random disturbances. May has pointed out that the rate of growth, environmental carrying capacity, coefficient of competition, and other pertinent system parameters are all impacted by environmental noise to differing degrees [25]. The deterministic model has certain limitations, in some situations, frequently yields disappointing results. To more accurately characterize and predict the population ecosystems, it is necessary to investigate population models with stochastic disturbances. In natural system, the stochastic disturbances can be described by white noise [26], colored noise [27], Levy jumps [28], Markov switching [29], and others. Population systems are often subject to environmental fluctuations. Generally speaking, such fluctuations could be modeled by a colored noise. Moreover, if the colored noise is not strongly correlated, then it can be approximately modeled by a white noise, and the approximation works quite well [30]. Mao et al. observed that even the smallest white noise can suppress the population explosion and provided a classical method for the uniqueness of the solution [31]. Ji and Jiang [32] explored a stochastic predatory system that incorporated Beddington-DeAngelis uptake function and discussed the asymptotic property of the system model. Liu et al. [33] put forward a prey-predator system model which followed the Holling type-Ⅱ uptake function in an environment that involved stochastic disturbances. Zhang et al. [34] analyzed a prey-predator system model by considering the Holling type-Ⅱ uptake function and hyperbolic mortality in an environment subject to stochastic disturbances. Liu [35] analyzed the dynamics of a stochastic regime-switching predator-prey model with modified Leslie-Gower Holling-type Ⅱ schemes and prey harvesting. Li et al. [36] proposed a Melnikov-type method for chaos in a class of hybrid piecewise-smooth systems with impact and noise excitation under unilateral rigid constraint. In the present investigation, it is assumed that the environment is influenced by white noise in the modeling process.

    The structure of this paper is organized as follows: in Section 2, a prey-predator system model with prey habitat selection and stochastic disturbances is formulated, which is followed by a presentation of some basic notations, definitions, and crucial lemmas used in this study; in Sections 3 and 4, the basic properties and dynamic behavior of the system model with or without stochastic disturbances are investigated; in Section 5, numerical simulations with discussions are presented to illustrate the main results; and finally, the work is summarized and further research directions are put forward.

    When prey habitat selection is considered, the prey-predator model can be described as follows:

    {dx(t)dt=x(t)[r(1x(t)K)ve(vm+m0)x(t)y(t)1+ax(t)2]:=xF1(x,y),dy(t)dt=y(t)[ce(vm+m0)x(t)21+ax(t)2by(t)d]:=yF2(x,y), (2.1)

    where

    x — prey's densities;

    y — predator's densities;

    r — prey's intrinsic growth rate;

    K — prey's environmental carrying capacity;

    v — intensity of anti-predator effect;

    c — conversion efficiency;

    b — interspecific competition coefficient;

    d — natural mortality rate;

    m — efficiency of anti-predator behavior;

    em0 — maximum predation rate.

    Considering the changes in the natural environment and the universality of random disturbances, we introduce white noise into the Model (2.1) in order to analyze the effect of random disturbances on the Model (2.1). Let

    rr+σ1˙B1(t),dd+σ2˙B2(t),

    where σi represents the white noise intensity, which describes the strength of random disturbance in the environment. Bi(t) stands for a Brownian motion, i=1,2. Then, the model subject to stochastic disturbances is represented as follows:

    {dx(t)=x(t)[r(1x(t)K)ve(vm+m0)x(t)y(t)1+ax(t)2]dt+σ1x(t)dB1(t),dy(t)=y(t)[ce(vm+m0)x(t)21+ax(t)2by(t)d]dt+σ2y(t)dB2(t). (2.2)

    All the parameters in Model (2.1) and Model (2.2) are positive. In addition, it is assumed that vr and cc_adevm+m0 in Model (2.1) for biological restriction.

    Let us denote the following:

    u(t)limt+t0t1u(s)ds,u(t)limt+supt0t1u(s)ds,u(t)limt+inft0t1u(s)ds.

    Consider the following:

    dU(t)=F(U(t),t)dt+G(U(t),t)dB(t), (2.3)

    where B(t) is a standard Brownian motion defined on (Ω,F,{Ft}t0,P) equipped with {Ft}t0, where F(U(t),t)Rl×[0,+), G(U(t),t)l×q is a matrix. Define L as follows:

    L=t+li=1Fi(U(t),t)Ui+12li,j=1[GT(U(t),t)G(U(t),t)]i,j2UiUj.

    For V(U(t),t)C2,1(Rl×[0,+),R+), there is

    LV(U(t),t)=12trace[GT(U(t),t)VUU(U(t),t)G(U(t),t)]+Vt(U(t),t)+VU(U(t),t)F(U(t),t),

    where Vt=Vt, VU=(VU1,VU2,,VUl), VUU=(2VUiUj)l×l. Then,

    dV(U(t),t)=VU(U(t),t)G(U(t),t)dB(t)+LV(U(t),t)dt.

    Definition 1 (Stochastically ultimate boundedness[31]). The solution (u(t),v(t)) is defined as having the property of stochastically ultimate boundedness if for any ε(0,1), there exists a constant χ>0 such that

    lim supt+P{||(u(t),v(t))||2>χ}<ε,(u0,v0)R2+.

    Definition 2 (Extinction and persistence[26]). The species u is defined as extinction when limt+u(t)=0, weakly persistence (in the mean) when u(t)>0, strong persistence (in the mean) when u(t)>0, persistence (in the mean) when u(t)>0, and weak persistence when limt+supu(t)>0.

    Assume that U(t)El is a regular time-homogeneous Markov process characterized by the following stochastic differential equation:

    dU(t)=b(U)dt+qk=1gr(U)dBr(t).

    The diffusion matrix of the process U(t) is denoted as follows:

    Λ(U)=(λij(U))l×l,λij(U)=qk=1gir(U)gjr(U).

    Lemma 1 (Ergodic stationary distribution [37]). For a given Markov process U(t)El, it is called possessing a unique ergodic stationary distribution μ() if IEl with boundary Γ such that i) min(eig(Λ(U))) is bounded in I and some neighborhood of I; ii) For uElI, if a path originating from u can reach I in a finite average time τ and supuSEuτ<, SEl, where S is a compact subset.

    Remark 1. To establish the condition i), it is sufficient to demonstrate that θ>0 such that

    li,j=1aij(u)ξiξjθ||ξ||2,uI,ξRl;

    To establish the condition ii), it is crucial to demonstrate the existence of a neighborhood I along with VC2 such that LV(u)<0, uElI.

    Lemma 2 ([26]). For a given u(t)C[Ω×[0,+),R+]:

    (1) If ρ0,T>0 with

    u(t)exp(ρtρ0t0u(s)ds+ni=1αiBi(t))

    for tT, then

    {uρρ0,ρ0limt+u(t)=0,ρ<0

    (2) If ρ0, T and ρ with

    lnu(t)ρtρ0t0u(s)ds+ni=1αiBi(t)

    for tT, then uρρ0.

    Lemma 3 ([37]). For T0>0, α1>0 and α2>0, it has

    P{sup0tT0[t0g(s)dB(s)α12t0|g(s)|2ds]>α2}eα1α2.

    As the population densities are non-negative, the discussion on Model (2.1) is restricted in the region R2/R2. The equilibrium of Model (2.1) satisfies the following:

    {x[r(1xK)ve(vm+m0)xy1+ax2]=0,y[ce(vm+m0)x21+ax2byd]=0.

    Obviously, Model (2.1) always has two equilibria: O(0,0) and EB(¯K,0), where ¯K(1v/r)K. O(0,0) is a saddle and constantly unstable.

    Define the following:

    ψ(x)(rv)evm+m0(1+ax2)(1x1¯K),ϕ(x)1b(cevmm0x21+ax2d).

    Then, x=0 and y=ψ(x) are two x-isolines, y=0 and y=ϕ(x) are two y-isolines.

    Since

    ψ(x)=(rv)evm+m0x2(2a¯Kx3+ax21),

    then it has ψ(x) as x0. Denote ¯vr(133/a¯K2). For v¯v, there is ψ(x)0 for x(0,¯K]; for 0v<¯v, it has ψ(¯K/3)>0. Then, there exists x1(0,¯K/3) and x2(¯K/3,¯K) such that ψ(x1)=ψ(x2)=0.

    Similarly, it has ϕ(0)=d/b, ϕ(x)>0 for x[0,¯K] and ϕ(x)=0 if and only if x=¯xdevm+m0cadevm+m0. Obviously, ¯x<¯K if and only if c>¯cdevm+m0(a+¯K2).

    Theorem 1. The boundary equilibrium EB(¯K,0) is globally asymptotically stable for c_c¯c.

    Proof. At EB(¯K,0), the Jacobian matrix is as follows:

    JEB(¯K,0)=(vre(vm+m0)¯K21+a¯K20ce(vm+m0)¯K21+a¯K2d),

    and its characteristic roots are as follows:

    λ1=vr<0,λ2=d(c¯c1).

    If c<¯c, then there is λ2<0, then EB(¯K,0) is a node and locally asymptotically stable. If c=¯c, there is λ2=0, then EB(¯K,0) is a saddle-node. Since for c¯c, there is ϕ(x)<0, i.e., dy/dt<0 for x[0,¯K), then y(t)0 as t. While dx/dt>0 for x[0,K) and y=0, then x(t)K, i.e., EB(¯K,0) is globally asymptotically stable.

    For c>¯c, there is ¯x<¯K. In such case, EB(¯K,0) is unstable.

    Theorem 2. For c>¯c, Model (2.1) has at least one and no more than three interior equilibria. Moreover, if ¯vv<r, then the interior equilibrium is unique. In addition, the interior equilibrium ˆE(ˆx,ˆy) is locally asymptotically stable if and only if ϕ(ˆx)<ψ(ˆx)<bcˆy/(bˆy+d).

    Proof. Since there are ψ(¯x)>0 and ψ(¯K)=0 for c>¯c, ϕ(¯x)=0, ϕ(¯K)>0, according to the mediocrity theorem, there exists at least one x(¯x,¯K) such that ψ(x)=ϕ(x), i.e., Model (2.1) has at least one interior equilibrium E(x,y), where y=ψ(x), as illustrated in Figure 1.

    Figure 1.  Illustration for y=ψ(x) and y=ϕ(x) for the following given model parameters: r=0.4, K=40, m=0.5, m0=0.1, a=15, c=0.8, b=0.02, d=0.01.

    For ¯vv<r, y=ψ(x) is monotonically decreasing on (¯x,¯K) and y=ϕ(x) is monotonically increasing on (¯x,¯K); therefore, y=ψ(x) and y=ϕ(x) have a unique intersection point, i.e., the interior equilibrium E(x,ψ(x)) is unique (Figure 1(d)).

    For 0<v<¯v, y=ϕ(x) is monotonically increasing and tends to saturation y=ysupcevmm0adab. Alternatively, y=ψ(x) is monotonically decreasing on (0,x1), monotonically increasing on (x1,x2), and monotonically decreasing on (x2,¯K), which forms a S-type on (0,¯K). Thus, y=ψ(x) and y=ϕ(x) have no more than three intersections, i.e., Model (2.1) has no more than three interior equilibria (Figure 1(b)).

    For the given interior equilibrium ˆE(ˆx,ˆy), the Jacobian matrix is as follows:

    JˆE(ˆx,ˆy)=(ˆxF1x(ˆx,ˆy)ˆxF1y(ˆx,ˆy)ˆyF2x(ˆx,ˆy)ˆyF2y(ˆx,ˆy))=(evmm0ˆx1+aˆx2ψ(ˆx)evmm0ˆx1+aˆx2bˆyϕ(ˆx)bˆy).

    Since

    Trace(JˆE(ˆx,ˆy))=ˆxevm+m0(1+aˆx2)ψ(ˆx)bˆy=ˆy[bˆy+dcˆyψ(ˆx)b],
    Det(JˆE(ˆx,ˆy))=bˆxˆyevm+m0(1+aˆx2)[ϕ(ˆx)ψ(ˆx)],

    if ϕ(ˆx)<ψ(ˆx)<bcˆy/(bˆy+d), then there are Trace(JˆE(ˆx,ˆy))<0 and Det(JˆE(ˆx,ˆy)) (i.e., the interior equilibrium ˆE(ˆx,ˆy) is locally asymptotically stable).

    In this segment, we will examine various characteristics of the stochastic prey-predator model.

    Theorem 3. For (x0,y0)R2+, Model (2.2) possesses a unique, global solution (x(t),y(t)) for t>0, which keeps positive with a probability with one.

    Proof. Denote x(t)=ep(t), y(t)=eq(t). Consider the following:

    {dp(t)=[r(1ep(t)K)ve(vm+m0)ep(t)+q(t)1+ae2p(t)]dt+σ1dB1(t),dq(t)=[ce(vm+m0)e2p(t)1+ae2p(t)beq(t)d]dt+σ2dB2(t). (4.1)

    It can be verified that Model (4.1) fulfills the Local Lipschitz Condition; then, for given p0=lnx0,q0=lny0, it guarantees the existence of a unique, locally positive solution (p(t),q(t)) on the interval [0,τe), where τe is the time of explosion. The Itˆo formula implies that (x(t),y(t))=(ep(t),eq(t)) is exactly the solution of Model (2.2).

    Next, it is sufficient to demonstrate that τe=. Let n0 be an integer satisfy (x0,y0)[1n0,n0]. For nn0, define the following:

    τn=inf{t[0,τe):min{x(t),y(t)}1normax{x(t),y(t)}n}.

    For an empty set ϕ, define infϕ=. It is evident that τn increases with n. Define τ=limnτn. Then, ττe. It is only necessary to prove that τ=.

    By contradiction, it is assumed that τ<. Then, there exist ε(0,1) and T>0 satisfying P{τT}>ε. Thus, nn0 such that

    P{τnT}>ε,nn. (4.2)

    Define the following:

    V(x,y)(x1lnx)+1c(y1lny).

    Clearly, V(x,y) is nonnegative because s1lns0 when s>0. Then,

    dV(x,y)=LVdt+(x1)σ1dB1(t)+1c(y1)σ2dB2(t),

    where

    LV=(x1)[r(1xK)ve(vm+m0)xy1+ax2]+σ212+1c(y1)[ce(vm+m0)x21+ax2byd]+σ222c=rxrx2Kvx+rxK+e(vm+m0)xy1+ax2dycby2c+byce(vm+m0)x21+ax2+(v+dcr)+σ212+σ222crxvxrx2K+rxK+e(vm+m0)yax+y(bcdcbyc)+v+dcr+σ212+σ222cΘ.

    Thus, it can be concluded that

    dVΘdt+(x1)σ1dB1(t)+1c(y1)σ2dB2(t).

    By taking expectations after integrating over the interval (0,τnT), we have the following:

    EV(x(τnT),y(τnT))V(x0,y0)+ΘE(τnT)V(x0,y0)+ΘT. (4.3)

    Denote Ωn={wΩ|τn=τn(w)T}. Then, P(Ωn)>ε by Eq (4.2). It can be obtained that x(τn,w) and y(τn,w) equal to either 1n or n for all wΩn. From Eq (4.3), we obtain the following:

    V(x0,y0)+ΘTE(1ΩnV(x(τn),y(τn)))εmin{1n1ln1n,n1lnn},

    which implies

    >V(x0,y0)+ΘT=asn.

    Therefore, we can obtain the following:

    P{τ=}=1.

    Define the following:

    λrvdσ212σ222δe(vm+m0)(rK+rv2e(vm+m0)δc)24(rKδae(vm+m0))(bd)24b,

    where δ(0,rKa).

    Theorem 4. For (x0,y0)R2+, Model (2.2) possesses a unique, ergodic stationary distribution for t0 if λ>0.

    Proof. Since

    d(xy)=(x[r(1xK)ve(vm+m0)xy1+ax2]y[ce(vm+m0)x21+ax2byd])dt+(σ1x0)dB1(t)+(0σ2y)dB2(t),

    its diffusion matrix is given by the following

    Λ(x,y)=(σ21x200σ22y2).

    Let θmin{σ21x2,σ22y2}. Then, it has

    2i,j=1λij(xy)ξiξj=σ21x2ξ21+σ22y2ξ22θ|ξ|2,

    so Lemma 1 condition (i) holds.

    To show Lemma 1 condition (ⅱ) holds, set the following:

    H(x,y)=M1(lnx+lnyxy)+12(cx+y)2=H1(x,y)+H2(x,y),

    where H1(x)=M1(lnx+lnyxy), H2(y)=12(cx+y)2, M1=2λmax{2,sup(x,y)R2+{b12x3+b2x2b32y3+b4y2}}>0, and bi>0 (for i=1,2,3,4), will be specified lately. H(x,y) tends to infinity when (x,y) tends to the boundary of R2+, so H(x,y) has a lower bound at (x,y)R2+. Define

    W(x,y)=H(x,y)H(x,y).

    For δ(0,rka), there are xy1+ax2xy, cx21+ax22δcx+δ(1+ax2) and cx2y1+ax2cxy2a.

    By the Itˆo formula, it has the following:

    LH1=M1[(1x)(rrxKve(vm+m0)xy1+ax2)σ212+(1y)(ce(vm+m0)x21+ax2byd)σ222]=M1[rrxKve(vm+m0)xy1+ax2rx+rx2K+vx+e(vm+m0)x2y1+ax2+ce(vm+m0)x21+ax2bydce(vm+m0)x2y1+ax2+by2+dyσ212σ222]M1(e(vm+m0)+ce(vm+m0)2a)xyM1(rvdσ212σ222δe(vm+m0))M1(rxKrx+vx+rx2K+2e(vm+m0)δcxδae(vm+m0)x2by+by2+dy)M1(e(vm+m0)+ce(vm+m0)2a)xyM1(rvdσ212σ222δe(vm+m0)(rK+rv2e(vm+m0)δc)24(rKδae(vm+m0))(bd)24b)=M1(e(vm+m0)+ce(vm+m0)2a)xyM1λ, (4.4)

    where λ=rvdσ212σ222δe(vm+m0)[rK+rv2e(vm+m0)δc]24[rKδae(vm+m0)](bd)24b.

    Similarly,

    LH2=(cx+y)[cx(rrxKve(vm+m0)xy1+ax2)+y(ce(vm+m0)x21+ax2byd)]+σ212c2x2+σ222y2=(cx+y)(rcxrcx2Kvcxby2dy)+σ212c2x2+σ222y2rc2x2rc2Kx3+rcxyby3+σ212c2x2+σ222y2=rc2Kx3+c2(r+σ212)x2by3+σ222y2+crxy. (4.5)

    Combining (4.4) and (4.5), we have the following:

    LWM1λrc2Kx3+c2(r+σ212)x2by3+σ222y2+[cr+M1(e(vm+m0)+ce(vm+m0)2a)]xy=M1λb1x3+b2x2b3y3+b4y2+b5xy, (4.6)

    where b1=rc2K, b2=c2(r+σ212), b3=b, b4=σ222, and b5=cr+M1[e(vm+m0)+ce(vm+m0)2a].

    Denote U=[ε,1/ε]×[ε,1/ε] for the given

    0<ε<min{M1λ4b5,b32b5,b12b5}, (4.7)
    1M1λ+M2min{b12ε3,b32ε3}, (4.8)

    where M2=sup(x,y)R2+{b12x3+b2x2b32y3+b4y2+b52(x2+y2)}. Then, R2+U can be divided into four regions, R2+U=Ω1Ω2Ω3Ω4, in which

    Ω1={(x,y)R2+|0<x<ε},Ω2={(x,y)R2+|0<y<ε},
    Ω3={(x,y)R2+|x>1ε},Ω4={(x,y)R2+|y>1ε}.

    Next, we will prove that LW1 on each Ωi (i=1,2,3,4), respectively.

    1) For (x,y)Ω1, there is xyεyε(1+y3). By (4.6) and (4.7), we obtain the following:

    LWM1λb1x3+b2x2b3y3+b4y2+εb5+εb5y3M1λ4(M1λ4εb5)(b32εb5)y3M1λ2b12x3+b2x2b32y3+b4y2M1λ41.

    2) For (x,y)Ω2, there is xyεxε(1+x3). By (4.6) and (4.7), we obtain the following:

    LWM1λb1x3+b2x2b3y3+b4y2+εb5+εb5x3M1λ4(M1λ4εb5)(b12εb5)x3M1λ2b12x3+b2x2b32y3+b4y2M1λ41.

    3) For (x,y)Ω3, by (4.6)–(4.8), we obtain the following:

    LWM1λb1x3+b2x2b3y3+b4y2+b52(x2+y2)M1λb12x3b12x3+b2x2b32y3+b4y2+b52(x2+y2)M1λb12ε3+M21.

    4) For (x,y)Ω4, by (4.6)–(4.8), we obtain the following:

    LWM1λb1x3+b2x2b3y3+b4y2+b52(x2+y2)M1λb32y3b32y3+b2x2b12x3+b4y2+b52(x2+y2)M1λb32ε3+M21.

    To sum up, condition (ⅱ) in Lemma 1 holds. Thus the Model (2.2) possesses a unique, ergodic stationary distribution.

    In this section, we will go into more detail on whether the solution is always bounded.

    Theorem 5. Model (2.2)'s solutions are stochastically ultimate bounded.

    Proof. Let V1(x,y)=x12+y12. Then,

    dV1(x,y)=LV1dt+σ12x12dB1(t)+σ22y12dB2(t),

    where

    LV1=12x12[r(1xK)ve(vm+m0)xy1+ax2]σ218x12+12y12[ce(vm+m0)x21+ax2byd]σ228y1212(rrxKσ214)x12+12(cae(vm+m0)bydσ224)y12=12(2+rrxKσ214)x12+12(2+cae(vm+m0)bydσ224)y12V1(x,y)P0V1(x,y),

    where P0 represents a positive constant, expressed as

    P0=sup(x,y)R2+{12(2+rrxKσ214)x12+12(2+cae(vm+m0)bydσ224)y12}.

    Then,

    dV1(x,y)(P0V1(x,y))dt+σ12x12dB1(t)+σ22y12dB2(t),

    so

    d(etV1(x,y))=et[V1(x,y)dt+dV1(x,y)]etP0dt+σ12x12etdB1(t)+σ22y12etdB2(t).

    Thus,

    E(etV1(x,y))=etE(V1(x,y))V1(x0,y0)+P0(et1)

    and

    lim supt+E(V1(x,y))P0lim supt+E|(x,y)|12P0.

    Therefore, for any normal number ε, set χ=P20ε2. Utilizing Chebyshev's inequality[31,37], there is the following:

    P{|(x,y)|>χ}E|(x,y)|12χsupP{|(x(t),y(t))|>χ}εast+.

    The objective of this section is to explore the extinction and persistence for the populations.

    Lemma 4. For Model (2.2), there are limt+sup{t1lnx(t)}0 and limt+sup{t1lny(t)}0.

    Proof. Since

    d(etlnx(t))=et(lnx+rrxKve(vm+m0)xy1+ax2σ212)dt+etσ1dB1(t), (4.9)

    then

    etlnx(t)=t0es(lnx(s)+rrx(s)kve(vm+m0)x(s)y(s)1+ax2(s)σ212)ds+t0esσ1dB1(s)+lnx0.

    Let M(t)=σ1t0esdB1(s). M(t) can be regarded as a localized harness that exhibits the following quadratic variance function:

    M(t),M(t)=σ21t0e2sds.

    Take μ>1 and γ>1. For kN, denote α=eγk, β=μeγklnk, T=γk. Then, according to the Exponential Martingale Inequality, it has the following:

    P(sup0tT{[Mα2M(t),M(t)]>β})1kμ.

    Since 1kμ<, then by the Borel-Cantelli lemma[31,37], there exists ΩF with P(Ω)=1 and the integer-valued random variable k0(w) such that for any ωΩ and kk0(ω), there is the following:

    M(t)μeγklnk+12eγkM(t),M(t),0tγk.

    Hence,

    etlnx(t)t0es(lnx(s)+rrx(s)Kve(vm+m0)x(s)y(s)1+ax2(s)σ212)ds+12eγkM(t),M(t)+μeγklnk+lnx0t0esQ(x(s))ds+μeγklnk+lnx0,

    where Q(x(s))=rrx(s)Kvσ212+σ212esγk+lnx(s). For any s that satisfies 0sγk, x(s)>0, a k-independent positive constant Φ0 can be found such that Q(x(s))Φ0, then, etlnx(t)lnx0Φ0(et1)+μeγklnk and lnx(t)Φ0(1et)+μeγktlnk+etlnx0. Then,

    lnx(t)tΦ0(1et)t+μeγkγ(k1)tlnk+etlnx0t.

    Let t; we obtain limtsuplnx(t)t0. In a similar way, one can establish limtsuplny(t)t0.

    Denote ηlimt+supx(t) and define the following:

    Δ1Kr(rvσ212),Δ2ce(vm+m0)adσ222,Δ3ce(vm+m0)aη21+aη2dσ222.

    Theorem 6. For Model (2.2)'s solution with a given (x0,y0)R2+, when Δ1<0, both species x and y will eventually go extinct; when Δ1>0, species x can keep weakly persistent; when Δ1>0 and Δ2<0, species x can keep persistent x(t)=Δ1 and species y will eventually go extinct; and when Δ1>0 and Δ3>0, both species x and y can keep weakly persistent.

    Proof. 1) Since

    dlnx=[r(1xK)ve(vm+m0)xy1+ax2σ212]dt+σ1dB1(t),

    then

    lnx(t)=t0(rrxKve(vm+m0)xy1+ax2σ212)ds+σ1B1(t)+lnx0.

    Subsequently, it has

    lnx(t)trvσ212+lnx0t+σ1B1(t)t,

    then

    lim supt+lnx(t)trvσ212=rKΔ1<0.

    Therefore, limt+x(t)=0.

    When Δ2<0, it has the following:

    dlny=(ce(vm+m0)x21+ax2bydσ222)dt+σ2dB2(t).

    Then,

    lny(t)lny0=t0(ce(vm+m0)x21+ax2bydσ222)ds+σ2B2(t).

    Thus,

    lny(t)tlny0t+cae(vm+m0)dσ222+σ2B2(t)t,

    i.e.,

    lim supt+lny(t)tcae(vm+m0)dσ222<0.

    Therefore, limty(t)=0.

    When Δ2>0, then for ε1 and ε2>0, T1 such that

    ce(vm+m0)x21+ax2ε1,lny0tε2

    hold for tT1. Thus,

    lny(t)t0(ε1bydσ222)ds+ε2t+σ2B2(t)=(ε1+ε2dσ222)tbt0y(s)ds+σ2B2(t).

    By the arbitrariness of ε1 and ε2 and Lemma 2, there is limty(t)=0.

    2) By contradiction. Assume Σ={limtsupx(t)=0} with P(Σ)>0. Thus,

    lnx(t)t=lnx0t+1tt0(rrxKve(vm+m0)xy1+ax2σ212)ds+σ1B1(t)t.

    Therefore, limtsupt1lnx(t)=rvσ212=rKΔ1>0. That means that limtsupt1lnx(t)>0 holds for any wΣ. There is an inclusion relation Σ{w:limtsupt1lnx(t)>0}, then P{w:limtsupt1lnx(t)>0}P(Σ)>0, which contradicts to limtsupt1lnx(t)0. Therefore, species x is weakly persistent.

    3) It is known that y(t) is extinct as limty(t)=0 when Δ2<0. From limt+lnx0t=0, it is known that for ε3,ε4>0, T2 such that ε3e(vm+m0)xy1+ax2ε3 and ε4lnx0tε4 hold for tT2. Obviously,

    lnx(t)tε4+t0(rrxKv+ε3σ212)ds+σ1B1(t)=(rv+ε3+ε4σ212)trKt0x(s)ds+σ1B1(t),
    lnx(t)tε4+t0(rrxKvε3σ212)ds+σ1B1(t)=(rvε3ε4σ212)trKt0x(s)ds+σ1B1(t).

    Based on Lemma 2, it can be deduced that x(t)Kr(rv+ε3+ε4σ212) and x(t)Kr(rvε3ε4σ212). Therefore, x(t)=Kr(rvσ212)=Δ1>0 (i.e., species x keeps in persistence (in the mean)).

    4) Similarly, by using the converse method, one can show that y is also weakly persistent.

    This section presents numerical simulations to illustrate the theoretical consequences presented in the study.

    For Model (2.1) with the model parameters r=0.4, K=100, v=0.36, m=0.5, m0=0.1, a=15, c=0.8, b=0.02 and d=0.01, there exist three interior equilibria: E1(0.26,0.46), E2(2.5,1.5) and E3(7.5,1.5), where E1 is a locally asymptotically stable focus, E2 is a saddle and unstable, and E3 is a locally asymptotically stable nodel, as illustrated in Figure 2.

    Figure 2.  Verification of Theorem 2. The tendency of the solution of Model (2.1) with different initial value for v=0.36 and a=15.

    For Model (2.2), let consider the following discrete form [38]:

    {xj+1=xj+xj(rrxjKe(vm+m0)xjyj1+a(xj)2)Δt+σ1xjΔtε1j+12σ21xj(ε21j1)Δt,yj+1=yj+yj(ce(vm+m0)(xj)21+a(xj)2byjd)Δt+σ2yjΔtε2j+12σ22yj(ε22j1)Δt,

    where ε1j, ε2j follow N(0,1), j=1,2,,n. Take σ1=0.02, σ2=0.01, δ=0.0001. For the above model parameters, there is λ=0.00286<0, and the condition in Theorem 4 does not hold. When v increases (e.g. v=0.38), Model (2.1) has a unique interior equilibrium E(0.193,0.213), which is a globally asymptotically stable focus, as presented in Figure 3(a). In such case, the condition in Theorem 4 does not hold due to λ=0.00136. For a=8, Model (2.1) has a globally asymptotically stable focus E(0.155,0.2), as presented in Figure 3(b). In such case, there is λ=0.000144>0, and the condition in Theorem 4 holds. As depicted in Figure 4, for Model (2.2), there exists an ergodic stationary distribution. It is observed that (x(t),y(t)) is stable at (0.155,0.2) without white noise. x(t) varies around 0.155 and y(t) fluctuates around 0.2 when the white noise is presented.

    Figure 3.  Verification of Theorem 2. The tendency of the solution of Model (2.1) with different initial value for given v=0.38 and (a) a=15, (b) a=8.
    Figure 4.  The distribution of x(t) and y(t) in Model (2.2) ((a) and (c)) and the densities of x(t) and y(t) in stochastic Model (2.2) and deterministic Model (2.1) with (x0,y0)=(1,1) ((b) and (d)).

    For Model (2.1) with the model parameters r=0.6, K=100, a=2, v=0.3, m=0.5, m0=0.01, c=0.8, b=0.01 and d=0.05, there is a unique interior equilibrium E(0.1914,0.208), which is locally asymptotically stable.

    Different levels of white noise are set to illustrate how white noise affects Model (2.2)'s dynamics. Taking σ1=0.2, σ2=0.1, it has Δ1>0, Δ3>0. Then, species x and species y can keep in a weak persistence, as shown in Figure 5(a), (b). This means that the white noise will have little impact on the populations. Let σ20.8; it has Δ1>0, Δ2<0. Therefore, species x can keep in persistence (in the mean), while species y will eventually go extinct, as shown in Figure 5(c), (d). It is evident that a larger white noise induces the predator to be eventually extinct. Let σ10.8; it has Δ1<0. Then, species x and species y will eventually go to extinction, as shown in Figure 5(e), (f). Make it clear that the higher the noise level, the more significant the impact on the species of prey.

    Figure 5.  The densities of species x and y for σ1=0.2, σ2=0.1 (a, b), σ1=0.2, σ2=0.8 (c, d) and σ1=0.8, σ2=0.1 (e, f).

    The predator's hunting ability is affected by a term evm, which decreases when m or v increases. For the parameter m, we select a range of diverse values and take σ1=0.2, σ2=0.1. The solution is presented in Figure 6. It is evident that x(t) greatly increases while y(t) increases to be a lesser extent when m rises from 0.5 to 5. There is little change in x(t) when m increases from 5 to 10, while y(t) will change from weakly persistent to eventually extinct. As a result, a modest increase in m benefits y, a large increase in m leads to the extinction of y, and an increase in m promotes the growth of x.

    Figure 6.  Time series of the stochastic Model (2.2) with different m.

    By varying the parameter v, the solutions are presented in Figure 7. Obviously, for a smaller v, species x and species y are both persistent; species y becomes extinct when v increases, and when the anti-predator level becomes excessively strong, species x and species y will eventually go extinct.

    Figure 7.  Time series of the stochastic Model (2.2) with different level v.

    The current work explored a Holling-Ⅲ prey-predator model by incorporating prey habitat selection in an environment with stochastic disturbances. For the model without stochastic disturbances, it was shown that O(0,0) is constantly unstable, while E(¯K,0) is stable when c¯cdevm+m0(a+¯K2). Additionally, it was shown that Model (2.1) possesses not more than three interior equilibria, and the interior equilibrium ˆE(ˆx,ˆy) is locally asymptotically stable if and only if ϕ(ˆx)<ψ(ˆx)<bcˆy/(bˆy+d).

    Additionally, we investigated the dynamics of Model (2.2). By devising an appropriate Lyapunov function, it obtained the conditions for an ergodic stationary distribution. Furthermore, it was demonstrated that Model (2.2)'s solutions are stochastically, eventually bounded. The results suggest that white noise will eventually cause the extinction of prey and predators when it has a large impact on the prey x(t) (Δ1<0). When the white noise has more impact on the predators and less disturbance to the prey, the prey can persist (in the mean), and the predators become extinct (Δ1>0, Δ2<0). The prey and the predator are weakly persistent when white noise has a small effect on them.

    Compared to deterministic models, it is well known that sometimes less intense white noise contributes to the survival of prey; however, white noise with a high intensity is unfavorable to the survival of the population. When the hunting ability of the predator is affected by the evm term, an increase in m favors the growth of x, a small increase in m would benefit y, while a large increase in m would lead to the demise of y. The population survival is significantly impacted by anti-predatory behavior. It indicated that x(t) and y(t) can persistently survive when the anti-predator level is small. The population y(t) becomes extinct with an increase of the anti-predator level. The prey and predator eventually go extinct when the anti-predator level becomes excessively strong. Incorporating habitat selection and white noise interference into predator-prey models allows for more accurate estimates of changes in natural populations and a deeper understanding of the mechanisms of species interactions and ecological balance. The results suggest that populations may tend to go extinct when the white noise is high or the habitat selection behavior is strong. Therefore, we can carry out an early warning and take effective intervention and protection measures, such as establishing protected areas, improving the habitat environment, controlling the intensity of the white noise interference, and so on.

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

    The work was supported by the National Natural Science Foundation of China (No. 11401068).

    The authors declare there is no conflicts of interest.



    [1] X. Xue, J. Chen, Matching biomedical ontologies through compact differential evolution algorithm with compact adaption schemes on control parameters, Neurocomputing, 458 (2021), 526–534. https://doi.org/10.1016/j.neucom.2020.03.122 doi: 10.1016/j.neucom.2020.03.122
    [2] X. Xue, Y. Wang, Ontology alignment based on instance using NSGA-Ⅱ, J. Inf. Sci., 41 (2015), 58–70. https://doi.org/10.1177/0165551514550142 doi: 10.1177/0165551514550142
    [3] D. S. Silva, M. Holanda, Applications of geospatial big data in the Internet of Things, Trans. GIS, 26 (2022), 41–71. https://doi.org/10.1111/tgis.12846 doi: 10.1111/tgis.12846
    [4] T. Xu, J. Jiang, A graph adaptive density peaks clustering algorithm for automatic centroid selection and effective aggregation, Expert Syst. Appl., 195 (2022), 116539. https://doi.org/10.1016/j.eswa.2022.116539 doi: 10.1016/j.eswa.2022.116539
    [5] F. U. Siddiqui, A. Yahya, F. U. Siddiqui, A. Yahya, Partitioning clustering techniques, in Clustering Techniques for Image Segmentation, Springer, (2022), 35–67. https://doi.org/10.1007/978-3-030-81230-0_2
    [6] F. U. Siddiqui, A. Yahya, F. U. Siddiqui, A. Yahya, Novel partitioning clustering, in Clustering Techniques for Image Segmentation, Springer, (2022), 69–91. https://doi.org/10.1007/978-3-030-81230-0_3
    [7] C. K. Reddy, B. Vinzamuri, A survey of partitional and hierarchical clustering algorithms, in Data Clustering, Chapman and Hall/CRC, (2018), 87–110. https://doi.org/10.1201/9781315373515-4
    [8] S. Zhou, Z. Xu, F. Liu, Method for determining the optimal number of clusters based on agglomerative hierarchical clustering, IEEE Trans. Neural Networks Learn. Syst., 28 (2016), 3007–3017. https://doi.org/10.1109/TNNLS.2016.2608001 doi: 10.1109/TNNLS.2016.2608001
    [9] E. C. Chi, K. Lange, Splitting methods for convex clustering, J. Comput. Graphical Stat., 24 (2015), 994–1013. https://doi.org/10.1080/10618600.2014.948181 doi: 10.1080/10618600.2014.948181
    [10] M. Ester, H. P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in kdd, 96 (1996), 226–231.
    [11] P. Bhattacharjee, P. Mitra, A survey of density based clustering algorithms, Front. Comput. Sci., 15 (2021), 1–27. https://doi.org/10.1007/s11704-019-9059-3 doi: 10.1007/s11704-019-9059-3
    [12] A. Rodriguez, A. Laio, Clustering by fast search and find of density peaks, Science, 344 (2014), 1492–1496. https://doi.org/10.1126/science.1242072 doi: 10.1126/science.1242072
    [13] S. Sieranoja, P. Fränti, Fast and general density peaks clustering, Pattern Recognit. Lett., 128 (2019), 551–558. https://doi.org/10.1016/j.patrec.2019.10.019 doi: 10.1016/j.patrec.2019.10.019
    [14] A. Joshi, E. Fidalgo, E. Alegre, L. Fernández-Robles, SummCoder: An unsupervised framework for extractive text summarization based on deep auto-encoders, Expert Syst. Appl., 129 (2019), 200–215. https://doi.org/10.1016/j.eswa.2019.03.045 doi: 10.1016/j.eswa.2019.03.045
    [15] J. Xie, R. Girshick, A. Farhadi, Unsupervised deep embedding for clustering analysis, in International Conference on Machine Learning, PMLR, (2016), 478–487. https://doi.org/10.48550/arXiv.1511.06335
    [16] M. Gori, G. Monfardini, F. Scarselli, A new model for learning in graph domains, in Proceedings. 2005 IEEE International Joint Conference on Neural Networks, IEEE, (2005), 729–734. https://doi.org/10.1109/IJCNN.2005.1555942
    [17] C. Wang, S. Pan, R. Hu, G. Long, J. Jiang, C. Zhang, Attributed graph clustering: A deep attentional embedding approach, preprint, arXiv: 1906.06532.
    [18] R. Jothi, S. K. Mohanty, A. Ojha, Fast approximate minimum spanning tree based clustering algorithm, Neurocomputing, 272 (2018), 542–557. https://doi.org/10.1016/j.neucom.2017.07.038 doi: 10.1016/j.neucom.2017.07.038
    [19] J. C. Gower, G. J. Ross, Minimum spanning trees and single linkage cluster analysis, J. R. Stat. Soc. C, 18 (1969), 54–64. https://doi.org/10.2307/2346439 doi: 10.2307/2346439
    [20] C. T. Zahn, Graph-theoretical methods for detecting and describing gestalt clusters, IEEE Trans. Comput., 100 (1971), 68–86. https://doi.org/10.1109/T-C.1971.223083 doi: 10.1109/T-C.1971.223083
    [21] O. Grygorash, Y. Zhou, Z. Jorgensen, Minimum spanning tree based clustering algorithms, in 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06), IEEE, (2006), 73–81. https://doi.org/10.1109/ICTAI.2006.83
    [22] A. C. Müller, S. Nowozin, C. H. Lampert, Information theoretic clustering using minimum spanning trees, in Joint DAGM (German Association for Pattern Recognition) and OAGM Symposium, Springer, (2012), 205–215. https://doi.org/10.1007/978-3-642-32717-9_21
    [23] M. Gagolewski, M. Bartoszuk, A. Cena, Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm, Inf. Sci., 363 (2016), 8–23. https://doi.org/10.1016/j.ins.2016.05.003 doi: 10.1016/j.ins.2016.05.003
    [24] Y. Ma, H. Lin, Y. Wang, H. Huang, X. He, A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint, Inf. Sci., 557 (2021), 194–219. https://doi.org/10.1016/j.ins.2020.12.016 doi: 10.1016/j.ins.2020.12.016
    [25] G. Mishra, S. K. Mohanty, A fast hybrid clustering technique based on local nearest neighbor using minimum spanning tree, Expert Syst. Appl., 132 (2019), 28–43. https://doi.org/10.1016/j.eswa.2019.04.048 doi: 10.1016/j.eswa.2019.04.048
    [26] F. Şaar, A. E. Topcu, Minimum spanning tree‐based cluster analysis: A new algorithm for determining inconsistent edges, Concurrency Comput. Pract. Exper., 34 (2022), e6717. https://doi.org/10.1002/cpe.6717 doi: 10.1002/cpe.6717
    [27] H. A. Chowdhury, D. K. Bhattacharyya, J. K. Kalita, UIFDBC: Effective density based clustering to find clusters of arbitrary shapes without user input, Expert Syst. Appl., 186 (2021), 115746. https://doi.org/10.1016/j.eswa.2021.115746 doi: 10.1016/j.eswa.2021.115746
    [28] R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J., 36 (1957), 1389–1401. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x doi: 10.1002/j.1538-7305.1957.tb01515.x
    [29] F. Ros, S. Guillaume, Munec: a mutual neighbor-based clustering algorithm, Inf. Sci., 486 (2019), 148–170. https://doi.org/10.1016/j.ins.2019.02.051 doi: 10.1016/j.ins.2019.02.051
    [30] D. Steinley, Properties of the hubert-arable adjusted rand index, Psychol. Methods, 9 (2004), 386. https://doi.org/10.1037/1082-989X.9.3.386 doi: 10.1037/1082-989X.9.3.386
    [31] P. A. Estévez, M. Tesmer, C. A. Perez, J. M. Zurada, Normalized mutual information feature selection, IEEE Trans. Neural Networks, 20 (2009), 189–201. https://doi.org/10.1109/TNN.2008.2005601 doi: 10.1109/TNN.2008.2005601
    [32] M. Sato-Ilic, On evaluation of clustering using homogeneity analysis, in IEEE International Conference on Systems, Man and Cybernetics, IEEE, 5 (2000), 3588–3593. https://doi.org/10.1109/ICSMC.2000.886566
    [33] P. Fränti, Clustering datasets, 2017. Available from: https://cs.uef.fi/sipu/datasets.
    [34] 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
    [35] D. Dua, C. Graff, UCI Machine Learning Repository, 2017. Available from: https://archive.ics.uci.edu/ml.
    [36] J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc., 7 (1956), 48–50.
  • This article has been cited by:

    1. Jawdat Alebraheem, A review in stability of stochastic prey–predator models, 2025, 1436-3240, 10.1007/s00477-025-03021-0
  • Reader Comments
  • © 2023 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(3642) PDF downloads(203) Cited by(0)

Figures and Tables

Figures(18)  /  Tables(6)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog