Related Experiment Video
Updated: Sep 4, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
Published on: January 16, 2019
Linear Fuzzy Information-Granule-Based Fuzzy C-Means Algorithm for Clustering Time Series
Abstract:
This article aims to design a trend-oriented-granulation-based fuzzy C -means (FCM) algorithm that can cluster a group of time series at an abstract (granular) level. To achieve a better trend-oriented granulation of a time series, l1 trend filtering is firstly carried out to result in segments which are then optimized by the proposed segment merging algorithm. By constructing a linear fuzzy information granule (LFIG) on each segment, a granular time series which well reflects the linear trend characteristic of the original time series is produced. With the novel designed distance that can well measure the trend similarity of two LFIGs, the distance between two granular time series is calculated by the modified dynamic time warping (DTW) algorithm. Based on this distance, the LFIG-based FCM algorithm is developed for clustering time series. In this algorithm, cluster prototypes are iteratively updated by the specifically designed granule splitting and merging algorithm, which allows the lengths of prototypes to change in the process of iteration. This overcomes the serious drawback of the existing approaches, where the lengths of prototypes cannot be changed. Experimental studies demonstrate the superior performance of the proposed algorithm in clustering time series with different shapes or trends.
More Related Videos
12:27Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
08:59Determination of Aggregate Surface Morphology at the Interfacial Transition Zone ITZ
Published on: December 16, 2019
Related Concept Videos
Cluster Sampling Method
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...
Time-Series Graph
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
End Point Prediction: Gran Plot
For potentiometric titration, the Gran plot is created by plotting...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....