Efficient clustering with limited distance information

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 632-640

  Voevodski, Konstantin ^a   Balcan, Maria Florina ^b   Röglin, Heiko ^c   Teng, Shang Hua ^d   Xia, Yu ^e  

^a BOSTON UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

^c MAASTRICHT UNIVERSITY   (Netherlands)

^d University of Southern California ^*  (United States)

^e Boston University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SEARCH ENGINES;

CLUSTERINGS; DISTANCE INFORMATION; EMPIRICAL STUDIES; K CLUSTER; MANUAL CLASSIFICATION; POINT SET; SEQUENCE DATABASE; SEQUENCE SIMILARITY;

QUERY PROCESSING;

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

References (10)

1. S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. J. Mol. Biol., 215(3):403-410, 1990.
2. D. Arthur and S. Vassilvitskii. k-means++: the advantages of careful seeding. In Proc. of 18th ACMSIAM Symp. on Discrete Algorithms (SODA), 2007.
3. M. F. Balcan, A. Blum, and A. Gupta. Approximate clustering without the approximation. In Proc. of 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2009.
4. S.E. Brenner, C. Chothia, and T.J. Hubbard. Assessing sequence comparison methods with reliable structurally identified distant evolutionary relationships. Proc. Natl. Acad. Sci. U S A, 95(11):6073-6078, 1998. (Pubitemid 28248966)
5. A. Czumaj and C. Sohler. Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms, 30(1-2):226-256, 2007.
6. R.D. Finn, J. Mistry, J. Tate, P. Coggill, A. Heger, J.E. Pollington, O.L. Gavin, P. Gunesekaran, G. Ceric, K. Forslund, L. Holm, E.L. Sonnhammer, S.R. Eddy, and A. Bateman. The pfam protein families database. Nucleic Acids Res., 38:D211-222, 2010.
7. N. Mishra, D. Oblinger, and L Pitt. Sublinear time approximate clustering. In Proc. of 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2001.
8. A.G. Murzin, S. E. Brenner, T. Hubbard, and C. Chothia. Scop: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol., 247:536-540, 1995.
9. R. Ostrovsky, Y. Rabani, L. J. Schulman, and C. Swamy. The effectiveness of lloyd-type methods for the k-means problem. In Proc. of 47th IEEE Symp. on Foundations of Computer Science (FOCS), 2006.
10. A. Paccanaro, J. A. Casbon, and M. A. S. Saqi. Spectral clustering of protein sequences. Nucleic Acids Res., 34(5):1571-1580, 2006.