2012 Ninth Web Information Systems and Applications Conference 2012
DOI: 10.1109/wisa.2012.47
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Space Optimized Bisecting K-Means (BKM) Based on Hadoop

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…To extend k-means-based Algorithms for evolving data streams with a variable number of 'k', de Andrade Silva and Hruschka [36] describe an algorithmic framework that enables the automatic estimation of 'k' based on the data. The authors applied three state-of-the-art algorithms for clustering data streams -Stream LSearch [37], CluStream [38], and Stream KM++ [39] combined with two well-known algorithms for estimating the number of centroids 'k', namely: Ordered Multiple Runs of k-means [40] and Bisecting k-means [41].…”
Section: E Hyperparameter Tuning Approachesmentioning
confidence: 99%
“…To extend k-means-based Algorithms for evolving data streams with a variable number of 'k', de Andrade Silva and Hruschka [36] describe an algorithmic framework that enables the automatic estimation of 'k' based on the data. The authors applied three state-of-the-art algorithms for clustering data streams -Stream LSearch [37], CluStream [38], and Stream KM++ [39] combined with two well-known algorithms for estimating the number of centroids 'k', namely: Ordered Multiple Runs of k-means [40] and Bisecting k-means [41].…”
Section: E Hyperparameter Tuning Approachesmentioning
confidence: 99%