I have a big array of data. I want to create clusters with equal sizes, no matter what quantity of clusters is. I use SMILE library for this. What clustering method should I use or how can I implement clustering with equal sizes of clusters.
How to create clusters with equal sizes
1.8k Views Asked by Nane Petrosyan At
1
There are 1 best solutions below
Related Questions in CLUSTER-ANALYSIS
- Delay in loading Html Page(WebView) from assets folder in real android device
- MPAndroidChart method setWordWrapEnabled() not found
- Designing a 'new post' android activity
- Android :EditText inside ListView always update first item in the listview
- Android: Transferring Data via ContentIntent
- Wrong xml being inflated android
- AsyncTask Class
- Unable to receive extras in Android Intent
- Website zoomed out on Android default browser
- Square FloatingActionButton with Android Design Library
Related Questions in SMILE
- Delay in loading Html Page(WebView) from assets folder in real android device
- MPAndroidChart method setWordWrapEnabled() not found
- Designing a 'new post' android activity
- Android :EditText inside ListView always update first item in the listview
- Android: Transferring Data via ContentIntent
- Wrong xml being inflated android
- AsyncTask Class
- Unable to receive extras in Android Intent
- Website zoomed out on Android default browser
- Square FloatingActionButton with Android Design Library
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
There are a few discussions on this topic.
https://elki-project.github.io/tutorial/same-size_k_means
Group n points in k clusters of equal size
K-means algorithm variation with equal cluster size
Also, check out Affinity Propagation and DBSCAN. Both are great alternatives to the very popular K-Means algo, and both find the optimal number of clusters automatically, unlike K-Means.
https://hdbscan.readthedocs.io/en/latest/comparing_clustering_algorithms.html
I'm not saying that these will give you clusters of equal sizes, but it's good to know about these other alternatives, and using these methodologies is are probably more practical than forcing clusters to have an equal number of data points. Clustering is an unsupervised type of analysis. It seems like forcing clusters to have equal sizes of results is somewhat of a forced method, and almost supervised, which it is not designed to be.