Enhance Ambiguous Community Structure via Multi-strategy Community Related Link Prediction Method with Evolutionary Process

• URL: http://arxiv.org/abs/2204.13301v1
• Date: Thu, 28 Apr 2022 06:24:16 GMT
• Title: Enhance Ambiguous Community Structure via Multi-strategy Community Related Link Prediction Method with Evolutionary Process
• Authors: Qiming Yang, Wei Wei, Ruizhi Zhang, Bowen Pang and Xiangnan Feng
• Abstract summary: We design a new community attribute based link prediction strategy HAP. This paper aims at providing a community enhancement measure through adding links to clarify ambiguous community structures. The experimental results on twelve real-world datasets with ground truth community indicate that the proposed link prediction method outperforms other baseline methods.
• Score: 7.239725647907488
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Most real-world networks suffer from incompleteness or incorrectness, which is an inherent attribute to real-world datasets. As a consequence, those downstream machine learning tasks in complex network like community detection methods may yield less satisfactory results, i.e., a proper preprocessing measure is required here. To address this issue, in this paper, we design a new community attribute based link prediction strategy HAP and propose a two-step community enhancement algorithm with automatic evolution process based on HAP. This paper aims at providing a community enhancement measure through adding links to clarify ambiguous community structures. The HAP method takes the neighbourhood uncertainty and Shannon entropy to identify boundary nodes, and establishes links by considering the nodes' community attributes and community size at the same time. The experimental results on twelve real-world datasets with ground truth community indicate that the proposed link prediction method outperforms other baseline methods and the enhancement of community follows the expected evolution process.

Related papers

• Enhancing Community Detection in Networks: A Comparative Analysis of Local Metrics and Hierarchical Algorithms [49.1574468325115]
  This study employs the same method to evaluate the relevance of using local similarity metrics for community detection. The efficacy of these metrics was evaluated by applying the base algorithm to several real networks with varying community sizes.
  arXiv  Detail & Related papers  (2024-08-17T02:17:09Z)
• MNTD: An Efficient Dynamic Community Detector Based on Nonnegative Tensor Decomposition [3.714657619100999]
  This paper proposes a Modularity-ind Nonnegative RESCAL Decomposition (MNTD) model for dynamic community detection. The MNTD is superior to state-of-the-art dynamic community detection methods in the accuracy of community detection.
  arXiv  Detail & Related papers  (2024-07-26T16:17:53Z)
• Semi-supervised Community Detection via Structural Similarity Metrics [0.0]
  We study a semi-supervised community detection problem in which the objective is to estimate the community label of a new node. We propose an algorithm that computes a structural similarity metric' between the new node and each of the $K$ communities. Our findings highlight, to the best of our knowledge, the first semi-supervised community detection algorithm that offers theoretical guarantees.
  arXiv  Detail & Related papers  (2023-06-01T19:02:50Z)
• High-order Order Proximity-Incorporated, Symmetry and Graph-Regularized Nonnegative Matrix Factorization for Community Detection [6.573829734173933]
  High-Order Proximity (HOP)-incorporated, Symmetry and Graph-regularized NMF (HSGN) model proposed. HSGN-based community detector significantly outperforms both benchmark and state-of-the-art community detectors in providing highly-accurate community detection results.
  arXiv  Detail & Related papers  (2022-03-08T06:45:31Z)
• Semi-supervised Domain Adaptive Structure Learning [72.01544419893628]
  Semi-supervised domain adaptation (SSDA) is a challenging problem requiring methods to overcome both 1) overfitting towards poorly annotated data and 2) distribution shift across domains. We introduce an adaptive structure learning method to regularize the cooperation of SSL and DA.
  arXiv  Detail & Related papers  (2021-12-12T06:11:16Z)
• Group-Node Attention for Community Evolution Prediction [9.777369108179501]
  We present a novel graph neural network for predicting community evolution events from structural and temporal information. A comparative evaluation with standard baseline methods is performed and we demonstrate that our model outperforms the baselines.
  arXiv  Detail & Related papers  (2021-07-09T16:16:10Z)
• QD-GCN: Query-Driven Graph Convolutional Networks for Attributed Community Search [54.42038098426504]
  QD-GCN is an end-to-end framework that unifies the community structure as well as node attributes to solve the ACS problem. We show that QD-GCN outperforms existing attributed community search algorithms in terms of both efficiency and effectiveness.
  arXiv  Detail & Related papers  (2021-04-08T07:52:48Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Online Estimation and Community Detection of Network Point Processes for Event Streams [12.211623200731788]
  A common goal in network modeling is to uncover the latent community structure present among nodes. We propose a fast online variational inference algorithm for estimating the latent structure underlying dynamic event arrivals on a network. We demonstrate that online inference can obtain comparable performance, in terms of community recovery, to non-online variants.
  arXiv  Detail & Related papers  (2020-09-03T15:39:55Z)
• GRADE: Graph Dynamic Embedding [76.85156209917932]
  GRADE is a probabilistic model that learns to generate evolving node and community representations by imposing a random walk prior to their trajectories. Our model also learns node community membership which is updated between time steps via a transition matrix. Experiments demonstrate GRADE outperforms baselines in dynamic link prediction, shows favourable performance on dynamic community detection, and identifies coherent and interpretable evolving communities.
  arXiv  Detail & Related papers  (2020-07-16T01:17:24Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.