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

Collisions in Multiple Dimensions: Problem Solving01:06

Collisions in Multiple Dimensions: Problem Solving

5.0K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
5.0K
Cluster Sampling Method01:20

Cluster Sampling Method

13.8K
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...
13.8K
Collisions in Multiple Dimensions: Introduction01:05

Collisions in Multiple Dimensions: Introduction

6.3K
It is far more common for collisions to occur in two dimensions; that is, the initial velocity vectors are neither parallel nor antiparallel to each other. Let's see what complications arise from this. The first idea is that momentum is a vector. Like all vectors, it can be expressed as a sum of perpendicular components (usually, though not always, an x-component and a y-component, and a z-component if necessary). Thus, when the statement of conservation of momentum is written for a...
6.3K
State Space Representation01:27

State Space Representation

438
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
438
Vesicular Tubular Clusters01:45

Vesicular Tubular Clusters

2.9K
After budding out from the ER membrane, some COPII vesicles lose their coat and fuse with one another to form larger vesicles and interconnected tubules called vesicular tubular clusters or VTCs. These clusters constitute a compartment at the ER-Golgi interface known as ERGIC (Endoplasmic Reticulum Golgi Intermediate Compartment). The ERGIC is a mobile membrane-bound cargo transport system that sorts proteins secreted from ER and delivers them to the Golgi.
With the help of motor proteins such...
2.9K
Multicompartment Models: Overview01:14

Multicompartment Models: Overview

411
Multicompartment models are mathematical constructs that depict how drugs are distributed and eliminated within the body. They segment the body into several compartments, symbolizing various physiological or anatomical areas connected through drug transfer processes such as absorption, metabolism, distribution, and elimination.
These models offer a more comprehensive representation of drug behavior in the body than one-compartment models. They accommodate the complexity of drug distribution,...
411

You might also read

Related Articles

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

Sort by
Same author

A neural network architecture for learning word-referent associations in multiple contexts.

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

Dimension selective self-organizing maps with time-varying structure for subspace and projected clustering.

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

Self-Organizing Map With Time-Varying Structure to Plan and Control Artificial Locomotion.

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

Modelling foraging ants in a dynamic and confined environment.

Bio Systems·2011
Same author

Path efficiency of ant foraging trails in an artificial network.

Journal of theoretical biology·2005
Same author

Modeling and production of robot trajectories using the Temporal Parametrized Self Organizing Maps.

International journal of neural systems·2003

Related Experiment Video

Updated: Dec 13, 2025

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

11.8K

Self-organizing subspace clustering for high-dimensional and multi-view data.

Aluizio F R Araújo1, Victor O Antonino1, Karina L Ponce-Guevara1

  • 1Centro de Informática, Universidade Federal de Pernambuco, 50740560, Recife, Brazil.

Neural Networks : the Official Journal of the International Neural Network Society
|July 26, 2020
PubMed
Summary

This study introduces a novel soft subspace clustering algorithm using a Self-organizing Map (SOM) with a dynamic structure. The method effectively clusters high-dimensional data without predefined parameters, outperforming existing approaches in various applications.

Keywords:
High-dimensional dataMulti-view clusteringSelf-organizing mapsSubspace clustering

More Related Videos

Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore
06:01

Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore

Published on: December 12, 2019

8.8K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.8K

Related Experiment Videos

Last Updated: Dec 13, 2025

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

11.8K
Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore
06:01

Visualization and Quantification of High-Dimensional Cytometry Data using Cytofast and the Upstream Clustering Methods FlowSOM and Cytosplore

Published on: December 12, 2019

8.8K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.8K

Area of Science:

  • Data Science
  • Machine Learning
  • Artificial Intelligence

Background:

  • Increasing data complexity and dimensionality pose challenges for traditional clustering methods.
  • Subspace clustering addresses the grouping of data points within a union of subspaces.
  • Existing subspace clustering algorithms often require prior knowledge of cluster numbers or network topology.

Purpose of the Study:

  • To introduce a novel soft subspace clustering algorithm.
  • To develop a Self-organizing Map (SOM) with a time-varying structure for adaptive clustering.
  • To enable clustering without prior knowledge of the number of categories or neural network topology.

Main Methods:

  • A soft subspace clustering algorithm based on a Self-organizing Map (SOM) with a time-varying structure.
  • The algorithm dynamically determines the number of categories and neural network topology during training.
  • Assigns relevancies (weights) to dimensions to capture their influence on cluster formation.

Main Results:

  • The algorithm demonstrates competitive performance across diverse high-dimensional datasets.
  • Effective in data mining, gene expression, multi-view, computer vision, and text clustering.
  • Consistently outperforms state-of-the-art subspace clustering methods in various contexts.

Conclusions:

  • The proposed soft subspace clustering algorithm offers a flexible and effective approach for high-dimensional data.
  • The dynamic nature of the SOM allows for adaptation to unknown data structures.
  • The method shows significant potential for advancing various data analysis and machine learning applications.