David Arthur
Signal Processing · 2006–2007
A researcher in the Science corpus: 2 papers; trusts 9 researchers and is trusted by 225 researchers here, as inferred from the citation graph.
Subfields
- Signal Processing — 7 citations into it
- Artificial Intelligence — 5 citations into it; #20,114 of 35,345 by trust here, #25,040 by citations
- Computational Theory and Mathematics — 5 citations into it
Whom David Arthur trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Adam Meyerson
- Daniel A. Spielman
- Rafail M. Ostrovsky
- Shang-Hua Teng
- Sergei Vassilvitskii
- Pavel Berkhin
- Tapas Kanungo
- Yuval Rabani
- Sariel Har-Peled
- Leonard J. Schulman
Who trusts David Arthur overall
- Mario Lucic
- Zhishuai Zhang
- Andrea Vattani
- Olivier Bachem
- Shaosheng Cao
- Renwei Dian
- Alan L. Yuille
- P. Hanrahan
- Uri Stemmer
- Bahman Bahmani
Papers from David Arthur's perspective
Ordered by how strongly the researchers David Arthur trusts endorse each paper. Same corpus, a different order for every researcher.
- Least squares quantization in PCM
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (Symposium on the Theory of Computing)
- Online facility location (Proceedings IEEE International Conference on Cluster Computing)
- On coresets for k-means and k-median clustering
- Clustering Large Graphs via the Singular Value Decomposition (Machine-mediated learning)
- A local search approximation algorithm for k-means clustering (SCG '02)
- Clustering Data Streams: Theory and Practice
- Pattern classification, 2nd Edition
- A Survey of Clustering Data Mining Techniques
- The Effectiveness of Lloyd-Type Methods for the k-Means Problem (IEEE Annual Symposium on Foundations of Computer Science)
Their papers
- k-means++: the advantages of careful seeding (2007) — 10,497 citations
- How slow is the k-means method? (2006) — 416 citations