9 November 2018 in IEEE Access
Identifying overlapping communities is essential for analyzing network structures, exploring the interactions of groups, studying network functions, and obtaining insight into the dynamics of networks. Many algorithms have been proposed for detecting overlapping communities but identifying the intrinsic communities is still a non-trivial problem because of the difficulties with parameter tuning, user bias criteria, and the lack of ground truth information. In this study, we propose a new model called OCDID (Overlapping Community Detection based on Information Dynamics) to uncover the overlapping communities, which treats the network as a dynamical system that allows an individual to communicate and share information with its neighbors. The information flow in the network is controlled by the underlying topology structure (e.g., the community structure), and the community structure is also reflected by the information dynamics. Overlapping nodes act as bridges between multiple communities and the information from multiple communities flows through these nodes. Thus, the overlapping nodes can be identified by analyzing the information flow among communities. In addition, we use the monotone convergence theorem to confirm the convergence of our model. Experiments based on synthetic and real-world networks demonstrate that in most cases, our proposed approach is superior to other representative algorithms in terms of the quality of overlapping community detection.
1 August 2017 in Journal of Physics: Conference Series
Anti-pattern, as an extension to pattern, describes a widely used poor solution which can bring negative influence to application systems. Aiming at the shortcomings of the existing anti-pattern descriptions, an anti-pattern description method based on first order predicate is proposed. This method synthesizes anti-pattern forms and symptoms, which makes the description more accurate and has good scalability and versatility as well. In order to improve the accuracy of anti-pattern detection, a Bayesian classification method is applied in validation for detection results, which can reduce false negatives and false positives of anti-pattern detection. Finally, the proposed approach in this paper is applied to a small e-commerce system, the feasibility and effectiveness of the approach is demonstrated further through experiments.
1 May 2025 in Physics of Fluids
This paper establishes a scattering model for elastic targets under head wave incidence to address the localization and identification requirements for long-range detection of submerged targets in a shallow-water waveguide. Expressions for multiple head waves are derived using the ray theory. The scattered field of the target in the waveguide is obtained by integrating the scattering separation method (SSM) with multiple head waves. Scattering in both free-field and waveguide environments for submerged (suspended and bottomed) vacuum elastic spherical shells under head wave incidence is calculated. The results indicated that (1) the bistatic scattered acoustic field under head wave incidence exhibits asymmetry that is positively correlated with frequency and sediment attenuation. This characteristic changes the typical “X-shaped” distribution of the flexural wave a0- in the bistatic impulse response into a “\-shaped” distribution. When the target is bottomed, multiple scattering effects between the interface and the target interfere with this transformation. (2) Due to the rapid propagation characteristics of the head wave, the first-arrival rigid echo from the spherical shell in the waveguide can be accurately utilized for target localization when received by a vertical line array (VLA). In addition, the elastic echo effectively extracts the resonance peak of the a0-wave, enabling further identification of target parameters such as radius and shell thickness ratio.
9 January 2026 in Applied Acoustics
16 December 2021 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
In a complex network system, the structure of the network is an extremely important element for the analysis of the system, and the study of community detection algorithms is key to exploring the structure of the complex network. Traditional community detection algorithms would represent the network using an adjacency matrix based on observations, which may contain redundant information or noise that interferes with the detection results. In this paper, we propose a community detection algorithm based on density clustering. In order to improve the performance of density clustering, we consider an algorithmic framework for learning the continuous representation of network nodes in a low-dimensional space. The network structure is effectively preserved through network embedding, and density clustering is applied in the embedded low-dimensional space to compute the similarity of nodes in the network, which in turn reveals the implied structure in a given network. Experiments show that the algorithm has superior performance compared to other advanced community detection algorithms for real-world networks in multiple domains as well as synthetic networks, especially when the network data chaos is high.