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

Fast outlier removing method for point cloud of microscopic 3D measurement based on social circle

  • Measurement outliers are easily caused by illumination, surface texture, human factors and so on during the process of microscopic topography measurement. These numerous cloud point noise will heavily affect instrument measurement accuracy and surface reconstruction quality. We propose a quick and accurate method for removing outliers based on social circle algorithm. First, the gaussian kernel function is used to calculate the voting value to determine the social circle's initial point, and then select the appropriate social circle radius and search window based on the initial point, and finally expand the social circle through an iterative method. Points which are not in the social circle can be considered as outliers and filtered out. The experimental results show the good performance of the algorithm with comparison to the existing filtering methods. The developed method has great potential in microscopic topography reconstruction, fitting and other point cloud processing tasks.

    Citation: Haihua Cui, Qianjin Wang, Dengfeng Dong, Hao Wei, Yihua Zhang. Fast outlier removing method for point cloud of microscopic 3D measurement based on social circle[J]. Mathematical Biosciences and Engineering, 2020, 17(6): 8138-8151. doi: 10.3934/mbe.2020413

    Related Papers:

    [1] Debao Yan . Existence results of fractional differential equations with nonlocal double-integral boundary conditions. Mathematical Biosciences and Engineering, 2023, 20(3): 4437-4454. doi: 10.3934/mbe.2023206
    [2] Abdon Atangana, Jyoti Mishra . Analysis of nonlinear ordinary differential equations with the generalized Mittag-Leffler kernel. Mathematical Biosciences and Engineering, 2023, 20(11): 19763-19780. doi: 10.3934/mbe.2023875
    [3] Allaberen Ashyralyev, Evren Hincal, Bilgen Kaymakamzade . Crank-Nicholson difference scheme for the system of nonlinear parabolic equations observing epidemic models with general nonlinear incidence rate. Mathematical Biosciences and Engineering, 2021, 18(6): 8883-8904. doi: 10.3934/mbe.2021438
    [4] Sebastian Builes, Jhoana P. Romero-Leiton, Leon A. Valencia . Deterministic, stochastic and fractional mathematical approaches applied to AMR. Mathematical Biosciences and Engineering, 2025, 22(2): 389-414. doi: 10.3934/mbe.2025015
    [5] Hardik Joshi, Brajesh Kumar Jha, Mehmet Yavuz . Modelling and analysis of fractional-order vaccination model for control of COVID-19 outbreak using real data. Mathematical Biosciences and Engineering, 2023, 20(1): 213-240. doi: 10.3934/mbe.2023010
    [6] Barbara Łupińska, Ewa Schmeidel . Analysis of some Katugampola fractional differential equations with fractional boundary conditions. Mathematical Biosciences and Engineering, 2021, 18(6): 7269-7279. doi: 10.3934/mbe.2021359
    [7] Jian Huang, Zhongdi Cen, Aimin Xu . An efficient numerical method for a time-fractional telegraph equation. Mathematical Biosciences and Engineering, 2022, 19(5): 4672-4689. doi: 10.3934/mbe.2022217
    [8] Yingying Xu, Chunhe Song, Chu Wang . Few-shot bearing fault detection based on multi-dimensional convolution and attention mechanism. Mathematical Biosciences and Engineering, 2024, 21(4): 4886-4907. doi: 10.3934/mbe.2024216
    [9] H. M. Srivastava, Khaled M. Saad, J. F. Gómez-Aguilar, Abdulrhman A. Almadiy . Some new mathematical models of the fractional-order system of human immune against IAV infection. Mathematical Biosciences and Engineering, 2020, 17(5): 4942-4969. doi: 10.3934/mbe.2020268
    [10] Guodong Li, Ying Zhang, Yajuan Guan, Wenjie Li . Stability analysis of multi-point boundary conditions for fractional differential equation with non-instantaneous integral impulse. Mathematical Biosciences and Engineering, 2023, 20(4): 7020-7041. doi: 10.3934/mbe.2023303
  • Measurement outliers are easily caused by illumination, surface texture, human factors and so on during the process of microscopic topography measurement. These numerous cloud point noise will heavily affect instrument measurement accuracy and surface reconstruction quality. We propose a quick and accurate method for removing outliers based on social circle algorithm. First, the gaussian kernel function is used to calculate the voting value to determine the social circle's initial point, and then select the appropriate social circle radius and search window based on the initial point, and finally expand the social circle through an iterative method. Points which are not in the social circle can be considered as outliers and filtered out. The experimental results show the good performance of the algorithm with comparison to the existing filtering methods. The developed method has great potential in microscopic topography reconstruction, fitting and other point cloud processing tasks.


    Fractional calculus is a main branch of mathematics that can be considered as the generalisation of integration and differentiation to arbitrary orders. This hypothesis begins with the assumptions of L. Euler (1730) and G. W. Leibniz (1695). Fractional differential equations (FDEs) have lately gained attention and publicity due to their realistic and accurate computations [1,2,3,4,5,6,7]. There are various types of fractional derivatives, including Riemann–Liouville, Caputo, Grü nwald–Letnikov, Weyl, Marchaud, and Atangana. This topic's history can be found in [8,9,10,11]. Undoubtedly, fractional calculus applies to mathematical models of different phenomena, sometimes more effectively than ordinary calculus [12,13]. As a result, it can illustrate a wide range of dynamical and engineering models with greater precision. Applications have been developed and investigated in a variety of scientific and engineering fields over the last few decades, including bioengineering [14], mechanics [15], optics [16], physics [17], mathematical biology, electrical power systems [18,19,20] and signal processing [21,22,23].

    One of the definitions of fractional derivatives is Caputo-Fabrizo, which adds a new dimension in the study of FDEs. The new derivative's feature is that it has a nonsingular kernel, which is made from a combination of an ordinary derivative with an exponential function, but it has the same supplementary motivating properties with various scales as in the Riemann-Liouville fractional derivatives and Caputo. The Caputo-Fabrizio fractional derivative has been used to solve real-world problems in numerous areas of mathematical modelling for example, numerical solutions for groundwater pollution, the movement of waves on the surface of shallow water modelling [24], RLC circuit modelling [25], and heat transfer modelling [26,27] were discussed.

    Rach (1987), Bellomo and Sarafyan (1987) first compared the Adomian Decomposition method (ADM) [28,29,30,31,32] to the Picard method on a variety of examples. These methods have many benefits: they effectively work with various types of linear and nonlinear equations and also provide an analytic solution for all of these equations with no linearization or discretization. These methods are more realistic compared with other numerical methods as each technique is used to solve a specific type of equations, on the other hand ADM and Picard are useful for many types of equations. In the numerical examples provided, we compare ADM and Picard solutions of multidimentional fractional order equations with Caputo-Fabrizio.

    The fractional derivative of Caputo-Fabrizio for the function x(t) is defined as [33]

    CFDα0x(t)=B(α)1αt0dds(x(s)) eα1α(ts)ds, (1.1)

    and its corresponding fractional integral is

    CFIαx(t)=1αB(α)x(t)+αB(α)t0x (s)ds,    0<α<1, (1.2)

    where x(t) be continuous and differentiable on [0, T]. Also, in the above definition, the function B(α)>0 is a normalized function which satisfy the condition B(0)=B(1)=0. The relation between the Caputo–Fabrizio fractional derivate and its corresponding integral is given by

    (CFIα0)(CFDα0f(t))=f(t)f(a). (1.3)

    In this section, we will introduce a multidimentional FDE subject to the initial condition. Let α(0,1], 0<α1<α2<...,αm<1, and m is integer real number,

    CFDx=f(t,x,CFDα1x,CFDα2x,...,CFDαmx,) ,x(0)=c0, (2.1)

    where x=x(t),tJ=[0,T],TR+,xC(J).

    To facilitate the equation and make it easy for the calculation, we let x(t)=c0+X(t) so Eq (2.1) can be witten as

    CFDαX=f(t,c0+X,CFDα1X,CFDα2X,...,CFDαmX), X(0)=0. (2.2)

    the algorithm depends on converting the initial condition from a constant c0 to 0.

    Let CFDαX=y(t) then X=CFIαy, so we have

    CFDαiX= CFIααi CFDαX= CFIααiy,  i=1,2,...,m. (2.3)

    Substituting in Eq (2.2) we obtain

    y=f(t,c0+ CFIαy, CFIαα1y,..., CFIααmy). (2.4)

    Assume f satisfies Lipschtiz condition with Lipschtiz constant L given by,

    |f(t,y0,y1,...,ym)||f(t,z0,z1,...,zm)|Lmi=0|yizi|, (2.5)

    which implies

    |f(t,c0+CFIαy,CFIαα1y,..,CFIααmy)f(t,c0+CFIαz,CFIαα1z,..,CFIααmz)|Lmi=0| CFIααiy CFIααiz|. (2.6)

    The solution algorithm of Eq (2.4) using ADM is,

    y0(t)=a(t)yn+1(t)=An(t), j0. (2.7)

    where a(t) pocesses all free terms in Eq (2.4) and An are the Adomian polynomials of the nonlinear term which takes the form [34]

    An=f(Sn)n1i=0Ai, (2.8)

    where f(Sn)=ni=0Ai. Later, this accelerated formula of Adomian polynomial will be used in convergence analysis and error estimation. The solution of Eq (2.4) can be written in the form,

    y(t)=i=0yi(t). (2.9)

    lastly, the solution of the Eq (2.4) takes the form

    x(t)=c0+X(t)=c0+ CFIαy(t). (2.10)

    At which we convert the parameter to the initial form y to x in Eq (2.10), so we have the solution of the original Eq (2.1).

    Define a mapping F:EE where E=(C[J],) is a Banach space of all continuous functions on J with the norm x= maxtϵJx(t).

    Theorem 3.1. Equation (2.4) has a unique solution whenever 0<ϕ<1 where ϕ=L(mi=0[(ααi)(T1)]+1B(ααi)).

    Proof. First, we define the mapping F:EE as

    Fy=f(t,c0+ CFIαy, CFIαα1y,..., CFIααmy).

    Let y and zE are two different solutions of Eq (2.4). Then

    FyFz=f(t,c0+CFIαy,CFIαα1y,..,CFIααmy)f(t,c0+CFIαz,CFIαα1z,...,CFIααmz)

    which implies that

    |FyFz|=|f(t,c0+ CFIαy, CFIαα1y,..., CFIααmy)f(t,c0+ CFIαz, CFIαα1z,..., CFIααmz)|Lmi=0| CFIααiy CFIααiz|Lmi=0|1(ααi)B(ααi)(yz)+ααiB(ααi)t0(yz)ds|FyFzLmi=01(ααi)B(ααi)maxtϵJ|yz|+ααiB(ααi)maxtϵJ|yz|t0dsLmi=01(ααi)B(ααi)yz+ααiB(ααi)yzTLyz(mi=01(ααi)B(ααi)+ααiB(ααi)T)Lyz(mi=0[(ααi)(T1)]+1B(ααi))ϕyz.

    under the condition 0<ϕ<1, the mapping F is contraction and hence there exists a unique solution yC[J] for the problem Eq (2.4) and this completes the proof.

    Theorem 3.2. The series solution of the problem Eq (2.4)converges if |y1(t)|<c and c isfinite.

    Proof. Define a sequence {Sp} such that Sp=pi=0yi(t) is the sequence of partial sums from the series solution i=0yi(t), we have

    f(t,c0+ CFIαy, CFIαα1y,..., CFIααmy)=i=0Ai,

    So

    f(t,c0+ CFIαSp, CFIαα1Sp,..., CFIααmSp)=pi=0Ai,

    From Eq (2.7) we have

    i=0yi(t)=a(t)+i=0Ai1

    let Sp,Sq be two arbitrary sums with pq. Now, we are going to prove that {Sp} is a Caushy sequence in this Banach space. We have

    Sp=pi=0yi(t)=a(t)+pi=0Ai1,Sq=qi=0yi(t)=a(t)+qi=0Ai1.
    SpSq=pi=0Ai1qi=0Ai1=pi=q+1Ai1=p1i=qAi1=f(t,c0+ CFIαSp1, CFIαα1Sp1,..., CFIααmSp1)f(t,c0+ CFIαSq1, CFIαα1Sq1,..., CFIααmSq1)
    |SpSq|=|f(t,c0+ CFIαSp1, CFIαα1Sp1,..., CFIααmSp1)f(t,c0+ CFIαSq1, CFIαα1Sq1,..., CFIααmSq1)|Lmi=0| CFIααiSp1 CFIααiSq1|Lmi=0|1(ααi)B(ααi)(Sp1Sq1)+ααiB(ααi)t0(Sp1Sq1)ds|Lmi=01(ααi)B(ααi)|Sp1Sq1|+ααiB(ααi)t0|Sp1Sq1|ds
    SpSqLmi=01(ααi)B(ααi)maxtϵJ|Sp1Sq1|+ααiB(ααi)maxtϵJ|Sp1Sq1|t0dsLSpSqmi=0(1(ααi)B(ααi)+ααiB(ααi)T)LSpSq(mi=0[(ααi)(T1)]+1B(ααi))ϕSpSq

    let p=q+1 then,

    Sq+1SqϕSqSq1ϕ2Sq1Sq2...ϕqS1S0

    From the triangle inequality we have

    SpSqSq+1Sq+Sq+2Sq+1+...SpSp1[ϕq+ϕq+1+...+ϕp1]S1S0ϕq[1+ϕ+...+ϕpq+1]S1S0ϕq[1ϕpq1ϕ]y1(t)

    Since 0<ϕ<1,pq then (1ϕpq)1. Consequently

    SpSqϕq1ϕy1(t)ϕq1ϕmaxtϵJ|y1(t)| (3.1)

    but |y1(t)|< and as q then, SpSq0 and hence, {Sp} is a Caushy sequence in this Banach space then the proof is complete.

    Theorem 3.3. The maximum absolute truncated error Eq (2.4)is estimated to be maxtϵJ|y(t)qi=0yi(t)|ϕq1ϕmaxtϵJ|y1(t)|

    Proof. From the convergence theorm inequality (Eq 3.1) we have

    SpSqϕq1ϕmaxtϵJ|y1(t)|

    but, Sp=pi=0yi(t) as p then, Spy(t) so,

    y(t)Sqϕq1ϕmaxtϵJ|y1(t)|

    so, the maximum absolute truncated error in the interval J is,

    maxtϵJ|y(t)qi=0yi(t)|ϕq1ϕmaxtϵJ|y1(t)| (3.2)

    and this completes the proof.

    In this part, we introduce several numerical examples with unkown exact solution and we will use inequality (Eq 3.2) to estimate the maximum absolute truncated error.

    Example 4.1. Application of linear FDE

    CFDx(t)+2aCFD1/2x(t)+bx(t)=0,       x(0)=1. (4.1)

    A Basset problem in fluid dynamics is a classical problem which is used to study the unsteady movement of an accelerating particle in a viscous fluid under the action of the gravity [36]

    Set

    X(t)=x(t)1

    Equation (4.1) will be

    CFDX(t)+2aCFD1/2X(t)+bX(t)=0,       X(0)=0. (4.2)

    Appling Eq (2.3) to Eq (4.2), and using initial condition, also we take a = 1, b = 1/2,

    y=122I1/2y12I y (4.3)

    Appling ADM to Eq (4.3), we find the solution algorithm become

    y0(t)=12,yi(t)=2 CFI1/2yi112 CFI yi1,     i1. (4.4)

    Appling Picard solution to Eq (4.2), we find the solution algorithm become

    y0(t)=12,yi(t)=122 CFI1/2yi112 CFI yi1,     i1. (4.5)

    From Eq (4.4), the solution using ADM is given by y(t)=Limqqi=0yi(t) while from Eq (4.5), the solution using Picard technique is given by y(t)=Limiyi(t). Lately, the solution of the original problem Eq (4.2), is

    x(t)=1+ CFI y(t).

    One the same processor (q = 20), the time consumed using ADM is 0.037 seconds, while the time consumed using Picard is 7.955 seconds.

    Figure 1 gives a comparison between ADM and Picard solution of Ex. 4.1.

    Figure 1.  ADM and Picard solution of Ex. 4.1.

    Example 4.2. Consider the following nonlinear FDE [35]

    CFD1/2x=8t3/23πt7/44Γ(114)t44+18 CFD1/4x+14x2, x(0)=0. (4.6)

    Appling Eq (2.3) to Eq (4.6), and using initial condition,

    y=8t3/23πt7/44Γ(114)t44+18 CFI1/4y+14(CFI1/2y)2. (4.7)

    Appling ADM to Eq (4.7), we find the solution algorithm will be become

    y0(t)=8t3/23πt7/44Γ(114)t44,yi(t)=18 CFI1/4yi1+14(Ai1),     i1. (4.8)

    at which Ai are Adomian polynomial of the nonliner term (CFI1/2y)2.

    Appling Picard solution to Eq (4.7), we find the the solution algorithm become

    y0(t)=8t3/23πt7/44Γ(114)t44,yi(t)=y0(t)+18 CFI1/4yi1+14(CFI1/2yi1)2,     i1. (4.9)

    From Eq (4.8), the solution using ADM is given by y(t)=Limqqi=0yi(t) while from Eq (4.9), the solution using Picard technique is given by y(t)=Limiyi(t). Finally, the solution of the original problem Eq (4.7), is.

    x(t)= CFI1/2y.

    One the same processor (q = 2), the time consumed using ADM is 65.13 seconds, while the time consumed using Picard is 544.787 seconds.

    Table 1 showed the maximum absolute truncated error of of ADM solution (using Theorem 3.3) at different values of m (when t = 0:5; N = 2):

    Table 1.  Max. absolute error.
    q max. absolute error
    2 0.114548
    5 0.099186
    10 0.004363

     | Show Table
    DownLoad: CSV

    Figure 2 gives a comparison between ADM and Picard solution of Ex. 4.2.

    Figure 2.  ADM and Picard solution of Ex. 4.2.

    Example 4.3. Consider the following nonlinear FDE [35]

    CFDαx=3t2128125πt5+110(CFD1/2x)2,x(0)=0. (4.10)

    Appling Eq (2.3) to Eq (4.10), and using initial condition,

    y=3t2128125πt5+110(CFI1/2y)2 (4.11)

    Appling ADM to Eq (4.11), we find the solution algorithm become

    y0(t)=3t2128125πt5,yi(t)=110(Ai1),     i1 (4.12)

    at which Ai are Adomian polynomial of the nonliner term (CFI1/2y)2.

    Then appling Picard solution to Eq (4.11), we find the solution algorithm become

    y0(t)=3t2128125πt5,yi(t)=y0(t)+110(CFI1/2yi1)2,     i1. (4.13)

    From Eq (4.12), the solution using ADM is given by y(t)=Limqqi=0yi(t) while from Eq (4.13), the solution is y(t)=Limiyi(t). Finally, the solution of the original problem Eq (4.11), is

    x(t)=CFIy(t).

    One the same processor (q = 4), the time consumed using ADM is 2.09 seconds, while the time consumed using Picard is 44.725 seconds.

    Table 2 showed the maximum absolute truncated error of of ADM solution (using Theorem 3.3) at different values of m (when t = 0:5; N = 4):

    Table 2.  Max. absolute error.
    q max. absolute error
    2 0.00222433
    5 0.0000326908
    10 2.88273*108

     | Show Table
    DownLoad: CSV

    Figure 3 gives a comparison between ADM and Picard solution of Ex. 4.3 with α=1.

    Figure 3.  ADM and Picard solution where of Ex. 4.3.

    Example 4.4. Consider the following nonlinear FDE [35]

    CFDαx=t2+12 CFDα1x+14 CFDα2x+16 CFDα3x+18x4,x(0)=0. (4.14)

    Appling Eq (2.3) to Eq (4.10), and using initial condition,

    y=t2+12(CFIαα1y)+14(CFIαα2y)+16(CFIαα3y)+18(CFIαy)4, (4.15)

    Appling ADM to Eq (4.15), we find the solution algorithm become

    y0(t)=t2,yi(t)=12(CFIαα1y)+14(CFIαα2y)+16(CFIαα3y)+18Ai1,  i1 (4.16)

    where Ai are Adomian polynomial of the nonliner term (CFIαy)4.

    Then appling Picard solution to Eq (4.15), we find the solution algorithm become

    y0(t)=t2,yi(t)=t2+12(CFIαα1yi1)+14(CFIαα2yi1)+16(CFIαα3yi1)+18(CFIαyi1)4     i1. (4.17)

    From Eq (4.16), the solution using ADM is given by y(t)=Limqqi=0yi(t) while from Eq (4.17), the solution using Picard technique is y(t)=Limiyi(t). Finally, the solution of the original problem Eq (4.14), is

    x(t)=CFIαy(t).

    One the same processor (q = 3), the time consumed using ADM is 0.437 seconds, while the time consumed using Picard is (16.816) seconds. Figure 4 shows a comparison between ADM and Picard solution of Ex. 4.4 atα=0.7,α1=0.1,α2=0.3,α3=0.5.

    Figure 4.  ADM and Picard solution where of Ex. 4.4.

    The Caputo-Fabrizo fractional deivative has a nonsingular kernel, and consequently, this definition is appropriate in solving nonlinear multidimensional FDE [37,38]. Since the selected numerical problems have an unkown exact solution, the formula (3.2) can be used to estimate the maximum absolute truncated error. By comparing the time taken on the same processor (i7-2670QM), it was found that the time consumed by ADM is much smaller compared with the Picard technique. Furthermore Picard gives a more accurate solution than ADM at the same interval with the same number of terms.

    The authors declare there is no conflict of interest.



    [1] M. Berger, A. Tagliasacchi, L. Seversky, P. Alliez, J. Levine, A. Sharf, et al., State of the art in surface reconstruction from point clouds, Eurographics 2014 - State of the Art Reports, 1 (2014), 161-185.
    [2] R. Leach, Optical measurement of surface topography, Springer, Berlin, 2011.
    [3] S. Sotoodeh, Hierarchical clustered outlier detection in laser scanner point clouds, Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., 36 (2007), 383-388.
    [4] J. Yu, M. Wei, J. Qin, Feature-preserving mesh denoising via normal guided quadric error metrics, Opt. Lasers Eng., 62 (2014), 57-68. doi: 10.1016/j.optlaseng.2014.05.002
    [5] X. F. Han, J. Jin, M. J. Wang, W. Wei, L. Gao, L. Xiao, A review of algorithms for filtering the 3D point cloud, Signal Process. Image Commun., 57 (2017), 103-112. doi: 10.1016/j.image.2017.05.009
    [6] Y. Wang, H. Y. Feng, Outlier detection for scanned point clouds using majority voting, Comput.-Aided Des., 62 (2015), 31-43. doi: 10.1016/j.cad.2014.11.004
    [7] A. Belyaev, Y. Ohtake, A comparison of mesh smoothing methods, Israel-Korea Bi-national conference on geometric modeling and computer graphics, 2 (2003), 83-87.
    [8] T. Jones, F. Durand, M. Desbrun, Non-iterative, feature-preserving mesh smoothing, ACM SIGGRAPH 2003 Papers, 22 (2003), 943-949.
    [9] B. Skinner, T. Vidal-Calleja, J. V. Miro, F. De Bruijn, R. Falque, 3D point cloud upsampling for accurate reconstruction of dense 2.5 D thickness maps, Australasian Conference on Robotics and Automation, ACRA, 2014.
    [10] V. Morell, S. Orts, M. Cazorla, J. Garcia-Rodriguez, Geometric 3D point cloud compression, Pattern Recognit. Lett., 50 (2014), 55-62. doi: 10.1016/j.patrec.2014.05.016
    [11] R. Rusu, Z. Marton, N. Blodow, M. Dolha, M. Beetz, Towards 3D point cloud based object maps for household environments, Rob. Auton. Syst., 56 (2008), 927-941. doi: 10.1016/j.robot.2008.08.005
    [12] S. Fleishman, I. Drori, D. Cohen-Or, Bilateral mesh denoising, ACM SIGGRAPH 2003 Papers. 22 (2003), 950-953.
    [13] T. Pachur, J. Rieskamp, R. Hertwig, The social circle heuristic: Fast and frugal decisions based on small samples, Proceedings of the Annual Meeting of the Cognitive Science Society, 26 (2004), 1077-1082.
    [14] G. Li, Z. Pan, B. Xiao, L. Huang, Community discovery and importance analysis in social network, Intell. Data Analysis, 18 (2014), 495-510. doi: 10.3233/IDA-140653
    [15] S. K. Nayar, Y. Nakagawa, Shape from focus, IEEE Trans. Pattern Anal. Mach. Intell., 16 (1994), 824-831. doi: 10.1109/34.308479
    [16] J. He, R. Zhou, Z. Hong, Modified fast climbing search auto-focus algorithm with adaptive step size searching technique for digital camera, IEEE Trans. Consum. Electron., 49 (2003), 257-262. doi: 10.1109/TCE.2003.1209511
    [17] J. Leskovec, J. Mcauley, Learning to discover social circles in ego networks, Adv. Neural Inf. Process. Syst., 25 (2012), 539-547.
    [18] M. Wang, W. Zuo, Y. Wang, An improved density peaks-based clustering method for social circle discovery in social networks, Neurocomputing, 179 (2012), 219-227.
    [19] S. Wang, F. Wang, Y. Chen, C. Liu, Z. Li, X. Zhang, Exploiting social circle broadness for influential spreaders identification in social networks. World Wide Web, 18 (2015), 681-705. doi: 10.1007/s11280-014-0277-1
  • This article has been cited by:

    1. Eman A. A. Ziada, Salwa El-Morsy, Osama Moaaz, Sameh S. Askar, Ahmad M. Alshamrani, Monica Botros, Solution of the SIR epidemic model of arbitrary orders containing Caputo-Fabrizio, Atangana-Baleanu and Caputo derivatives, 2024, 9, 2473-6988, 18324, 10.3934/math.2024894
    2. H. Salah, M. Anis, C. Cesarano, S. S. Askar, A. M. Alshamrani, E. M. Elabbasy, Fourth-order differential equations with neutral delay: Investigation of monotonic and oscillatory features, 2024, 9, 2473-6988, 34224, 10.3934/math.20241630
    3. Said R. Grace, Gokula N. Chhatria, S. Kaleeswari, Yousef Alnafisah, Osama Moaaz, Forced-Perturbed Fractional Differential Equations of Higher Order: Asymptotic Properties of Non-Oscillatory Solutions, 2024, 9, 2504-3110, 6, 10.3390/fractalfract9010006
    4. A.E. Matouk, Monica Botros, Hidden chaotic attractors and self-excited chaotic attractors in a novel circuit system via Grünwald–Letnikov, Caputo-Fabrizio and Atangana-Baleanu fractional operators, 2025, 116, 11100168, 525, 10.1016/j.aej.2024.12.064
    5. Zahra Barati, Maryam Keshavarzi, Samaneh Mosaferi, Anatomical and micromorphological study of Phalaris (Poaceae) species in Iran, 2025, 68, 1588-4082, 9, 10.14232/abs.2024.1.9-15
  • Reader Comments
  • © 2020 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(5065) PDF downloads(176) Cited by(0)

Figures and Tables

Figures(11)  /  Tables(1)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog