A rigorous analysis of population stratification with limited data

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1046-1055

  Chaudhuri, Kamalika ^a   Halperin, Eran ^b   Rao, Satish ^a   Zhou, Shuheng ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVEX OPTIMIZATION; DISEASES; GENES; GENETIC PROGRAMMING; POLYNOMIAL APPROXIMATION; POPULATION STATISTICS; PROBABILITY DISTRIBUTIONS; VECTORS;

CLUSTERING PROBLEMS; COMBINATORIAL ALGORITHM; CONNECTED COMPONENT; GENETIC INFORMATION; INTERNATIONAL COMMUNITY; POLYNOMIAL-TIME ALGORITHMS; POPULATION STRATIFICATION; POPULATION STRUCTURES;

CLUSTERING ALGORITHMS;

EID: 84919924184     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In Proceedings of the 18th Annual Conference on Learning Theory, pages 458-469, 2005.
2. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proceedings of 37th ACM Symposium on Theory of Computing, pages 684-693, 2005.
3. S. Arora and R. Kannan. Learning mixtures of arbitrary gaussians. In Proceedings of 33rd ACM Symposium on Theory of Computing, pages 247-257, 2001.
4. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In Proceedings of the 43th IEEE Symposium on Foundations of Computer Science, pages 238-247, 2002.
5. R. Boppana. Eigenvalues and graph bisection: An average case analysis. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 280-285, 1987.
6. John Canny. Collaborative flltering with privacy via factor analysis. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pages 238-245, 2002.
7. Ted Carson and Russell Impagliazzo. Hill-climbing finds random planted bisections. In Proceedings of SODA 2001, 2001.
8. Moses Charikar, Venkatesan Guruswami, and Anthony Wirth. Clustering with qualitative information. In FOCS, pages 524-533, 2003.
9. Anne Condon and Richard M. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):116-140, 2001.
10. A. Dasgupta, J. Hopcroft, J. Kleinberg, and M. Sandler. On learning mixtures of heavy-tailed distributions. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, pages 491-500, 2005.
11. S. Dasgupta. Learning mixtures of gaussians. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 634-644, 1999.
12. Mark Jerrum and Gregory Sorkin. Simulated annealing for graph bisection. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 94-103, 1993.
13. J. Kleinberg and M. Sandler. Convergent algorithms for collaborative flltering. In Proc. 4th ACM Conference on Electronic Commerce, 2003.
14. J. Kleinberg and M. Sandler. Using mixture models for collaborative flltering. In Proceedings of the 36th ACM Symposium on Theory of computing, pages 569-578, 2004.
15. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. Recommendation systems: A probabilistic analysis. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pages 664-673, 1998.
16. Frank McSherry. Spectral partitioning of random graphs. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 529-537, 2001.
17. A. Panconesi and D. Dubhashi. Concentration of measure for the analysis of randomised algorithms. Draft.
18. Alkes L. Price, Nick J. Patterson, Robert M. Plenge, Michael E. Weinblatt, Nancy A. Shadick, and David Reich. Principal components analysis corrects for stratification in genome-wide association studies. Nature Genetics, 38(8):904-909, July 2006.
19. J. K. Pritchard, M. Stephens, and P. Donnelly. Inference of population structure using multilocus genotype data. Genetics, 155:954-959, June 2000.
20. Dekel Tsur Ron Shamir, Roded Sharan. Cluster graph modification problems. In Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 379-390, 2002.
21. C. Swamy. Correlation clustering: maximizing agreements via semidefinite programming. In Proceedings of SODA, 2004.
22. V. Vempala and G. Wang. A spectral algorithm of learning mixtures of distributions. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 113-123, 2002.
23. Shuheng Zhou. Routing, Disjoint Paths and Classification. PhD thesis, Carnegie Mellon University, 2006. CMU-PDL-06-109.