Active clustering of biological sequences

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 203-225

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

^a GOOGLE INC   (United States)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF BONN   (Germany)

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

^e Boston University   (United States)

Author keywords

Active clustering; Approximation algorithms; Approximation stability; Clustering; Clustering accuracy; K median; Protein sequences

Indexed keywords

ACTIVE CLUSTERING; CLUSTERING; CLUSTERING ACCURACY; K-MEDIAN; PROTEIN SEQUENCES;

APPROXIMATION ALGORITHMS;

SEARCH ENGINES;

EID: 84857556524     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. N. Ailon, R. Jaiswal, and C.Monteleoni. Streaming k-means approximation. In Advances in Neural Information Processing Systems, 2009.
2. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215(3):403-410, 1990.
3. D. Arthur and S. Vassilvitskii. K-means++: The advantages of careful seeding. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, 2007.
4. P. Awasthi, A. Blum, and O. Sheffet. Stability yields a PTAS for k-median and k-means clustering. In Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010.
5. M. Badoiu, S. Har-Peled, and P. Indyk. Approximate clustering via coresets. In Proceedings of the 34th ACM Symposium on Theory of Computing, 2002.
6. M. F. Balcan, A. Blum, and A. Gupta. Approximate clustering without the approximation. In Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, 2009.
7. S. Ben-David. A framework for statistical clustering with constant time approximation algorithms for k-median and k-means clustering. Machine Learning, 66(2-3):243-257, 2007. (Pubitemid 46360613)
8. S. E. Brenner, C. Chothia, and T. J. Hubbard. Assessing sequence comparison methods with reliable structurally identified distant evolutionary relationships. Proceedings of the National Academy of Sciences USA, 95(11):6073-6078, 1998. (Pubitemid 28248966)
9. K. Chaudhuri and S. Dasgupta. Rates of convergence for the cluster tree. In Advances in Neural Information Processing Systems, 2010.
10. D. Cheng, R. Kannan, S. Vempala, and G. Wang. A divide-and-merge methodology for clustering. ACM Transactions on Database Systems, 31(4):1499-1525, 2006. (Pubitemid 46103278)
11. A. Czumaj and C. Sohler. Sublinear-time approximation algorithms for clustering via random sampling. Random Structures and Algorithms, 30(1-2):226-256, 2007.
12. S. Dasgupta. Performance guarantees for hierarchical clustering. In Jyrki Kivinen and Robert Sloan, editors, Computational Learning Theory, volume 2375 of Lecture Notes in Computer Science, pages 235-254. Springer Berlin / Heidelberg, 2002.
13. B. Eriksson, G. Dasarathy, A. Singh, and R. Nowak. Active clustering: Robust and efficient hierarchical clustering using adaptively selected similarities. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, 2011.
14. C. Faloutsos and K. Lin. Fastmap: A fast algorithm for indexing, datamining and visualization of traditional and multimedia datasets. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995.
15. D. Feldman and M. Langberg. A unified framework for approximating and clustering data. In Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011.
16. 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 Research, 38:D211-222, 2010.
17. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.
18. A. Kumar, Y. Sabharwal, and S. Sen. Linear time algorithms for clustering problems in any dimensions. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, 2005.
19. N. Mishra, D. Oblinger, and L Pitt. Sublinear time approximate clustering. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
20. 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. Journal of Molecular Biology, 247:536-540, 1995.
21. R. Ostrovsky, Y. Rabani, L. J. Schulman, and C. Swamy. The effectiveness of Lloyd-type methods for the k-means problem. In Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, 2006.
22. A. Paccanaro, J. A. Casbon, and M. A. S. Saqi. Spectral clustering of protein sequences. Nucleic Acids Research, 34(5):1571-1580, 2006.
23. F. Schalekamp, M. Yu, and A. van Zuylen. Clustering with or without the approximation. In Proceedings of the 16th Annual International Computing and Combinatorics Conference, 2010.
24. L. Tang and M. Crovella. Virtual landmarks for the internet. In Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, 2003.
25. K. Voevodski, M. F. Balcan, H. Röglin, S. Teng, and Y. Xia. Min-sum clustering of protein sequences with limited distance information. In Proceedings of the 1st International Workshop on Similarity-Based Pattern Analysis and Recognition, 2011.
26. D. Wishart. Mode analysis: A generalization of nearest neighbor which reduces chaining effects. In Proceedings of the Colloquium on Numerical Taxonomy held in the University of St. Andrews, 1969.