Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: Jul 25, 2025

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

585

Community-CL: An Enhanced Community Detection Algorithm Based on Contrastive Learning.

Zhaoci Huang1, Wenzhe Xu1, Xinjian Zhuo1

  • 1School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China.

Entropy (Basel, Switzerland)
|June 28, 2023
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

Difference from Background: Limit of Detection01:05

Difference from Background: Limit of Detection

6.7K
The limit of detection (LOD) is the smallest amount of analyte that can be distinguished from the background noise. The LOD value corresponds to the concentration at which the analyte signal is three times larger than the standard deviation of the blank signal. Below this value, the analyte signal cannot be differentiated from the background noise. It is calculated by dividing the calibration slope by 3 times the standard deviation of the blank signals.
The LOD indicates the presence or absence...
6.7K
Community Based Intervention01:30

Community Based Intervention

66
Community-based interventions in mental health represent a paradigm shift from institution-centered care to treatments embedded within the fabric of local communities. By prioritizing inclusion and leveraging existing societal structures, this approach fosters a supportive environment conducive to addressing mental health challenges while promoting individual dignity and agency.
Foundations of Community Mental Health Programs
Central to the success of community-based interventions is the...
66
Cluster Sampling Method01:20

Cluster Sampling Method

12.0K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
12.0K
Aggregates Classification01:29

Aggregates Classification

350
Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...
350
Kendall's Coefficient of Concordance01:20

Kendall's Coefficient of Concordance

426
Kendall's Coefficient of Concordance (W), also known as Kendall's W, is a non-parametric statistical measure used to assess the agreement or concordance between multiple raters or judges when they rank a set of items. It is often used when you have ordinal data (ranks) and you want to see if there is consistency or consensus among the raters. It is widely applied in research areas such as psychology, medicine, and social sciences, where multiple judges are asked to rank or rate subjects...
426
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

170
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
170

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026
See all related articles

This study introduces Community Contrastive Learning (Community-CL), a new framework for graph representation learning and community detection. Community-CL enhances network analysis by improving node embeddings and community structure discovery.

Area of Science:

  • Graph representation learning
  • Network analysis
  • Community detection

Background:

  • Graph contrastive learning (GCL) is a powerful self-supervised technique for graph analysis tasks like node classification and clustering.
  • Existing GCL methods have not fully explored the community structure inherent in complex networks.
  • There is a need for methods that jointly learn node representations and detect communities effectively.

Purpose of the Study:

  • To propose a novel online framework, Community Contrastive Learning (Community-CL), for simultaneous node representation learning and community detection.
  • To enhance graph representation learning by incorporating community structure information.
  • To improve the accuracy and expressiveness of network embeddings compared to traditional methods.

Main Methods:

Keywords:
community detectioncontrastive learninggraph neural network

More Related Videos

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates
08:56

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates

Published on: January 13, 2023

2.2K
Author Spotlight: Enhancing PSC-to-Functional Cell Differentiation Using ML Models Based on Live-Cell Bright-Field Imaging
11:38

Author Spotlight: Enhancing PSC-to-Functional Cell Differentiation Using ML Models Based on Live-Cell Bright-Field Imaging

Published on: October 4, 2024

635

Related Experiment Videos

Last Updated: Jul 25, 2025

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

585
Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates
08:56

Automatic Image Processing to Determine the Community Size Structure of Riverine Macroinvertebrates

Published on: January 13, 2023

2.2K
Author Spotlight: Enhancing PSC-to-Functional Cell Differentiation Using ML Models Based on Live-Cell Bright-Field Imaging
11:38

Author Spotlight: Enhancing PSC-to-Functional Cell Differentiation Using ML Models Based on Live-Cell Bright-Field Imaging

Published on: October 4, 2024

635
  • Community-CL utilizes contrastive learning to align latent representations of nodes and communities across different graph views.
  • Learnable graph augmentation views are generated using a graph auto-encoder (GAE).
  • A shared encoder learns node features from the original graph and its augmented views.

Main Results:

  • Community-CL achieves superior performance in community detection compared to state-of-the-art baselines.
  • The framework demonstrates improved accuracy in identifying network communities.
  • Experimental results show significant performance gains, with NMI scores of 0.714 (Amazon-Photo) and 0.551 (Amazon-Computers), representing up to a 16% improvement.

Conclusions:

  • The proposed Community-CL framework effectively integrates representation learning and community detection.
  • The joint contrastive approach leads to more accurate network representations and expressive embeddings.
  • Community-CL offers a promising advancement for analyzing the community structure of networks.