Research article Special Issues

Improving modularity score of community detection using memetic algorithms

  • With the growth of online networks, understanding the intricate structure of communities has become vital. Traditional community detection algorithms, while effective to an extent, often fall short in complex systems. This study introduced a meta-heuristic approach for community detection that leveraged a memetic algorithm, combining genetic algorithms (GA) with the stochastic hill climbing (SHC) algorithm as a local optimization method to enhance modularity scores, which was a measure of the strength of community structure within a network. We conducted comprehensive experiments on five social network datasets (Zachary's Karate Club, Dolphin Social Network, Books About U.S. Politics, American College Football, and the Jazz Club Dataset). Also, we executed an ablation study based on modularity and convergence speed to determine the efficiency of local search. Our method outperformed other GA-based community detection methods, delivering higher maximum and average modularity scores, indicative of a superior detection of community structures. The effectiveness of local search was notable in its ability to accelerate convergence toward the global optimum. Our results not only demonstrated the algorithm's robustness across different network complexities but also underscored the significance of local search in achieving consistent and reliable modularity scores in community detection.

    Citation: Dongwon Lee, Jingeun Kim, Yourim Yoon. Improving modularity score of community detection using memetic algorithms[J]. AIMS Mathematics, 2024, 9(8): 20516-20538. doi: 10.3934/math.2024997

    Related Papers:

    [1] Ning Cui, Junhong Li . A new 4D hyperchaotic system and its control. AIMS Mathematics, 2023, 8(1): 905-923. doi: 10.3934/math.2023044
    [2] Junhong Li, Ning Cui . A hyperchaos generated from Rabinovich system. AIMS Mathematics, 2023, 8(1): 1410-1426. doi: 10.3934/math.2023071
    [3] Shutong Liu, Renming Yang . Adaptive predefined-time robust control for nonlinear time-delay systems with different power Hamiltonian functions. AIMS Mathematics, 2023, 8(12): 28153-28175. doi: 10.3934/math.20231441
    [4] Xue Geng, Liang Guan, Dianlou Du . Action-angle variables for the Lie-Poisson Hamiltonian systems associated with the three-wave resonant interaction system. AIMS Mathematics, 2022, 7(6): 9989-10008. doi: 10.3934/math.2022557
    [5] Mostafa M. A. Khater, Mohammed Zakarya, Kottakkaran Sooppy Nisar, Abdel-Haleem Abdel-Aty . Dynamics and stability analysis of nonlinear DNA molecules: Insights from the Peyrard-Bishop model. AIMS Mathematics, 2024, 9(9): 23449-23467. doi: 10.3934/math.20241140
    [6] Weiwei Sun, Mengyang Qiu, Xinyu Lv . H filter design for a class of delayed Hamiltonian systems with fading channel and sensor saturation. AIMS Mathematics, 2020, 5(4): 2909-2922. doi: 10.3934/math.2020188
    [7] Jia Li, Xia Li, Chunpeng Zhu . Reducibility for a class of almost periodic Hamiltonian systems which are degenerate. AIMS Mathematics, 2023, 8(1): 2296-2307. doi: 10.3934/math.2023119
    [8] A. M. Alqahtani, Shivani Sharma, Arun Chaudhary, Aditya Sharma . Application of Caputo-Fabrizio derivative in circuit realization. AIMS Mathematics, 2025, 10(2): 2415-2443. doi: 10.3934/math.2025113
    [9] Erfeng Xu, Wenxing Xiao, Yonggang Chen . Local stabilization for a hyperchaotic finance system via time-delayed feedback based on discrete-time observations. AIMS Mathematics, 2023, 8(9): 20510-20529. doi: 10.3934/math.20231045
    [10] Tingting Ma, Yuehua He . An efficient linearly-implicit energy-preserving scheme with fast solver for the fractional nonlinear wave equation. AIMS Mathematics, 2023, 8(11): 26574-26589. doi: 10.3934/math.20231358
  • With the growth of online networks, understanding the intricate structure of communities has become vital. Traditional community detection algorithms, while effective to an extent, often fall short in complex systems. This study introduced a meta-heuristic approach for community detection that leveraged a memetic algorithm, combining genetic algorithms (GA) with the stochastic hill climbing (SHC) algorithm as a local optimization method to enhance modularity scores, which was a measure of the strength of community structure within a network. We conducted comprehensive experiments on five social network datasets (Zachary's Karate Club, Dolphin Social Network, Books About U.S. Politics, American College Football, and the Jazz Club Dataset). Also, we executed an ablation study based on modularity and convergence speed to determine the efficiency of local search. Our method outperformed other GA-based community detection methods, delivering higher maximum and average modularity scores, indicative of a superior detection of community structures. The effectiveness of local search was notable in its ability to accelerate convergence toward the global optimum. Our results not only demonstrated the algorithm's robustness across different network complexities but also underscored the significance of local search in achieving consistent and reliable modularity scores in community detection.



    In 1965, Zadeh [18] introduced the concept of fuzzy theory, which has since undergone extensive research and various applications, including Choquet integrals of set-valued functions [5,6,20,21,22], fuzzy set-valued measures [9,10,16], fuzzy random variable applications [1,4,17], theory for general quantum systems interacting with linear dissipative systems [3], and more. The relationship between fuzzy theory and probability theory has been a subject of much discussion [1,12,14], as both frameworks aim to capture the concept of uncertainty using membership functions and probability density functions (PDFs) whose values lie within the interval [0, 1].

    Fuzzy theory and probability theory are two distinct mathematical frameworks, each with their own approach to modeling uncertainty. Fuzzy theory represents imprecision and vagueness in human reasoning using fuzzy sets, which assign degrees of membership to elements of a universe of discourse. Probability theory deals with randomness and uncertainty using probability distributions, which assign probabilities to outcomes of a random event. Despite their differences, both frameworks allow the expression of uncertainty using values that lie within the range of [0, 1], and they provide a means for decision-making under uncertainty, incorporating expert knowledge and data.

    Research has explored the relationships between fuzzy theory and probability theory, revealing similarities in terms of mathematical structure and some analytical tools. For instance, fuzzy measures can be viewed as a generalization of probability measures, and Choquet integrals of set-valued functions are analogous to probability integrals. While the majority of fuzzy probability measure theories [7,13,15,19] have traditionally considered probability as the expected value of the membership function of fuzzy events, however, by using fuzzifying a PDF we define the fuzzifying probability of crisp events.

    In this study, we propose the concept of fuzzifying probability for continuous random variables in the context of crisp events, along with its properties and associations with conventional probability theories. Therefore, fuzzy theory can be seen as an extension or generalization of probability theory. The main objective of this study is to introduce fuzzifying probability density functions and to investigate related properties by applying the concepts of fuzzifying probability of crisp events. This approach enables investigation of the ambiguities of the PDF and their impact on probability theories. Relevant definitions in probability theory will be briefly recalled to facilitate this investigation.

    Definition 1.1. [8] Let S be a sample space and X be a real-valued continuous random variable on S. Then, a function fX:SR+ is a PDF of X if it satisfies the following criteria:

    (i) fX(x) is positive everywhere in the support S, i.e., fX(x)>0 for all xS, and

    (ii) SfX(x)dx=1.

    If fX(x) is a PDF of the random variable X, then the probability P that X belongs to an event E is defined as

    P(XE)=EfX(x)dx.

    Definition 1.2. [8] Let A be the σ-algebra of a sample space S. A real-valued function P on A is a probability if P satisfies the following properties:

    (i) P(E)0 for all EA,

    (ii) P(S)=1 and P()=0, and

    (iii) For any sequence of events {E1,E2,} with EiEj=(ij), it holds

    P(n=1En)=n=1P(En).

    We next recall some basic fuzzy theory notions and definitions. Let U and V be two universal sets and g:UV be a crisp function between these sets. Then the fuzzifying function ˜g:UF(V) is a mapping from the same domain to a new range F(V) comprising the family of all fuzzy sets on V. The fuzzy set ˜AF(V) of V can be expressed as

    ˜A={(v,m˜A(v))|vV},

    where m˜A:V[0,1] is a membership function of ˜A (For more details see [2,11]). Recall that a fuzzy set ˜A is said to be normal if there exists v0V such that m˜A(v0)=1.

    Let I([0,1]) be the set of all intervals in [0,1] whose elements are described as

    I([0,1]):={[a,a+]|0aa+1}.

    In particular, we consider a=[a,a] for any a[0,1]. Then the interval operators in I([0,1]) are defined as follows.

    Definition 1.3. [5,6,12] For each ˉa=[a,a+],ˉb=[b,b+]I([0,1]), the arithmetic, comparison, and inclusion operators can be expressed as follows.

    (i) ˉa+ˉb=[a+b,a++b+],

    (ii) kˉa=[ka,ka+] for all k[0,1],

    (iii) ˉaˉb=[ab,a+b+],

    (iv) ˉaˉb=[ab,a+b+],

    (v) ˉaˉb=[ab,a+b+],

    (vi) ˉaˉb if and only if ab and a+b+,

    (vii) ˉa<ˉb if and only if ˉaˉb and ˉaˉb, and

    (viii) ˉaˉb if and only if ba and a+b+.

    Also, algebraic operations of fuzzy sets are defined as follows.

    Definition 1.4. [11] Let X be a nonempty set and ˜A and ˜B be fuzzy sets of X.

    (i) The α-cut ˜Aα of a fuzzy set ˜A is defined as

    ˜Aα={xX|m˜A(x)α}.

    (ii) The algebraic sum ˜A+˜B of two fuzzy sets ˜A and ˜B of X is defined as

    (˜A+˜B)α=˜Aα+˜Bα for all α[0,1],

    provided ˜Aα+˜Bα[0,1].

    (iii) The algebraic product ˜A˜B of two fuzzy sets ˜A and ˜B of X is defined as

    (˜A˜B)α=˜Aα˜Bα for all α[0,1].

    Let A be a measurable subset of U and f be an integrable function on U. If ˜f is a fuzzifying function, then the fuzzifying integral [11] of ˜f over A is defined as

    (F)A˜f(x)dx:={([Afα(x)dx,Af+α(x)dx],α)|α[0,1]}, (1.1)

    where fα and f+α are α-cut functions of ˜f(x), i.e.,

    (˜f(x))α=[fα(x),f+α(x)] for all xA.

    Let S be a sample space with continuous random variable X:SR and F(R+) be the family of all fuzzy sets on [0,). Using the concepts [2] of fuzzifying functions to a PDF fX:S[0,), we define a fuzzifying PDF ˜fX as follows. In order to facilitate theoretical development throughout the remainder of the paper, it is assumed that the fuzzifying PDF ˜fX is integrable for all α-cuts.

    Definition 2.1. Let X be a continuous random variable and fX be a PDF of X. Then we define the fuzzifying PDF ˜fX:SF(R+) by fuzzifying fX that satisfies the following conditions:

    (i) ˜fX(x)>0 for all xS, i.e.,

    m˜fX(x)>0 for all xS,

    where m˜fX(x)>0 means that there exists uR+ such that m˜fX(x)(u)>0.

    (ii) The fuzzifying integration (1.1) of ˜fX satisfies

    (F)S˜fX(x)dx=˜1,

    where ˜1 is a convex fuzzy set [11] of 1 with m˜1(1)=1.

    Note that from (1.1), the fuzzy set ˜1 in Definition 2.1 (ii) has its α-cuts

    (˜1)α={[SfXα(x)dx,Sf+Xα(x)dx] if 0α<1,SfX(x)dx=1 if α=1.

    If ˜fX is a fuzzifying PDF of X, then the fuzzifying probability ˜P that X belongs to some event E is given by the fuzzifying integral of ˜fX over E, i.e.,

    ˜P(XE)=(F)E˜fX(x)dx. (2.1)

    We consider the fuzzifying probability using the concept of fuzzifying functions in a similar way.

    Definition 2.2. Let A be a σ-algebra of a sample space S and P:A[0,1] be a probability. Then the fuzzifying function ˜P:AF([0,1]) is called the fuzzifying probability if the following conditions are satisfied:

    (i) 0˜P(E)1 for each event E of S.

    (ii) ˜P(S)=˜1, where ˜1 is a convex fuzzy set satisfying m˜1(1)=1.

    (iii) For any sequence of events {E1,E2,} with EiEj=(ij), it holds

    ˜P(n=1En)=n=1˜P(En).

    The following theorem follows from Definitions 2.1 and 2.2.

    Theorem 2.3. Let ˜fX be a fuzzifying PDF for a continuous random variable X and ˜P be the fuzzifying probability with the density function ˜fX given by (2.1). Then ˜P is a fuzzifying probability.

    Proof. We need only show that ˜P satisfies the three conditions in Definition 2.2.

    (i) Let E be an element of S. Then from (1.1) and (2.1),

    ˜P(XE)=(F)E˜fX(x)dx={([EfXα(x)dx,Ef+Xα(x)dx],α)|α[0,1]}.

    Since 0EfXα(x)dxEf+Xα(x)dx1 for all α[0,1], it implies 0˜P(XE)1. Thus the first condition holds.

    (ii) Since ˜fX1(x)=fX(x) for all xS, the α-cut of ˜P(XS) at α=1 can be expressed as

    (˜P(XS))1=[SfX1(x)dx,Sf+X1(x)dx]=[SfX(x)dx,SfX(x)dx]=1.

    Hence the second condition is satisfied.

    (iii) Let {E1,E2,} be a sequence of disjoint events. Then

    ˜P(Xn=1En)={([n=1EnfXα(x)dx,n=1Enf+Xα(x)dx],α)|α[0,1]}={([n=1(EnfXα(x)dx,Enf+Xα(x)dx]),α)|α[0,1]}=n=1{([EnfXα(x)dx,Enf+Xα(x)dx],α)|α[0,1]}=n=1˜P(XEn).

    Thus, third condition is satisfied, which completes the proof.

    Remark 2.4. Theorem 2.3 confirms the fuzzifying probability is a fuzzifying probability. Thus, we consider the fuzzifying probability to be ˜P(E)=˜P(XE).

    Recall the negative-scalar product [11]: for kR=(,0) and some interval [a,b] in R=(,) with ab, the product [a,b] by k can be expressed as

    k[a,b]=[kb,ka]. (2.2)

    Consider a fuzzy set ˜P(E) for ES whose α-cuts are defined by

    (˜P(E))α={[Ef+Xα(x)dx,EfXα(x)dx] if 0α<1,EfX(x)dx=P(E) if α=1. (2.3)

    Then the fuzzifying probability establishes the following property.

    Theorem 2.5. Let X be a continuous random variable on a sample space S and ˜P be a fuzzifying probability. Then

    (i) ˜P(Ec)=˜1˜P(E) for ES,

    (ii) ˜P()=0,

    (iii) If E1E2 in S, then ˜P(E1)˜P(E2).

    Proof. We need only show that ˜P satisfies the conditions.

    (i) From (2.2) with Ec=SE,

    ˜P(Ec)=(F)Ec˜fX(x)dx={([EcfXα(x)dx,Ecf+Xα(x)dx],α)|α[0,1]}={([SfXα(x)dxEfXα(x)dx,Sf+Xα(x)dxEf+Xα(x)dx],α)|α[0,1]}={([SfXα(x)dx,Sf+Xα(x)dx][Ef+Xα(x)dx,EfXα(x)dx],α)|α[0,1]}=˜1˜P(E),

    where the fuzzy set ˜P(E) is given by (2.3).

    (ii) The second condition is trivially satisfied by the definition

    ˜P()={([fXα(x)dx,f+Xα(x)dx],α)|α[0,1]}=0.

    (iii) Since E2fXα(x)dxE1fXα(x)dx and E1f+Xα(x)dxE2f+Xα(x)dx for all α[0,1],

    ˜P(E1)={([E1fXα(x)dx,E1f+Xα(x)dx],α)|α[0,1]}{([E2fXα(x)dx,E2f+Xα(x)dx],α)|α[0,1]}=˜P(E2).

    We present an example of the fuzzifying probability obtained from a fuzzifying PDF.

    Example 2.6. Let X be a continuous random variable with PDF fX(x)=3x2,0x1. Then, we consider the fuzzifying PDF ˜fX(x)=˜3x2,0x1 of fX, where a fuzzy set ˜3 of the constant 3 is given by

    m˜3(u)={u2 if 2u3,12u+52 if 3<u5.

    Note that the membership function of the fuzzifying function is given by

    m˜fX(x)(u)=m˜3x2(u)={(u2)x2 if 2u3,(12u+52)x2 if 3<u5.

    From Definition 2.1 (iii), the corresponding fuzzifying probability can be expressed as

    ˜P(0<X<13)=(F)130˜fX(x)dx={([130fXα(x)dx,130f+Xα(x)dx],α)|α[0,1]}, (2.4)

    where

    ˜fXα(x)=[fXα(x),f+Xα(x)]:=[(α+2)x2,(52α)x2] for all α[0,1].

    Thus, from (2.4),

    ˜P(0<X<13)={([130(α+2)x2dx,130(52α)x2dx],α)|α[0,1]}={([α+234,52α34],α)|α[0,1]}, (2.5)

    and hence,

    (˜P(0<X<13))α=[α+234,52α34].

    Therefore, the membership of the fuzzifying probability ˜P for 0<X<13 is given by

    m˜P(0<X<13)(u)={34u2 if 234u133,534u2 if 133u534.

    Note that the probability P over 0<X<13 is given by

    P(0<X<13)=1303x2dx=133.

    Therefore, as observed in the graph of the membership function m˜P(0<X<13) in Figure 2, we see that ˜P(0<X<13) establishes a normal fuzzy set of 133 since m˜P(0<X<13)(133)=1.

    Figure 1.  Membership function of a fuzzy set ˜3.
    Figure 2.  Membership function of fuzzifying probability ˜P(0<X<13).

    We define the fuzzifying expected value of a random variable X with the fuzzifying PDF ˜fX as

    ˜E(X)=(F)x˜fX(x)dx={([xfXα(x)dx,xf+Xα(x)dx],α)|α[0,1]}

    and the fuzzifying expected value for a measurable function g(X) of X for ˜fX as

    ˜E(g(X))=(F)g(x)˜fX(x)dx.

    Thus, we can derive the fuzzifying n-th moment of a random variable as follows.

    Theorem 3.1. Let X be a continuous random variable with PDF fX and μn=E(Xn) be the n-th moment about the origin for X. If ˜fX is a fuzzifying PDF, then ˜E(Xn)=˜μn is a fuzzy set of μn and (˜μn)1=μn for each nN.

    Proof. The definition of ˜E directly provides that

    ˜E(Xn)=(F)xn˜fX(x)dx={([xnfXα(x)dx,xnf+Xα(x)dx],α)|α[0,1]}, (3.1)

    hence ˜E(Xn)=˜μn is a fuzzy set of μn. The α-cut of ˜E(Xn) at α=1 in (3.1) can be expressed as

    (˜E(Xn))1=[xnfX1(x)dx,xnf+X1(x)dx]=[xnfX(x)dx,xnfX(x)dx]=E(Xn), (3.2)

    thus (˜μn)1=μn.

    We now proceed to introduce the concept of the fuzzifying variance of a random variable with a fuzzifying PDF, expressed in terms of the fuzzifying expected value.

    Theorem 3.2. If X is a random variable with a fuzzifying PDF fX and μ=E(X) is the expected value of X, then fuzzifying variance ~Var(X) of X can be expressed as

    ~Var(X)=˜E((Xμ)2)=˜E(X2)2μ˜μ+˜1μ2,

    where ˜μ=˜E(X) and ˜1={([fXα(x)dx,f+Xα(x)dx],α)|α[0,1]}.

    Proof. From the definition of the fuzzifying variance,

    ~Var(X)=˜E((Xμ)2)={([x2fXα(x)dx,x2f+Xα(x)dx],α)|α[0,1]}2μ{([xfXα(x)dx,xf+Xα(x)dx],α)|α[0,1]}+μ2{([fXα(x)dx,f+Xα(x)dx],α)|α[0,1]}=˜E(X2)2μ˜μ+˜1μ2.

    Remark 3.3. Theorem 3.2 shows the fuzzy set

    ˜1={([fXα(x)dx,f+Xα(x)dx],α)|α[0,1]}

    is a generalization of the constant 1. Since fX1=f+X1=fX when α=1, (˜1)1 is a PDF of X, hence

    (˜1)1=[fX1(x)dx,f+X1(x)dx]=[fX(x)dx,fX(x)dx]=fX(x)dx=1.

    We extend Example 2.6 to introduce the concept of fuzzifying expected value and fuzzifying variance, and establish their relationship with the corresponding crisp measures.

    Example 3.4. Consider ˜fX(x)=˜3x2 in Example 2.6. Then, the fuzzifying expected value of X when n=1 in Theorem 3.1 is

    ˜E(X)={([xfXα(x)dx,xf+Xα(x)dx],α)|α[0,1]}, (3.3)

    where ˜fXα(x)=(α+2)x2 and ˜f+Xα(x)=(52α)x2 for all α[0,1].

    Therefore,

    ˜E(X)={([x3(α+2)dx,x3(52α)dx],α)|α[0,1]}={([α+24,52α4],α)|α[0,1]}. (3.4)

    Thus, (˜E(X))α=[α+24,52α4], and hence

    m˜E(X)(u)={4u2 if 12u34,54u2 if 34u54. (3.5)

    Since E(X)=10x3dx=34, ˜E(X) can be represented by a fuzzy set ~34 (see Figure 3).

    Figure 3.  Membership function of fuzzifying expected value ˜E(X).

    We can express ˜E(X2) and E(X2) as

    ˜E(X2)={([x4(α+2)dx,x4(52α)dx],α)|α[0,1]}={([α+25,52α5],α)|α[0,1]}, (3.6)

    hence (˜E(X))α=[α+25,52α5] for all α[0,1] and E(X2)=103x4dx=35. Thus ˜E(X2) comprises a fuzzy set ~35 (Figure 3). From Theorem 3.2,

    ~Var(X)=˜E(X2)2˜μ+˜1μ2,

    where ˜1 satisfies

    ˜1={([10x2(α+2)dx,10x2(52α)dx],α)|α[0,1]}={([α+23,52α3],α)|α[0,1]},

    and hence the membership function of ˜1 is

    m˜1(u)={3u2 if 23u1,53u2 if 1u53.

    From (2.2),

    (~Var(X))α=(˜E(X2))α2μ(˜μ)α+μ2(˜1)α=[α+280,52α80]

    for each α[0,1]. Thus, the fuzzifying variance ~Var(X) is

    ~Var(X)={([α+280,52α80],α)|α[0,1]},

    and the membership function of the fuzzifying variance is

    m~Var(X)(u)={80u2 if 140u380,580u2 if 380u580.

    Since Var(X)=E(X2)(E(X))2=35(34)2=380, ~Var(X) is a fuzzy set of 380 (see Figure 4).

    Figure 4.  Membership function of fuzzifying variance ~Var(X).

    In conclusion, the expression for the linearity of expectations for a random variable with a fuzzifying PDF is as follows.

    Theorem 3.5. Let gj be integrable functions of a random variable X and kj be positive integers for j=1,2,,m. Then,

    ˜E(mj=1kjgj(X))=mj=1kj˜E(gj(X)).

    Proof. Since gj(X)˜fX(x)=gj(X)[fXα(x),f+Xα(x)]=[gj(X)fXα(x),gj(X)f+Xα(x)] for all x,

    ˜E(mj=1kjgj(X))=(F)mj=1kjgj(X)˜fX(x)dx={([mj=1kjgj(X)fXα(x)dx,mj=1kjgj(X)f+Xα(x)dx],α)|α[0,1]}={([mj=1kjgj(X)fXα(x)dx,mj=1kjgj(X)f+Xα(x)dx],α)|α[0,1]}={mj=1kj([gj(X)fXα(x)dx,gj(X)f+Xα(x)dx],α)|α[0,1]}=mj=1kj((F)gj(X)˜fX(x)dx),

    which confirms linearity of fuzzifying expectations ˜E(gj(X)).

    In this study, the concept of fuzzifying functions has been introduced to probability theory as a means of developing a fuzzifying PDF and a fuzzifying probability. Through this approach, we aim to investigate the ambiguities inherent in probability theories that are affected by uncertainties in the PDF. The validity of the fuzzifying probability was established through Theorem 2.3, while Theorems 3.1 and 3.2 provided the fuzzifying n-th moment about the origin of a random variable and the fuzzifying variance, respectively. To demonstrate the utility of our approach, we presented modeled examples in which the fuzzifying functions were shown to generalize crisp functions in probability theory. Examples 2.6 and 3.4 illustrated the fuzzifying probability and the fuzzifying expected value, respectively. Furthermore, we extended the concept of fuzzifying functions to Bernoulli, Poisson, and geometric random variables, among others, thus enabling us to investigate the uncertainties in probability theories arising from the ambiguities in PDFs. In summary, our approach of employing fuzzifying functions allows for the investigation of the impact of uncertainties in PDFs on probability theories, and our findings suggest that the concept of fuzzifying functions has the potential to enhance our understanding of probability theory.

    The authors received no financial support for the research, authorship, and/or publication of this article.

    The authors declare no conflict of interest.



    [1] P. Bedi, C. Sharma, Community detection in social networks, Wiley interdisciplinary reviews: Data mining and knowledge discovery, 6 (2016), 115–135. https://doi.org/10.1002/widm.1178
    [2] L. M. Naeni, R. Berretta, P. Moscato, MA-Net: A reliable memetic algorithm for community detection by modularity optimization, In Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, 1 (2015), Springer. https://doi.org/10.1007/978-3-319-13359-1_25
    [3] R. K. Behera, D. Naik, S. K. Rath, R. Dharavath, Genetic algorithm-based community detection in large-scale social networks, Neural Comput. Appl., 32 (2020), 9649–9665. https://doi.org/10.1007/s00521-019-04487-0 doi: 10.1007/s00521-019-04487-0
    [4] E. Ferrara, A large-scale community structure analysis in Facebook, EPJ Data Sci., 1 (2012), 1–30. https://doi.org/10.1140/epjds9 doi: 10.1140/epjds9
    [5] J. Goldenberg, B. Libai, E. Muller, Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata, Acad. Mark. Sci. Rev., 9 (2001), 1–18.
    [6] M. E. Newman, M. Girvan, Finding and evaluating community structure in networks, Phys. Rev. E, 69 (2004), 026113. https://doi.org/10.1103/PhysRevE.69.026113 doi: 10.1103/PhysRevE.69.026113
    [7] A. Pothen, H. D. Simon, K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. A, 11(1990), 430–452. https://doi.org/10.1137/0611030 doi: 10.1137/0611030
    [8] M. Girvan, M. E. Newman, Community structure in social and biological networks, P. Natl Acad. Sci., 99 (2002), 7821–7826. https://doi.org/10.1073/pnas.122653799 doi: 10.1073/pnas.122653799
    [9] U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, et al., On modularity clustering, IEEE T. Knowl. Data En., 20 (2007), 172–188. https://doi.org/10.1109/TKDE.2007.190689 doi: 10.1109/TKDE.2007.190689
    [10] K. Wakita, T. Tsurumi, Finding community structure in mega-scale social networks, In Proceedings of the 16th international conference on World Wide Web, 2007. https://doi.org/10.1145/1242572.1242805
    [11] I. Koc, A fast community detection algorithm based on coot bird metaheuristic optimizer in social networks, Eng. Appl. Artif. Intel., 114 (2022), 105202. https://doi.org/10.1016/j.engappai.2022.105202 doi: 10.1016/j.engappai.2022.105202
    [12] Y. Zhang, Y. G. Liu, J. T. Li, J. J. Zhu, C. H. Yang, W. Yang, et al., WOCDA: A whale optimization based community detection algorithm, Physica A, 539 (2020), 122937. https://doi.org/10.1016/j.physa.2019.122937 doi: 10.1016/j.physa.2019.122937
    [13] C. Pizzuti, Ga-net: A genetic algorithm for community detection in social networks, In International conference on parallel problem solving from nature, Springer, 2008. https://doi.org/10.1007/978-3-540-87700-4_107
    [14] X. Zeng, W. Wang; C. Chen, G. G. Yen, A consensus community-based particle swarm optimization for dynamic community detection, IEEE T. Cybernetics, 50 (2019), 2502–2513. https://doi.org/10.1109/TCYB.2019.2938895 doi: 10.1109/TCYB.2019.2938895
    [15] C. Honghao, F. Zuren, R. Zhigang, Community detection using ant colony optimization, In 2013 IEEE congress on evolutionary computation, 2013.
    [16] M. Tasgin, A. Herdagdelen, H. Bingol, Community detection in complex networks using genetic algorithms, arXiv: 0711.0491, 2007.
    [17] M. Gong, B. Fu, L. C. Jiao, H. F. Du, Memetic algorithm for community detection in networks, Phys. Rev. E, 84 (2011), 056101. https://doi.org/10.1103/PhysRevE.84.056101 doi: 10.1103/PhysRevE.84.056101
    [18] R. Shang, J. Bai, L. C. Jiao, C. Jin, Community detection based on modularity and an improved genetic algorithm, Physica A, 392 (2013), 1215–1231. https://doi.org/10.1016/j.physa.2012.11.003 doi: 10.1016/j.physa.2012.11.003
    [19] Y. Liang, L. Wang, Applying genetic algorithm and ant colony optimization algorithm into marine investigation path planning model, Soft Comput., 24 (2020), 8199–8210. https://doi.org/10.1007/s00500-019-04414-4 doi: 10.1007/s00500-019-04414-4
    [20] K. De Jong, Genetic algorithms: A 10 year perspective, In Proceedings of the first International Conference on Genetic Algorithms and their Applications, Psychology Press, 2014.
    [21] P. Preux, E. G. Talbi, Towards hybrid evolutionary algorithms, Int. T. Oper. Res., 6 (1999), 557–570. https://doi.org/10.1111/j.1475-3995.1999.tb00173.x doi: 10.1111/j.1475-3995.1999.tb00173.x
    [22] T. A. El-Mihoub, A. A. Hopgood, N. Lars, B. Alan, Hybrid genetic algorithms: A review, Eng. Lett., 13 (2006), 124–137.
    [23] M. E. Newman, Fast algorithm for detecting community structure in networks, Phys. Rev. E, 69 (2004), 066133. https://doi.org/10.1103/PhysRevE.69.066133 doi: 10.1103/PhysRevE.69.066133
    [24] J. Holland, Adaptation in natural and artificial systems, Applying genetic algorithm to increase the efficiency of a data flow-based test data generation approach, the university of michigan press, Ann. Arbor. 1975, 1–5.
    [25] L. Haldurai, T. Madhubala, R. Rajalakshmi, A study on genetic algorithm and its applications, Int. J. Comput. Sci. Eng., 4 (2016), 139.
    [26] W. E. Hart, N. Krasnogor, J. E. Smith, Memetic evolutionary algorithms, In Recent Advances in Memetic Algorithms, Springer, 2005, 3–27. https://doi.org/10.1007/3-540-32363-5_1
    [27] P. Moscato, C. Cotta, A gentle introduction to memetic algorithms, In Handbook of metaheuristics, Springer, 2003,105–144. https://doi.org/10.1007/0-306-48056-5_5
    [28] N. Krasnogor, J. Smith, A tutorial for competent memetic algorithms: Model, taxonomy, and design issues, IEEE T. Evolut. Comput., 9 (2005), 474–488. https://doi.org/10.1109/TEVC.2005.850260 doi: 10.1109/TEVC.2005.850260
    [29] G. Acampora, V. Loia, S. Salerno, A. Vitiello, A hybrid evolutionary approach for solving the ontology alignment problem, Int. J. Intel. Syst., 27 (2012), 189–216. https://doi.org/10.1002/int.20517 doi: 10.1002/int.20517
    [30] R. Cabido, A. S. Montemayor, J. J. Pantrigo, High performance memetic algorithm particle filter for multiple object tracking on modern GPUs, Soft Comput., 16(2012), 217–230. https://doi.org/10.1007/s00500-011-0715-2 doi: 10.1007/s00500-011-0715-2
    [31] Y. Li, J. Liu, C. Liu, A comparative analysis of evolutionary and memetic algorithms for community detection from signed social networks, Soft Comput., 18 (2014), 329–348. https://doi.org/10.1007/s00500-013-1060-4 doi: 10.1007/s00500-013-1060-4
    [32] B. Yang, W. Cheung, J. Liu, Community mining from signed social networks, IEEE T. Knowl. Data En., 19 (2007), 1333–1348. https://doi.org/10.1109/TKDE.2007.1061 doi: 10.1109/TKDE.2007.1061
    [33] P. Doreian, A multiple indicator approach to blockmodeling signed networks, Soc. Networks, 30 (2008), 247–258. https://doi.org/10.1016/j.socnet.2008.03.005 doi: 10.1016/j.socnet.2008.03.005
    [34] V. A. Traag, J. Bruggeman, Community detection in networks with positive and negative links, Phys. Rev. E, 80 (2009), 036115. https://doi.org/10.1103/PhysRevE.80.036115 doi: 10.1103/PhysRevE.80.036115
    [35] L. Wu, X. Ying, X. Wu, A. Lu, Z. H. Zhou, Spectral analysis of k-balanced signed graphs, In Advances in Knowledge Discovery and Data Mining: 15th Pacific-Asia Conference, PAKDD 2011, Shenzhen, China, May 24-27, 2011, Proceedings, Part Ⅱ 15. 2011. Springer.
    [36] S. Ranjkesh, B. Masoumi, S. M. Hashemi, A novel robust memetic algorithm for dynamic community structures detection in complex networks, World Wide Web, 27 (2024), 3. https://doi.org/10.1007/s11280-024-01238-7 doi: 10.1007/s11280-024-01238-7
    [37] M. Miao, J. R. Wu, F. J. Cai, Y. G. Wang, A modified memetic algorithm with an application to gene selection in a sheep body weight study, Animals, 12 (2022), 201. https://doi.org/10.3390/ani12020201 doi: 10.3390/ani12020201
    [38] J. Andre, P. Siarry, T. Dognon, An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization, Adv. Eng. Softw., 32 (2001), 49–60. https://doi.org/10.1016/S0965-9978(00)00070-3 doi: 10.1016/S0965-9978(00)00070-3
    [39] Y. D. Kwon, S. B. Kwon, S. B. Jin, J. Y. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Comput. Struct., 81 (2003), 1715–1725. https://doi.org/10.1016/S0045-7949(03)00183-4 doi: 10.1016/S0045-7949(03)00183-4
    [40] T. F. Gonzalez, Handbook of approximation algorithms and metaheuristics, 2007: Chapman and Hall/CRC.
    [41] C. H. Papadimitriou, K. Steiglitz, Combinatorial optimization: Algorithms and complexity, Courier Corporation, 1998.
    [42] E. Aarts, J. H. Korst, P. J. Laarhoven, Simulated annealing, E. Aarts, JK Lenstra, eds., Local Search in Combinatorial Optimization, John Wiley and Sons, New York, NY, 91120 (1997).
    [43] S. J. Russell, P. Norvig, Artificial intelligence: A modern approach, Pearson, 2016.
    [44] B. Mondal, K. Dasgupta, P. Dutta, Load balancing in cloud computing using stochastic hill climbing-a soft computing approach, Procedia Technol., 4 (2012), 783–789. https://doi.org/10.1016/j.protcy.2012.05.128 doi: 10.1016/j.protcy.2012.05.128
    [45] B. L. Miller, D. E. Goldberg, Genetic algorithms, tournament selection, and the effects of noise, Complex Syst., 9 (1995), 193–212.
    [46] R. Halalai, C. Lemnaru, R. Potolea, Distributed community detection in social networks with genetic algorithms, In Proceedings of the 2010 IEEE 6th International Conference on Intelligent Computer Communication and Processing, 2010. https://doi.org/10.1109/ICCP.2010.5606467
    [47] D. E. Goldberg, Genetic algorithms in search, optimization and machine learning, Addison-Wesley Longman Publishing Co., Inc. 1989.
    [48] W. W. Zachary, An information flow model for conflict and fission in small groups, J. Anthropol. Res., 33 (1977), 452–473. https://doi.org/10.1086/jar.33.4.3629752 doi: 10.1086/jar.33.4.3629752
    [49] J. Q. Jiang, L. J. McQuay, Modularity functions maximization with nonnegative relaxation facilitates community detection in networks, Physica A, 391 (2012), 854–865. https://doi.org/10.1016/j.physa.2011.08.043 doi: 10.1016/j.physa.2011.08.043
    [50] D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, S. M. Dawson, The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: Can geographic isolation explain this unique trait? Behav. Ecol. Sociobiol., 54 (2003), 396–405. https://doi.org/10.1007/s00265-003-0651-y doi: 10.1007/s00265-003-0651-y
    [51] M. E. Newman, Modularity and community structure in networks, P. Natl Acad. Sci., 103 (2006), 8577–8582. https://doi.org/10.1073/pnas.0601602103 doi: 10.1073/pnas.0601602103
    [52] The red hot Jazz archive. Available from: http://www.redhotjazz.com.
    [53] C. Pizzuti, A multi-objective genetic algorithm for community detection in networks, In 2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009. https://doi.org/10.1109/ICTAI.2009.58
    [54] M. Guerrero, F. G. Montoya, R. Baños, A. Alcayde, C. Gil, Adaptive community detection in complex networks using genetic algorithms, Neurocomputing, 266 (2017), 101–113. https://doi.org/10.1016/j.neucom.2017.05.029 doi: 10.1016/j.neucom.2017.05.029
    [55] C. Shi, W. Yi, B. Wu, C. Zhong, A new genetic algorithm for community detection, In Complex Sciences: First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2, Springer, 2009. https://doi.org/10.1007/978-3-642-02469-6_11
    [56] R. Zheng, A fast community detection algorithm based on clustering coefficient, In 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019), Atlantis Press, 2019. https://doi.org/10.2991/icmeit-19.2019.100
    [57] D. Choudhury, S. Bhattacharjee, A. Das, An empirical study of community and sub-community detection in social networks applying Newman-Girvan algorithm, In 2013 1st international conference on emerging trends and applications in computer science, IEEE, 2013. https://doi.org/10.1109/ICETACS.2013.6691399
    [58] N. Du, B. Wu, X. Pei, Community detection in large-scale social networks, In Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, 2007.
    [59] A. Said, R. A. Abbasi, O. Maqbool, A. Daud, N. R. Aljohani, CC-GA: A clustering coefficient based genetic algorithm for detecting communities in social networks, Appl. Soft Comput., 63 (2018), 59–70. https://doi.org/10.1016/j.asoc.2017.11.014 doi: 10.1016/j.asoc.2017.11.014
    [60] W. Y. Lin, W. Y. Lee, T. P. Hong, Adapting crossover and mutation rates in genetic algorithms, J. Inf. Sci. Eng., 19 (2003), 889–903.
    [61] A. Clauset, M. E. Newman, C. Moore, Finding community structure in very large networks, Phys. Rev. E, 70 (2004), 066111. https://doi.org/10.1103/PhysRevE.70.066111 doi: 10.1103/PhysRevE.70.066111
    [62] S. Wang, J. Liu, Constructing robust community structure against edge-based attacks, IEEE Syst. J., 13 (2018), 582–592. https://doi.org/10.1109/JSYST.2018.2835642 doi: 10.1109/JSYST.2018.2835642
    [63] S. Wang, J. Liu, X. Wang, Mitigation of attacks and errors on community structure in complex networks, J. Stat. Mech.-Theory E., 2017 (2017), 043405. https://doi.org/10.1088/1742-5468/aa6581 doi: 10.1088/1742-5468/aa6581
    [64] S. Wang, J. Liu, Community robustness and its enhancement in interdependent networks, Appl. Soft Comput., 77 (2019), 665–677. https://doi.org/10.1016/j.asoc.2019.01.045 doi: 10.1016/j.asoc.2019.01.045
    [65] V. D. F. Vieira, C. R. Xavier, A. G. Evsukoff, A comparative study of overlapping community detection methods from the perspective of the structural properties, Appl. Netw. Sci., 5 (2020), 1–42. https://doi.org/10.1007/s41109-020-00289-9 doi: 10.1007/s41109-020-00289-9
    [66] L. Danon, A. Díaz-Guilera1, J. Duch, A. Arenas, Comparing community structure identification, J. Stat. Mech.-Theory E., 2005 (2005), P09008. https://doi.org/10.1088/1742-5468/2005/09/P09008 doi: 10.1088/1742-5468/2005/09/P09008
    [67] L. M. Collins, C. W. Dent, Omega: A general formulation of the rand index of cluster recovery suitable for non-disjoint solutions, Multivar. Behav. Res., 23 (1988), 231–242. https://doi.org/10.1207/s15327906mbr2302_6 doi: 10.1207/s15327906mbr2302_6
    [68] M. Li, J. Liu, A link clustering based memetic algorithm for overlapping community detection, Physica A, 503 (2018), 410–423. https://doi.org/10.1016/j.physa.2018.02.133 doi: 10.1016/j.physa.2018.02.133
    [69] H. Shen, X. Q. Cheng, K. Cai, M. B. Hu, Detect overlapping and hierarchical community structure in networks, Physica A, 388 (2009), 1706–1712. https://doi.org/10.1016/j.physa.2008.12.021 doi: 10.1016/j.physa.2008.12.021
    [70] D. Jin, Z. Y. Liu, W. H. Li, D. X. He, W. X. Zhang, Graph convolutional networks meet markov random fields: Semi-supervised community detection in attribute networks, In Proceedings of the AAAI conference on artificial intelligence, 2019. https://doi.org/10.1609/aaai.v33i01.3301152
    [71] W. Shi, Network embedding via community based variational autoencoder, IEEE Access, 7 (2019), 25323–25333. https://doi.org/10.1109/ACCESS.2019.2900662 doi: 10.1109/ACCESS.2019.2900662
  • This article has been cited by:

    1. Hui Kang, Chunlan Jiang, Ming Li, Liang Mao, Study on the method of transfer alignment based on the distributed inertial network of guided submunition, 2024, 149, 12709638, 109153, 10.1016/j.ast.2024.109153
    2. Jacob Wood, Dojin Kim, Lee-Chae Jang, Evaluation of subjective policy reflection using the Choquet integral and its applications, 2024, 488, 01650114, 109012, 10.1016/j.fss.2024.109012
    3. Weihao Pan, Hualong Li, Xiaobo Zhou, Jun Jiao, Cheng Zhu, Qiang Zhang, Research on Pig Sound Recognition Based on Deep Neural Network and Hidden Markov Models, 2024, 24, 1424-8220, 1269, 10.3390/s24041269
  • 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(1423) PDF downloads(98) Cited by(0)

Figures and Tables

Figures(4)  /  Tables(6)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog