On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “CLARANS”

Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithmscs.LG

Improved k-medoids clustering with faster algorithms for big data.

problem High runtime cost of k-medoids clustering algorithms.

method Modifications to PAM, CLARA, and CLARANS algorithms to achieve O(k) runtime improvement.

result 458x and 1191x speedup in runtime for k=100,200 respectively.

k-medoids clustering PAM CLARA CLARANS

2020-08-12abs ↗pdf ↗

Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithmscs.LG

Clustering non-Euclidean data is difficult, and one of the most used algorithms besides hierarchical clustering is the popular algorithm Partitioning Around Medoids (PAM), also simply referred to as k-medoids. In Euclidean geometry the mean-as used in k-means-is a good estimator for the cluster center, but this does no…

2018-10-12abs ↗pdf ↗