Reconciliation k-median: Clustering with Non-polarized Representatives-Reference-Cited by-同舟云学术

Reconciliation k-median: Clustering with Non-polarized Representatives

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:The World Wide Web Conference on - WWW '19
language:
Short-container-title:

Author:

Ordozgoiti Bruno¹,Gionis Aristides²

Affiliation:

1. Universidad PolitÃ©cnica de Madrid, Spain

2. Aalto University, Finland

Publisher

ACM Press

Reference26 articles.

1. Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward. 2017. Better guarantees for k-means and Euclidean k-median by primal-dual algorithms. In Proceedings of the 58th Annual Symposium on Foundations of Computer Science (FOCS). 61-72.

2. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, and Vinayaka Pandit. 2004. Local search heuristics for k-median and facility location problems. SIAM Journal on computing 33, 3 (2004), 544-562.

3. Eytan Bakshy, Solomon Messing, and Lada A Adamic. 2015. Exposure to ideologically diverse news and opinion on Facebook. Science 348, 6239 (2015), 1130-1132.

4. Pablo Barberá. 2014. Birds of the same feather tweet together: Bayesian ideal point estimation using Twitter data. Political Analysis 23, 1 (2014), 76-91.

5. Mikhail Belkin and Partha Niyogi. 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in neural information processing systems. 585-591.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. k-Clustering with Fair Outliers;Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining;2022-02-11

2. Visualizing Structural Balance in Signed Networks;Complex Networks and Their Applications VIII;2019-11-25