Aug. 31, 2022, 1:10 a.m. | É. O. Rodrigues, L. Torok, P. Liatsis, J. Viterbo, A. Conci

cs.LG updates on arXiv.org arxiv.org

This work proposes a clusterization algorithm called k-Morphological Sets
(k-MS), based on morphological reconstruction and heuristics. k-MS is faster
than the CPU-parallel k-Means in worst case scenarios and produces enhanced
visualizations of the dataset as well as very distinct clusterizations. It is
also faster than similar clusterization methods that are sensitive to density
and shapes such as Mitosis and TRICLUST. In addition, k-MS is deterministic and
has an intrinsic sense of maximal clusters that can be created for a given …

algorithm arxiv clustering clustering algorithm

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

IT Data Engineer

@ Procter & Gamble | BUCHAREST OFFICE

Data Engineer (w/m/d)

@ IONOS | Deutschland - Remote

Staff Data Science Engineer, SMAI

@ Micron Technology | Hyderabad - Phoenix Aquila, India

Academically & Intellectually Gifted Teacher (AIG - Elementary)

@ Wake County Public School System | Cary, NC, United States