Active clustering data streams with affinity propagation
Most existing applications have a large number of evolving data streams. Clustering data streams is still a critical problem for these applications as the data are evolving and changes over time. Most existing algorithms are unsupervised learning in which background information is useless. This pape...
Main Authors: | Sameh Abdulah, Ph.D., Walid Atwa, Ph.D., Ahmed M. Abdelmoniem, Ph.D. |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2022-06-01
|
Series: | ICT Express |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2405959521001077 |
Similar Items
-
K-MEAP: Generating Specified K Clusters with Multiple Exemplars by Efficient Affinity Propagation
by: Wang, Yangtao, et al.
Published: (2016) -
A Novel Approach for Cognitive Clustering of Parkinsonisms through Affinity Propagation
by: Alessia Sarica, et al.
Published: (2021-02-01) -
A Survey on Multi-Label Data Stream Classification
by: Xiulin Zheng, et al.
Published: (2020-01-01) -
AFFINITY PROPAGATION AND K-MEANS ALGORITHM FOR DOCUMENT CLUSTERING BASED ON SEMANTIC SIMILARITY
by: Avan A. Mustafa, et al.
Published: (2023-04-01) -
Affinity Propagation Clustering Using Path Based Similarity
by: Yuan Jiang, et al.
Published: (2016-07-01)