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

7.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...
7.1K
Cluster Sampling Method01:20

Cluster Sampling Method

15.2K
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...
15.2K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.2K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
18.2K
Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

282
The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...
282
Definition of Laplace Transform01:22

Definition of Laplace Transform

4.9K
The Laplace transform is an indispensable mathematical technique for simplifying the resolution of differential equations by converting them into more manageable algebraic expressions. The Laplace transform of a function is denoted by L[x(t)], where x(t) is the time-domain function. The laplace transform is mathematically expressed as
4.9K
Graphs of Polar Equations01:17

Graphs of Polar Equations

368
The polar coordinate system represents points using a distance from a central point (the pole) and an angle from a reference direction (the polar axis). Unlike rectangular coordinates, polar coordinates are ideal for graphing curves with radial symmetry or periodic behavior.Some general forms of graphs in polar coordinates include the following:Equation of a Circle (Centered at the Pole):A graph where the radius remains constant for all angles traces a circle centered at the pole:Equation of a...
368

You might also read

Related Articles

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

Sort by
Same author

Unsupervised feature selection via row-sparse local preserving projection.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Projection with mixed-size anchor graphs.

Neural networks : the official journal of the International Neural Network Society·2026
Same author

SimMTC: Simple Multi-View Tensor Clustering.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Multi-Level Collaborative Distillation Meets Global Workspace Model: A Unified Framework for OCIL.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Unsupervised fine-tuning of vision-language models by fusing classifier tuning and visual prompt tuning.

Neural networks : the official journal of the International Neural Network Society·2026
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Related Experiment Video

Updated: Mar 1, 2026

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.4K

A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering.

De Cheng1, Feiping Nie2, Jiande Sun3

  • 1Institute of Artificial Intelligence and Robotic, Xi'an Jiaotong University, Xi'an 710049, China chengde19881214@stu.xitu.edu.cn.

Neural Computation
|June 1, 2017
PubMed
Summary
This summary is machine-generated.

This study introduces a novel weight adaptive Laplacian (WAL) method to improve graph-based clustering by adaptively adjusting the data graph. This approach enhances clustering accuracy, especially when initial graph construction is suboptimal.

More Related Videos

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K
Electroencephalography Network Indices as Biomarkers of Upper Limb Impairment in Chronic Stroke
06:37

Electroencephalography Network Indices as Biomarkers of Upper Limb Impairment in Chronic Stroke

Published on: July 14, 2023

1.4K

Related Experiment Videos

Last Updated: Mar 1, 2026

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.4K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K
Electroencephalography Network Indices as Biomarkers of Upper Limb Impairment in Chronic Stroke
06:37

Electroencephalography Network Indices as Biomarkers of Upper Limb Impairment in Chronic Stroke

Published on: July 14, 2023

1.4K

Area of Science:

  • Computer Science
  • Data Science
  • Machine Learning

Background:

  • Graph-based clustering relies on fixed data graphs, making results sensitive to initial graph construction quality.
  • Suboptimal graph construction can lead to poor clustering outcomes.

Purpose of the Study:

  • To address the limitations of fixed graph structures in clustering.
  • To develop a method that adaptively adjusts the data graph during the clustering process.

Main Methods:

  • Proposed a weight adaptive Laplacian (WAL) method to learn an adaptive data similarity matrix.
  • Developed three WAL variants using L2-norm, fuzzy entropy regularizer, and an exponential-based weight strategy.
  • Derived optimization algorithms for the new graph-based clustering objectives.

Main Results:

  • Experimental results demonstrate the effectiveness of the proposed WAL methods.
  • The methods show improved clustering performance on synthetic and real-world datasets.

Conclusions:

  • The WAL method offers a robust solution for enhancing graph-based clustering by enabling adaptive graph adjustment.
  • This adaptive approach improves clustering quality and reliability.