All Questions
Tagged with online-algorithms k-means
8 questions
1
vote
2
answers
776
views
Streaming k-means
I want to perform something like streaming/online/out-of-core kmeans clustering on large data.
Here is simple idea:
Break all data into N chunks.
Read from disk 1st chunk and calculate centroids ...
- 82.8k
0
votes
0
answers
245
views
Streaming K-medoids
Mahout, Hadoop machine learning library, contains an implementation of Streaming K-means algorithm that is based on the following paperworks The Effectiveness of Lloyd-Type Methods for the k-Means ...
- 82.8k
4
votes
5
answers
6k
views
is K-Means clustering suited to real time applications?
I want to segment a sequence of RGB images (basically it's a video) based on their colors in real time. KMeans is an easy and intuitive algorithm to use in this case, but it's execution time is very ...
- 82.8k
1
vote
1
answer
2k
views
How come Mini Batch K means partial_fit method be useful for stream clustering?
Currently, I'm studying the advance in cluster analysis regarding stream clustering. I ended up assessing Mini batch K means because of some comments I read on the Internet, like the following one:
...
- 107
7
votes
3
answers
976
views
Online clustering
I'm trying to build a K-means clustering system with 'online learing', that is, there are existing K clusters and data points in them, and periodically there is a new data point that is sent to an ...
- 1,168
1
vote
1
answer
5k
views
Explain streaming k-means [closed]
I need to cluster 22 million vectors, each of which has a dimension of 1024. Can anyone explain streaming k-means to me?
CommunityBot
- 1
3
votes
2
answers
574
views
Incremental hierarchical clustering
I have an online k-means algorithm following this scheme:
...
- 131
2
votes
0
answers
10k
views
Distance threshold for clustering
Usually online clustering methods (based on kmeans or not) define a distance threshold value. If a new data-point $x$ is far enough from the nearest center $c$ (i.e. the distance from $x$ to $c$ is ...
CommunityBot
- 1