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

12.3K
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.3K
Correlation01:09

Correlation

12.4K
In statistics, two variables are said to be correlated if the values of one variable are associated with the other variable. Depending on the relationship between two variables, correlation can be of three types– positive correlation, negative correlation, and zero correlation.
Two variables, for example, a and b, are said to be positively correlated if both variables move in the same direction. In other words, a positive correlation exists between two variables, a and b, if:
12.4K
Correlations02:20

Correlations

33.6K
Correlation means that there is a relationship between two or more variables (such as ice cream consumption and crime), but this relationship does not necessarily imply cause and effect. When two variables are correlated, it simply means that as one variable changes, so does the other. We can measure correlation by calculating a statistic known as a correlation coefficient. A correlation coefficient is a number from -1 to +1 that indicates the strength and direction of the relationship between...
33.6K
Correlation of Experimental Data01:23

Correlation of Experimental Data

264
Dimensional analysis simplifies complex physical problems and guides experimental investigations, but it does not provide complete solutions. It identifies the dimensionless groups that influence a phenomenon, but experimental data is needed to establish the specific relationships and validate theoretical predictions.
For example, a spherical particle moving through a viscous fluid experiences drag. Dimensional analysis shows that the drag force depends on the particle's diameter, velocity,...
264
Correlation and Regression00:53

Correlation and Regression

1.4K
In statistics, correlation describes the degree of association between two variables. In the subfield of linear regression, correlation is mathematically expressed by the correlation coefficient, which describes the strength and direction of the relationship between two variables. The coefficient is symbolically represented by 'r' and ranges from -1 to +1. A positive value indicates a positive correlation where the two variables move in the same direction. A negative value suggests a...
1.4K
Coefficient of Correlation01:12

Coefficient of Correlation

6.3K
The correlation coefficient, r, developed by Karl Pearson in the early 1900s, is numerical and provides a measure of strength and direction of the linear association between the independent variable x and the dependent variable y.
If you suspect a linear relationship between x and y, then r can measure how strong the linear relationship is.
What the VALUE of r tells us:
The value of r is always between –1 and +1: –1 ≤ r ≤ 1.
The size of the correlation r indicates the...
6.3K

You might also read

Related Articles

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

Sort by
Same author

Comparison of Ultrasound Corticomedullary Strain with Doppler Parameters in Assessment of Renal Allograft Interstitial Fibrosis/Tubular Atrophy.

Ultrasound in medicine & biology·2015
Same author

[Responses of soil microbial carbon metabolism to the leaf litter composition in Liaohe River Nature Reserve of northern Hebei Province, China].

Ying yong sheng tai xue bao = The journal of applied ecology·2015
Same author

Hydrogen Sulfide Prevents Synaptic Plasticity from VD-Induced Damage via Akt/GSK-3β Pathway and Notch Signaling Pathway in Rats.

Molecular neurobiology·2015
Same author

Continuous-wave yellow-green laser at 0.56  μm based on frequency doubling of a diode-end-pumped ceramic Nd:YAG laser.

Applied optics·2015
Same author

Anti-tumor effect of emodin on gynecological cancer cells.

Cellular oncology (Dordrecht, Netherlands)·2015
Same author

Cytological and proteomic analyses of horsetail (Equisetum arvense L.) spore germination.

Frontiers in plant science·2015

Related Experiment Video

Updated: Aug 23, 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

7.0K

Robust large-scale clustering based on correntropy.

Guodong Jin1, Jing Gao1, Lining Tan1

  • 1Rocket Force Engineering University, Xian, Shannxi, China.

Plos One
|November 4, 2022
PubMed
Summary

A new robust large-scale clustering algorithm (RLSCC) efficiently handles noisy, large datasets. It combines k-means and spectral clustering with correntropy for improved accuracy and speed.

Area of Science:

  • Data Science
  • Machine Learning
  • Artificial Intelligence

Background:

  • The exponential growth of data necessitates efficient clustering methods for large-scale unlabeled datasets.
  • Real-world data often contains complex noise and outliers, challenging traditional clustering algorithms.
  • Robustness and efficiency are critical for large-scale clustering in practical applications.

Purpose of the Study:

  • To propose a robust large-scale clustering algorithm (RLSCC) that addresses the challenges of noisy and large datasets.
  • To enhance the efficiency and robustness of clustering by integrating k-means, spectral clustering, and correntropy.
  • To maintain or improve clustering effectiveness while significantly reducing computational complexity.

Main Methods:

  • RLSCC utilizes k-means for initial pseudo-label generation, reducing data scale for spectral clustering.

More Related Videos

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.4K
Analyzing Tumor Gene Expression Factors with the CorExplorer Web Portal
08:00

Analyzing Tumor Gene Expression Factors with the CorExplorer Web Portal

Published on: October 11, 2019

7.6K

Related Experiment Videos

Last Updated: Aug 23, 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

7.0K
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.4K
Analyzing Tumor Gene Expression Factors with the CorExplorer Web Portal
08:00

Analyzing Tumor Gene Expression Factors with the CorExplorer Web Portal

Published on: October 11, 2019

7.6K
  • Anchor graphs replace full sample graphs in spectral clustering for improved efficiency.
  • Correntropy is employed to mitigate the impact of noise and outliers, enhancing robustness.

    • Main Results:

    • RLSCC demonstrates significant improvements in efficiency and robustness compared to state-of-the-art algorithms.
    • The algorithm maintains comparable or superior clustering effectiveness on real-world and noisy datasets.
    • Experimental results validate the proposed method's performance on large-scale and complex data.

    Conclusions:

    • RLSCC offers an effective solution for robust large-scale clustering of real-world data.
    • The integration of k-means, spectral clustering, and correntropy provides a powerful and efficient approach.
    • The proposed algorithm significantly advances the field of large-scale data clustering.