Andrea Vattani
Artificial Intelligence · 2008–2012
A researcher in the Science corpus: 2 papers; trusts 6 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 15 citations into it
- Signal Processing — 12 citations into it
- Computer Vision and Pattern Recognition — 11 citations into it; #20,676 of 21,575 by trust here, #20,271 by citations
Whom Andrea Vattani trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andrea Vattani overall
Papers from Andrea Vattani's perspective
Ordered by how strongly the researchers Andrea Vattani 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)
- A local search approximation algorithm for k-means clustering (SCG '02)
- Data clustering: a review
- Clustering Data Streams: Theory and Practice
- 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)
- How slow is the k-means method? (SCG '06)
- BIRCH: an efficient data clustering method for very large databases
- A model of computation for MapReduce (ACM-SIAM Symposium on Discrete Algorithms)
Their papers
- k-means Requires Exponentially Many Iterations Even in the Plane (2008) — 307 citations
- Scalable K-Means++ (2012) — 741 citations