GitPlanet

Cheap and reliable Node.js hosting starts at $3/month, and $1/month static HTML hosting

Created with love in Canada, visit hostnodejs.com today

Feel like to post an Ad? Learn Details
All Projects → SachinKalsi → kmedoids

SachinKalsi / kmedoids

Licence: other
The Partitioning Around Medoids (PAM) implementation of the K-Medoids algorithm in Python [Unmaintained]

Programming Languages

Jupyter Notebook
11667 projects
python
139335 projects - #7 most used programming language

Labels

machine-learningclusterpartitioningunsupervised-learningclusterskmedoids-clusteringmedoids

Projects that are alternatives of or similar to kmedoids

Kafka Monitor
Xinfra Monitor monitors the availability of Kafka clusters by producing synthetic workloads using end-to-end pipelines to obtain derived vital statistics - E2E latency, service produce/consume availability, offsets commit availability & latency, message loss rate and more.
Stars: ✭ 1,817 (+9994.44%)
Mutual labels:  cluster, clusters
Logi Kafkamanager
一站式Apache Kafka集群指标监控与运维管控平台
Stars: ✭ 3,280 (+18122.22%)
Mutual labels:  cluster, clusters
ring-election
A node js library with a distributed leader/follower algorithm ready to be used
Stars: ✭ 92 (+411.11%)
Mutual labels:  cluster, partitioning
Clustering Algorithms from Scratch
Implementing Clustering Algorithms from scratch in MATLAB and Python
Stars: ✭ 170 (+844.44%)
Mutual labels:  cluster, unsupervised-learning
deep learning
Deep-learning approaches to object recognition from 3D data
Stars: ✭ 19 (+5.56%)
Mutual labels:  unsupervised-learning
kubernetes-deployment
No description or website provided.
Stars: ✭ 15 (-16.67%)
Mutual labels:  cluster
deep-INFOMAX
Chainer implementation of deep-INFOMAX
Stars: ✭ 32 (+77.78%)
Mutual labels:  unsupervised-learning
BaySMM
Model for learning document embeddings along with their uncertainties
Stars: ✭ 25 (+38.89%)
Mutual labels:  unsupervised-learning
Similarity-Adaptive-Deep-Hashing
Unsupervised Deep Hashing with Similarity-Adaptive and Discrete Optimization (TPAMI2018)
Stars: ✭ 18 (+0%)
Mutual labels:  unsupervised-learning
kubernetes-marketplace
Marketplace of Kubernetes applications available for quick and easy installation in to Civo Kubernetes clusters
Stars: ✭ 136 (+655.56%)
Mutual labels:  cluster
ladder-vae-pytorch
Ladder Variational Autoencoders (LVAE) in PyTorch
Stars: ✭ 59 (+227.78%)
Mutual labels:  unsupervised-learning
treecut
Find nodes in hierarchical clustering that are statistically significant
Stars: ✭ 26 (+44.44%)
Mutual labels:  unsupervised-learning
Unsupervised-Learning-in-R
Workshop (6 hours): Clustering (Hdbscan, LCA, Hopach), dimension reduction (UMAP, GLRM), and anomaly detection (isolation forests).
Stars: ✭ 34 (+88.89%)
Mutual labels:  unsupervised-learning
al-fk-self-supervision
Official PyTorch code for CVPR 2020 paper "Deep Active Learning for Biased Datasets via Fisher Kernel Self-Supervision"
Stars: ✭ 28 (+55.56%)
Mutual labels:  unsupervised-learning
dti-sprites
(ICCV 2021) Code for "Unsupervised Layered Image Decomposition into Object Prototypes" paper
Stars: ✭ 33 (+83.33%)
Mutual labels:  unsupervised-learning
pacman.store
Pacman Mirror via IPFS for ArchLinux, Endeavouros and Manjaro
Stars: ✭ 65 (+261.11%)
Mutual labels:  cluster
docker-rabbitmq-ha-cluster
A docker stack to create, test and benchmark a rabbitmq cluster in high availability configuration. HAProxy, php workers, node failures, network partition, persistent messages.
Stars: ✭ 98 (+444.44%)
Mutual labels:  cluster
uctf
Unsupervised Controllable Text Generation (Applied to text Formalization)
Stars: ✭ 19 (+5.56%)
Mutual labels:  unsupervised-learning
AMapMarker-master
提供一种高德地图自定义marker的解决方案以及改善高德官方点聚合功能
Stars: ✭ 63 (+250%)
Mutual labels:  cluster
core
augejs is a progressive Node.js framework for building applications. https://github.com/augejs/augejs.github.io
Stars: ✭ 18 (+0%)
Mutual labels:  cluster
View All Similar Projects ➔

K-Medoids

K-Medoids is a clustering algorithm. Partitioning Around Medoids (PAM) algorithm is one such implementation of K-Medoids

Prerequisites

  • Scipy
  • Numpy

Getting Started

from KMedoids import KMedoids

Parameters

  • n_cluster: number of clusters
  • max_iter: maximum number of iterations
  • tol: tolerance level

Example

Wiki Example

data = [[2, 6], [3, 4], [3, 8], [4, 7], [6, 2], [6, 4], [7, 3], [7, 4], [8, 5], [7, 6]]
k_medoids = KMedoids(n_cluster=2)
k_medoids.fit(data)

Visualization

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].