2017
DOI: 10.1080/09720502.2017.1386476
|View full text |Cite
|
Sign up to set email alerts
|

User clustering based on Canopy+K-means algorithm in cloud computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Thus, centroids are calculated for these subsets. This technique speeds up the processing of large datasets and shows great efficiency and efficacy (Tong, 2017; Xia, Ning, & He, 2020; Zhang, Zhang, & Zhang, 2018).…”
Section: Clustering Techniques Reviewmentioning
confidence: 99%
“…Thus, centroids are calculated for these subsets. This technique speeds up the processing of large datasets and shows great efficiency and efficacy (Tong, 2017; Xia, Ning, & He, 2020; Zhang, Zhang, & Zhang, 2018).…”
Section: Clustering Techniques Reviewmentioning
confidence: 99%
“…Then, the Canopy algorithm and the KMC were executed in parallel form to cluster the text data. The T1 and T2 values of the Canopy algorithm were set through cross-validation [22,23]. The Canopy algorithm was called to pre-cluster the preprocessed text data, producing the initial cluster centers.…”
Section: The Wck-means Text Clustering Algorithmmentioning
confidence: 99%