Incremental Beta Distribution Weighted Fuzzy C-Ordered Means Clustering

Streaming data is becoming more and more common in the field of big data and incremental frameworks can address its complexity. The BDFCOM algorithm achieves good results on common form datasets by introducing the ordering mechanism of beta distribution weighting. In this paper, based on the BDFCOM algorithm, two incremental beta distribution weighted fuzzy C-ordered means clustering algorithms, SPBDFCOM and OBDFCOM, are proposed by combining the two incremental frameworks of Single-Pass and Online, respectively. In order to validate the performance of SPBDFCOM and OBDFCOM, this paper selects seven real datasets for experiments and compares their performance with six other incremental clustering algorithms using six evaluation metrics. The results show that the two proposed incremental algorithms perform significantly better compared to other algorithms.

Authors

Institutions

Publication Details

Journal
Information
Published
2025-08-03
DOI
https://doi.org/10.3390/info16080663
Citations
1
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Incremental Beta Distribution Weighted Fuzzy C-Ordered Means Clustering

Hengda Wang, Muhammad Syafiq Mohd Pozi, Mohamad Farhan Mohamad Mohsin, Zhoumo Zeng
1 citations
Information
Advanced Clustering Algorithms Research
2.48
article

Incremental Beta Distribution Weighted Fuzzy C-Ordered Means Clustering

Hengda Wang, Muhammad Syafiq Mohd Pozi, Mohamad Farhan Mohamad Mohsin, Zhoumo Zeng
article en
1 citations

Abstract

Streaming data is becoming more and more common in the field of big data and incremental frameworks can address its complexity. The BDFCOM algorithm achieves good results on common form datasets by introducing the ordering mechanism of beta distribution weighting. In this paper, based on the BDFCOM algorithm, two incremental beta distribution weighted fuzzy C-ordered means clustering algorithms, SPBDFCOM and OBDFCOM, are proposed by combining the two incremental frameworks of Single-Pass and Online, respectively. In order to validate the performance of SPBDFCOM and OBDFCOM, this paper selects seven real datasets for experiments and compares their performance with six other incremental clustering algorithms using six evaluation metrics. The results show that the two proposed incremental algorithms perform significantly better compared to other algorithms.

InformationVol. 16(8)
Chongqing University (CN), Northern University of Malaysia (MY)
Openalex Percentile: Top 9%
Advanced Clustering Algorithms Research
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Incremental Beta Distribution Weighted Fuzzy C-Ordered Means Clustering — Hengda Wang, Muhammad Syafiq Mohd Pozi, et al. · Information (2025) | TGRS Research Map | TGRS