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 Concept Videos

Cluster Sampling Method01:20

Cluster Sampling Method

11.6K
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...
11.6K
Survival Tree01:19

Survival Tree

48
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
48
Sampling Plans01:23

Sampling Plans

162
Sampling is a crucial step in analytical chemistry, allowing researchers to collect representative data from a large population. Common sampling methods include random, judgmental, systematic, stratified, and cluster sampling.
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...
162
Aggregates Classification01:29

Aggregates Classification

295
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...
295
End Point Prediction: Gran Plot01:07

End Point Prediction: Gran Plot

211
A Gran plot is used to predict the equivalence volume or endpoint of a potentiometric or acid-base titration without reaching the endpoint. Typically, titration data is collected as a function of the titrant's volume up to a point less than the equivalence volume and then transformed into a linear format. The straight line is extended to the x-axis, indicating the necessary titrant volume to achieve the equivalence point.
For potentiometric titration, the Gran plot is created by plotting...
211
Classification of Systems-II01:31

Classification of Systems-II

132
Continuous-time systems have continuous input and output signals, with time measured continuously. These systems are generally defined by differential or algebraic equations. For instance, in an RC circuit, the relationship between input and output voltage is expressed through a differential equation derived from Ohm's law and the capacitor relation,
132

You might also read

Related Articles

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

Sort by
Same author

Gut microbiota-derived short-chain fatty acids and kidney diseases.

Drug design, development and therapy·2017
Same author

Overexpression of HHEX in Acute Myeloid Leukemia with t(8;21)(q22;q22) Translocation.

Annals of clinical and laboratory science·2017
Same author

C5aR1 promotes acute pyelonephritis induced by uropathogenic E. coli.

JCI insight·2017
Same author

ANGPTL8 negatively regulates NF-κB activation by facilitating selective autophagic degradation of IKKγ.

Nature communications·2017
Same author

Transient Receptor Potential Melastatin 2 Negatively Regulates LPS-ATP-Induced Caspase-1-Dependent Pyroptosis of Bone Marrow-Derived Macrophage by Modulating ROS Production.

BioMed research international·2017
Same author

Experimental validation of a subject-specific maximum endurance time model.

Ergonomics·2017

Related Experiment Video

Updated: May 21, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.9K

A novel self-supervised graph clustering method with reliable semi-supervision.

Weijia Lu1, Min Wang2, Yun Yu3

  • 1Science and Technology Department, Affiliated Hospital of Nantong University, Nantong, Jiangsu, 226001, China; Jianghai Hospital of Nantong Sutong Science and Technology Park, Nantong, Jiangsu, 226001, China.

Neural Networks : the Official Journal of the International Neural Network Society
|March 22, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces a new Self-Supervised Graph Clustering model (SSGC-RSS) to tackle noise and sparsity in graph data. The model enhances clustering accuracy on complex datasets by combining reliable semi-supervision with deep learning techniques.

Keywords:
Deep clusteringGrapH CONVOLUTIONAL NETWorksSelf-supervised learningSemi-supervision learning

More Related Videos

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.2K
Visualization Method for Proprioceptive Drift on a 2D Plane Using Support Vector Machine
07:05

Visualization Method for Proprioceptive Drift on a 2D Plane Using Support Vector Machine

Published on: October 27, 2016

9.2K

Related Experiment Videos

Last Updated: May 21, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.9K
Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.2K
Visualization Method for Proprioceptive Drift on a 2D Plane Using Support Vector Machine
07:05

Visualization Method for Proprioceptive Drift on a 2D Plane Using Support Vector Machine

Published on: October 27, 2016

9.2K

Area of Science:

  • Artificial Intelligence
  • Machine Learning
  • Data Science

Background:

  • Deep clustering excels with complex data but struggles with graph data noise and sparsity.
  • Noise and sparsity in graph data hinder feature extraction and degrade clustering performance.

Purpose of the Study:

  • To propose a novel Self-Supervised Graph Clustering model based on Reliable Semi-Supervision (SSGC-RSS).
  • To address the challenges of noise and sparsity in deep graph clustering.

Main Methods:

  • Developed a dual-decoder graph autoencoder with joint clustering optimization in the upstream component.
  • Implemented a semi-supervised graph attention encoding network using reliable samples and pseudo-labels in the downstream component.
  • The model generates cluster centers and pseudo-labels to alleviate sparsity and reduce noise interference.

Main Results:

  • SSGC-RSS demonstrated significant performance improvements over existing methods on benchmark graph datasets.
  • Achieved accuracy increases of 0.9% on Cora, 2.0% on Citeseer, and 5.6% on Pubmed.
  • The model effectively handles noise and sparsity in complex graph data clustering.

Conclusions:

  • SSGC-RSS proves effective and superior for deep graph clustering tasks with noisy and sparse data.
  • The proposed model offers a robust solution for enhancing unsupervised learning on complex graph structures.