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

Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Dot Product: Problem Solving01:21

Dot Product: Problem Solving

The dot product is a powerful tool in problem-solving involving vectors, given that the dot product of two vectors is the product of their magnitudes and the cosine of the angle between them measured anti-clockwise. Solving problems involving the dot product requires understanding its properties and developing a step-by-step process to solve them. Here are the main steps to follow when solving any general problem involving the dot product:
Identify the problem: Start by reading the problem and...
Cluster Sampling Method01:20

Cluster Sampling Method

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...
Area Computation by the Alternative Coordinate Method01:24

Area Computation by the Alternative Coordinate Method

The alternative coordinate method, also known as the Shoelace Formula, is a technique for determining the area of a traverse using Cartesian coordinates. This method relies on the sequential arrangement of x and y coordinates for each point of the shape, ensuring accuracy and ease of application.In this approach, each corner's x and y coordinates are listed as fractions, with the x-coordinate as the numerator and the y-coordinate as the denominator. These coordinates are arranged sequentially...
Distance Problem01:29

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...
State Function, Exact and Inexact Differentials01:27

State Function, Exact and Inexact Differentials

A state function is a thermodynamic property that depends solely on the current state of a system, irrespective of its history or how it arrived at that state. These functions are represented by capital letters, such as U, H, and S, which stand for internal energy, enthalpy, and entropy, respectively.For instance, the value of internal energy depends on the system's state variables and remains unaffected by the process path. This means that whether the system underwent a linear process or a...

You might also read

Related Articles

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

Sort by
Same author

Markov chain stochastic DCA and applications in deep learning with PDEs regularization.

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

Online Stochastic DCA With Applications to Principal Component Analysis.

IEEE transactions on neural networks and learning systems·2022
Same author

Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression.

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

Online Learning Based on Online DCA and Application to Online Classification.

Neural computation·2020
Same author

Group variable selection via ℓ<sub>p,0</sub> regularization and application to optimal scoring.

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

Sparse Covariance Matrix Estimation by DCA-Based Algorithms.

Neural computation·2017
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: May 10, 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

Block clustering based on difference of convex functions (DC) programming and DC algorithms.

Hoai Minh Le1, Hoai An Le Thi, Tao Pham Dinh

  • 1Laboratory of Theoretical and Applied Computer Science, University of Lorraine, 57045 Metz, France. minh.le@univ-lorraine.fr

Neural Computation
|June 20, 2013
PubMed
Summary
This summary is machine-generated.

We introduce a novel approach using difference of convex functions (DC) programming and the DC algorithm (DCA) to efficiently solve the challenging block clustering problem. This method demonstrates superior performance compared to existing algorithms.

More Related Videos

Super-resolution Imaging of Neuronal Dense-core Vesicles
09:30

Super-resolution Imaging of Neuronal Dense-core Vesicles

Published on: July 2, 2014

Related Experiment Videos

Last Updated: May 10, 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

Super-resolution Imaging of Neuronal Dense-core Vesicles
09:30

Super-resolution Imaging of Neuronal Dense-core Vesicles

Published on: July 2, 2014

Area of Science:

  • Optimization
  • Machine Learning
  • Data Mining

Background:

  • Block clustering is a complex combinatorial optimization problem.
  • Existing methods like two-mode K-means and EM algorithms have limitations.

Purpose of the Study:

  • To develop an efficient algorithm for block clustering using DC programming.
  • To adapt DC programming and the DC algorithm for continuous block clustering.

Main Methods:

  • Difference of Convex Functions (DC) programming and the DC algorithm (DCA).
  • DC reformulation techniques and exact penalty methods.
  • Development of an explicit DCA scheme for the block clustering problem.

Main Results:

  • The proposed DC programming approach effectively solves the block clustering problem.
  • Computational experiments confirm the algorithm's robustness and efficiency.
  • The DCA-based method outperforms standard algorithms like two-mode K-means, fuzzy clustering, and block classification EM.

Conclusions:

  • DC programming offers a powerful framework for addressing complex optimization problems like block clustering.
  • The developed DCA scheme provides an elegant and efficient solution.
  • This approach represents a significant advancement over traditional block clustering methods.