crispy.scms#
Subspace Constrained Mean Shift (SCMS) algorithm for density ridge estimation.
This module provides functions to identify density ridges in high-dimensional data using the SCMS algorithm, including support for parallel computation and filtering to improve efficiency. Core functionalities include walker initialization, Gaussian kernel evaluation, ridge-shifting processes, and multiprocessing utilities.
Functions
Divide data into chunks for multiprocessing. |
|
Compute the Euclidean distances and differences between data points and walkers. |
|
Identify density ridges in data using the Subspace Constrained Mean Shift (SCMS) algorithm. |
|
Shift walkers toward density ridges using the Subspace Constrained Mean Shift (SCMS) algorithm. |
|
Shift walkers towards density ridges using the SCMS algorithm with multiprocessing. |
|
Shift walkers towards density ridges using the Subspace Constrained Mean Shift (SCMS) algorithm. |
|
Compute Gaussian kernel values for data points relative to walker positions. |
|
Compute weighted Gaussian values for data points relative to walker positions, filtering out distant points to optimize computation. |
|
Compute weighted Gaussian values for data points relative to walker positions in parallel, filtering out distant points to optimize computation. |