Incremental affinity propagation clustering based on message passing
Affinity Propagation (AP) clustering has been successfully used in a lot of clustering
problems. However, most of the applications deal with static data. This paper considers how …
problems. However, most of the applications deal with static data. This paper considers how …
Incremental fuzzy clustering with multiple medoids for large data
As an important technique of data analysis, clustering plays an important role in finding the
underlying pattern structure embedded in unlabeled data. Clustering algorithms that need to …
underlying pattern structure embedded in unlabeled data. Clustering algorithms that need to …
Fuzzy based scalable clustering algorithms for handling big data using apache spark
A huge amount of digital data containing useful information, called Big Data, is generated
everyday. To mine such useful information, clustering is widely used data analysis …
everyday. To mine such useful information, clustering is widely used data analysis …
Incremental fuzzy C medoids clustering of time series data using dynamic time war** distance
Y Liu, J Chen, S Wu, Z Liu, H Chao - Plos one, 2018 - journals.plos.org
Clustering time series data is of great significance since it could extract meaningful statistics
and other characteristics. Especially in biomedical engineering, outstanding clustering …
and other characteristics. Especially in biomedical engineering, outstanding clustering …
Hyperplane division in fuzzy c-means: Clustering big data
Big data with a large number of observations (samples) have posed genuine challenges for
fuzzy clustering algorithms and fuzzy C-means (FCM), in particular. In this article, we …
fuzzy clustering algorithms and fuzzy C-means (FCM), in particular. In this article, we …
Convex fuzzy k-medoids clustering
K-medoids clustering is among the most popular methods for cluster analysis despite its use
requiring several assumptions about the nature of the latent clusters. In this paper, we …
requiring several assumptions about the nature of the latent clusters. In this paper, we …
A Distributed Higher-Order -Medoids Clustering Algorithm for Network Partition
Y Mo, R **ng, H Hou - IEEE Transactions on Network Science …, 2024 - ieeexplore.ieee.org
In this paper, we develop a distributed higher-order k-medoids clustering algorithm for
networks using hop count as the distance metric, typical examples include social networks …
networks using hop count as the distance metric, typical examples include social networks …
A fast weighted fuzzy C-medoids clustering for time series data based on P-splines
J Xu, Q Hou, K Qu, Y Sun, X Meng - Sensors, 2022 - mdpi.com
The rapid growth of digital information has produced massive amounts of time series data on
rich features and most time series data are noisy and contain some outlier samples, which …
rich features and most time series data are noisy and contain some outlier samples, which …
Tracking time evolving data streams for short-term traffic forecasting
Data streams have arisen as a relevant topic during the last few years as an efficient method
for extracting knowledge from big data. In the robust layered ensemble model (RLEM) …
for extracting knowledge from big data. In the robust layered ensemble model (RLEM) …
A hybrid and parameter-free clustering algorithm for large data sets
H Shao, P Zhang, X Chen, F Li, G Du - IEEE Access, 2019 - ieeexplore.ieee.org
As an important unsupervised learning method, clustering can find the hidden structures in
data effectively. With the amount of data grows larger, clustering of large data sets is a …
data effectively. With the amount of data grows larger, clustering of large data sets is a …