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

Weighted Mean00:57

Weighted Mean

5.1K
While taking the arithmetic, geometric, or harmonic mean of a sample data set, equal importance is assigned to all the data points. However, all the values may not always be equally important in some data sets. An intrinsic bias might make it more important to give more weightage to specific values over others.
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
5.1K
Cluster Sampling Method01:20

Cluster Sampling Method

11.9K
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.9K
Sampling Plans01:23

Sampling Plans

181
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...
181
Wald-Wolfowitz Runs Test II01:17

Wald-Wolfowitz Runs Test II

238
The Wald-Wolfowitz runs test, commonly referred to as the runs test, is a nonparametric test used to assess the randomness of ordered data. The test evaluates the number of runs, which are consecutive sequences of similar elements within the data. If the number of runs is significantly higher or lower than expected, the data is considered non-random, indicating a detectable pattern or structure.
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...
238
Wilcoxon Signed-Ranks Test for Median of Single Population01:14

Wilcoxon Signed-Ranks Test for Median of Single Population

127
The Wilcoxon signed-rank test for the median of a single population is a nonparametric test used to evaluate whether the median of a population differs from a specified value. Unlike parametric tests, it does not require data to follow a normal distribution, making it suitable for non-normal or small samples. The test begins by calculating the difference (d) between each observation and the hypothesized median. The absolute values of these differences are ranked in ascending order, with ties...
127
Polymers: Molecular Weight Distribution01:10

Polymers: Molecular Weight Distribution

3.4K
For any given polymer, the weight average molecular weight (Mw) is higher than, if not equal to, the number average molecular weight (Mn). The only situation in which the weight average molecular weight and the number average molecular weight are equal is when a polymer consists only of chains with equal molecular weight. However, this never happens in a synthetic polymer, since it is difficult to control the polymerization process up to a molecular level with accuracy to a hundred percent.
3.4K

You might also read

Related Articles

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

Sort by
Same author

In vivo dedifferentiation of human epidermal cells.

Cell biology international·2007
Same author

What is in a word? No versus Yes differentially engage the lateral orbitofrontal cortex.

Emotion (Washington, D.C.)·2007
Same author

[Gene expression profile changes in oral verrucous carcinoma and oral squamous cell carcinoma].

Zhonghua kou qiang yi xue za zhi = Zhonghua kouqiang yixue zazhi = Chinese journal of stomatology·2007
Same author

Morphology of critical nuclei in solid-state phase transformations.

Physical review letters·2007
Same author

Enhanced cooperative activation effect in the hydrolytic kinetic resolution of epoxides on [Co(salen)] catalysts confined in nanocages.

Angewandte Chemie (International ed. in English)·2007
Same author

[Construction of the three-dimensional finite element model of micro -implant -maxilla].

Hua xi kou qiang yi xue za zhi = Huaxi kouqiang yixue zazhi = West China journal of stomatology·2007

Related Experiment Video

Updated: Jun 29, 2025

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.3K

A clustering-based differential privacy protection algorithm for weighted social networks.

Lei Zhang1,2, Lina Ge1,2,3

  • 1School of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China.

Mathematical Biosciences and Engineering : MBE
|March 29, 2024
PubMed
Summary
This summary is machine-generated.

A new algorithm, DCDP, protects privacy in weighted social networks by clustering data and adding noise selectively. This method enhances data utility and accuracy compared to traditional privacy techniques.

Keywords:
OPTICS algorithmdifferential privacyprivacy protectionweighted social network

More Related Videos

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

7.0K
Author Spotlight: Emerging Technologies and Advanced Tools for Decoding Metabolomics Data Analysis
07:11

Author Spotlight: Emerging Technologies and Advanced Tools for Decoding Metabolomics Data Analysis

Published on: November 10, 2023

2.3K

Related Experiment Videos

Last Updated: Jun 29, 2025

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
09:49

Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

Published on: September 25, 2021

4.3K
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

7.0K
Author Spotlight: Emerging Technologies and Advanced Tools for Decoding Metabolomics Data Analysis
07:11

Author Spotlight: Emerging Technologies and Advanced Tools for Decoding Metabolomics Data Analysis

Published on: November 10, 2023

2.3K

Area of Science:

  • Computer Science
  • Data Privacy
  • Network Analysis

Background:

  • Weighted social networks are vital in diverse applications like social media and healthcare.
  • Increasing use raises significant privacy concerns, including sensitive data leakage and privacy attacks.
  • Existing differential privacy methods struggle with data utility due to excessive noise in edge weights.

Purpose of the Study:

  • To propose a novel privacy protection algorithm, DCDP, for weighted social networks.
  • To address the trade-off between privacy preservation and data utility in weighted network analysis.
  • To safeguard sensitive user information while maintaining data accuracy.

Main Methods:

  • Developed the DCDP algorithm combining OPTICS density clustering with differential privacy.
  • Partitioned weighted networks into sub-clusters for targeted noise injection.
  • Introduced a new privacy parameter calculation method for balanced protection.

Main Results:

  • DCDP achieves differential privacy for weighted social networks while preserving data accuracy.
  • Reduced average relative error by approximately 20% compared to traditional methods.
  • Increased the proportion of unchanged shortest paths by about 10%.

Conclusions:

  • DCDP offers an effective solution for privacy protection in weighted social networks.
  • The algorithm successfully balances robust privacy with high data utility.
  • DCDP provides a valuable tool for secure analysis of sensitive network data.