15 citations · 15 across the 4 of their papers we have counts for
5 papers
A New Impossibility Result for Online Bipartite Matching Problems
Flavio Chierichetti, Mirko Giacchini, Alessandro Panconesi +1
Online Bipartite Matching with random user arrival is a fundamental problem in the online advertisement ecosystem. Over the last 30 years, many algorithms and impossibility results…
FeelsGoodMan: Inferring Semantics of Twitch Neologisms
Pavel Dolin, Luc d'Hauthuille, Andrea Vattani
Twitch chats pose a unique problem in natural language understanding due to a large presence of neologisms, specifically emotes. There are a total of 8.06 million emotes, over 400k…
Scalable K-Means++
Bahman Bahmani, Benjamin Moseley, Andrea Vattani +2
Over half a century old and showing no signs of aging, k-means remains one of the most popular data processing algorithms. As is well-known, a proper initialization of k-means is c…
Learning Mixtures of Gaussians using the k-means Algorithm
Kamalika Chaudhuri, Sanjoy Dasgupta, Andrea Vattani
One of the most popular algorithms for clustering in Euclidean space is the -means algorithm; -means is difficult to analyze mathematically, and few theoretical guarantees ar…
k-means requires exponentially many iterations even in the plane
Andrea Vattani
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice.…