252 citations
- Yahoo (United States)US11 papers
- Yahoo (Spain)ES8 papers
- Telefonica Research and DevelopmentES7 papers
- IBM (United States)US4 papers
- University of CambridgeGB4 papers
- Cornell UniversityUS3 papers
- Johns Hopkins UniversityUS3 papers
- Microsoft (United States)US3 papers
- University of ChicagoUS3 papers
- Columbia UniversityUS2 papers
- Georgia Institute of TechnologyUS2 papers
- Google (United States)US2 papers
5 papers · 1 filter
An Algorithm for Online K-Means Clustering
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
This paper shows that one can be competitive with the k-means objective while operating online. In this model, the algorithm receives vectors v_1,...,v_n one by one in an arbitrary…
Consistent Collective Matrix Completion under Joint Low Rank Structure
Suriya Gunasekar, Makoto Yamada, Dawei Yin +1
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations. To ensur…
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits
Branislav Kveton, Zheng Wen, Azin Ashkan +1
A stochastic combinatorial semi-bandit is an online learning problem where at each step a learning agent chooses a subset of ground items subject to constraints, and then observes…
Semi-Streaming Algorithms for Annotated Graph Streams
Justin Thaler
Considerable effort has been devoted to the development of streaming algorithms for analyzing massive graphs. Unfortunately, many results have been negative, establishing that a wi…
Scalable Online Betweenness Centrality in Evolving Graphs
Nicolas Kourtellis, Gianmarco De Francisci Morales, Francesco Bonchi
Betweenness centrality is a classic measure that quantifies the importance of a graph element (vertex or edge) according to the fraction of shortest paths passing through it. This…