all AI news
Distributed k-Means with Outliers in General Metrics. (arXiv:2202.08173v1 [cs.DC])
Feb. 17, 2022, 8:11 a.m. | Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci
cs.LG updates on arXiv.org arxiv.org
Center-based clustering is a pivotal primitive for unsupervised learning and
data analysis. A popular variant is undoubtedly the k-means problem, which,
given a set $P$ of points from a metric space and a parameter $k<|P|$, requires
to determine a subset $S$ of $k$ centers minimizing the sum of all squared
distances of points in $P$ from their closest center. A more general
formulation, known as k-means with $z$ outliers, introduced to deal with noisy
datasets, features a further parameter $z$ …
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Senior Marketing Data Analyst
@ Amazon.com | Amsterdam, North Holland, NLD
Senior Data Analyst
@ MoneyLion | Kuala Lumpur, Kuala Lumpur, Malaysia
Data Management Specialist - Office of the CDO - Chase- Associate
@ JPMorgan Chase & Co. | LONDON, LONDON, United Kingdom
BI Data Analyst
@ Nedbank | Johannesburg, ZA
Head of Data Science and Artificial Intelligence (m/f/d)
@ Project A Ventures | Munich, Germany
Senior Data Scientist - GenAI
@ Roche | Hyderabad RSS