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

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
Rapidly Varying Flow01:24

Rapidly Varying Flow

329
Rapidly varying flow (RVF) in open channels is characterized by abrupt changes in flow depth over a short distance, with the rate of depth change relative to distance often approaching unity. These flows are inherently complex due to their transient and multi-dimensional nature, making exact analysis difficult. However, approximate solutions using simplified models provide valuable insights into their behavior.Key Features of Rapidly Varying FlowRVF is commonly observed in scenarios involving...
329
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

361
To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
361
Gradually Varying Flow01:29

Gradually Varying Flow

318
Gradually varying flow (GVF) in open channels describes situations where water depth changes slowly along the channel due to factors like non-uniform bed slope, channel shape variations, or obstructions. This flow type occurs when the depth adjusts gradually to balance gravitational forces, shear forces, and energy requirements, resulting in a low rate of depth change.Characteristics of Gradually Varying FlowGVF is commonly observed in natural streams, rivers, and canals, where flow depth...
318
Sampling Continuous Time Signal01:11

Sampling Continuous Time Signal

593
In signal processing, a continuous-time signal can be sampled using an impulse-train sampling technique, followed by the zero-order hold method. Impulse-train sampling involves the use of a periodic impulse train, which consists of a series of delta functions spaced at regular intervals determined by the sampling period. When a continuous-time signal is multiplied by this impulse train, it generates impulses with amplitudes corresponding to the signal's values at the sampling points.
In the...
593
Uniform Depth Channel Flow01:27

Uniform Depth Channel Flow

447
Uniform depth channel flow keeps fluid depth consistent along channels such as irrigation canals. In natural channels, such as rivers, approximate uniform flow is often assumed. This condition occurs when the channel’s bottom slope matches the energy slope, balancing potential energy lost from gravity with head loss due to shear stress. This balance prevents depth changes along the channel length, resulting in a steady, uniform flow.Uniform flow in open channels with a constant cross-section...
447

You might also read

Related Articles

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

Sort by
Same author

Correction: Abushark et al. Optimized Adaboost Support Vector Machine-Based Encryption for Securing IoT-Cloud Healthcare Data. <i>Sensors</i> 2025, <i>25</i>, 731.

Sensors (Basel, Switzerland)·2026
Same author

A Lightweight Intrusion Detection System for Internet of Things: Clustering and Monte Carlo Cross-Entropy Approach.

Sensors (Basel, Switzerland)·2025
Same author

Optimized Adaboost Support Vector Machine-Based Encryption for Securing IoT-Cloud Healthcare Data.

Sensors (Basel, Switzerland)·2025
Same author

A Novel COVID-19 Diagnostic System Using Biosensor Incorporated Artificial Intelligence Technique.

Diagnostics (Basel, Switzerland)·2023
Same author

Managing Security of Healthcare Data for a Modern Healthcare System.

Sensors (Basel, Switzerland)·2023
Same author

Analysis of the Exploration of Security and Privacy for Healthcare Management Using Artificial Intelligence: Saudi Hospitals.

Computational intelligence and neuroscience·2022

Related Experiment Video

Updated: Dec 18, 2025

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms
08:36

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms

Published on: March 21, 2019

7.6K

Incremental Interval Type-2 Fuzzy Clustering of Data Streams using Single Pass Method.

Sana Qaiyum1, Izzatdin Aziz1, Mohd Hilmi Hasan1

  • 1Center for Research in Data Sciences, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Perak, Malaysia.

Sensors (Basel, Switzerland)
|June 11, 2020
PubMed
Summary
This summary is machine-generated.

This study introduces an incremental Interval Type-2 Fuzzy C-Means with Ant Colony Optimization (IT2FCM-ACO) for efficient data stream clustering. The enhanced algorithm handles large datasets and evolving data, improving performance and speed.

Keywords:
ant colony optimizationdata streamincremental learninginterval type-2 fuzzy c-means

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

11.8K
Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection
08:01

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection

Published on: December 15, 2015

7.8K

Related Experiment Videos

Last Updated: Dec 18, 2025

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms
08:36

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms

Published on: March 21, 2019

7.6K
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
Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection
08:01

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection

Published on: December 15, 2015

7.8K

Area of Science:

  • Data Science
  • Artificial Intelligence
  • Machine Learning

Background:

  • Interval Type-2 Fuzzy C-Means (IT2FCM) is sensitive to initialization, often failing to find global optima.
  • Optimizing IT2FCM with Ant Colony Optimization (IT2FCM-ACO) addresses initialization issues but struggles with large, evolving data streams.
  • Existing methods are unsuitable for continuous, large-scale streaming data due to memory and processing limitations.

Purpose of the Study:

  • To propose an incremental IT2FCM-ACO algorithm for efficient clustering of large data streams.
  • To address the challenges of memory constraints and evolving data in streaming environments.
  • To improve the scalability and performance of fuzzy clustering for big data.

Main Methods:

  • An incremental approach is proposed, processing data in batches to determine cluster centers.
  • Cluster centroids are updated iteratively with new incoming data points.
  • Previous data points are released from memory to reduce time and space complexity.

Main Results:

  • The incremental IT2FCM-ACO produces data partitions comparable to the standard IT2FCM-ACO.
  • The proposed method demonstrates enhanced performance over other clustering algorithms on large, real-life datasets.
  • Significant improvements in run time and excellent speed-ups were observed across all tested datasets.

Conclusions:

  • The incremental IT2FCM-ACO effectively handles large data streams and evolving data patterns.
  • The algorithm offers a scalable and efficient solution for fuzzy clustering in big data environments.
  • The proposed method provides a robust alternative to existing clustering techniques for data streams.