Min-sum Clustering of Protein Sequences with Limited Distance Information

  • Konstantin Voevodski
  • Maria-Florina Balcan
  • Heiko Röglin
  • Shang-Hua Teng
  • Yu Xia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7005)

Abstract

We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and must query them during the execution of the algorithm. Our goal is to find an accurate clustering using few queries. We model the problem as a point set S with an unknown metric d on S, and assume that we have access to one versus all distance queries that given a point s ∈ S return the distances between s and all other points. Our one versus all query represents an efficient sequence database search program such as BLAST, which compares an input sequence to an entire data set. Given a natural assumption about the approximation stability of the min-sum objective function for clustering, we design a provably accurate clustering algorithm that uses few one versus all queries. In our empirical study we show that our method compares favorably to well-established clustering algorithms when we compare computationally derived clusterings to gold-standard manual classifications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AGK+04]
    Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3) (2004)Google Scholar
  2. [AGM+90]
    Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215(3), 403–410 (1990)CrossRefGoogle Scholar
  3. [AJM09]
    Ailon, N., Jaiswal, R., Monteleoni, C.: Streaming k-means approximation. In: Proc. of 23rd Conference on Neural Information Processing Systems, NIPS (2009)Google Scholar
  4. [AV07]
    Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proc. of 18th ACM-SIAM Symp. on Discrete Algorithms, SODA (2007)Google Scholar
  5. [BBG09]
    Balcan, M.F., Blum, A., Gupta, A.: Approximate clustering without the approximation. In: Proc. of 20th ACM-SIAM Symp. on Discrete Algorithms, SODA (2009)Google Scholar
  6. [BCR01]
    Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum k-clustering in metric spaces. In: Proc. of 33rd ACM Symp. on Theory of Computing, STOC (2001)Google Scholar
  7. [CS07]
    Czumaj, A., Sohler, C.: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2), 226–256 (2007)MathSciNetCrossRefMATHGoogle Scholar
  8. [FMT+10]
    Finn, R.D., Mistry, J., Tate, J., Coggill, P., Heger, A., Pollington, J.E., Gavin, O.L., Gunesekaran, P., Ceric, G., Forslund, K., Holm, L., Sonnhammer, E.L., Eddy, S.R., Bateman, A.: The pfam protein families database. Nucleic Acids Res. 38, D211–D222 (2010)CrossRefGoogle Scholar
  9. [Kle03]
    Kleinberg, J.: An impossibility theorem for clustering. In: Proc. of 17th Conference on Neural Information Processing Systems, NIPS (2003)Google Scholar
  10. [MBHC95]
    Murzin, A.G., Brenner, S.E., Hubbard, T., Chothia, C.: Scop: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol. 247, 536–540 (1995)Google Scholar
  11. [MOP01]
    Mishra, N., Oblinger, D., Pitt, L.: Sublinear time approximate clustering. In: Proc. of 12th ACM-SIAM Symp. on Discrete Algorithms, SODA (2001)Google Scholar
  12. [PCS06]
    Paccanaro, A., Casbon, J.A., Saqi, M.A.S.: Spectral clustering of protein sequences. Nucleic Acids Res. 34(5), 1571–1580 (2006)CrossRefGoogle Scholar
  13. [VBR+10]
    Voevodski, K., Balcan, M.F., Röglin, H., Teng, S., Xia, Y.: Efficient clustering with limited distance information. In: Proc. of 26th Conference on Uncertainty in Artifcial Intelligence, UAI (2010)Google Scholar
  14. [ZBD09]
    Zadeh, R.B., Ben-David, S.: A uniqueness theorem for clustering. In: Proc. of 25th Conference on Uncertainty in Artifcial Intelligence, UAI (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Konstantin Voevodski
    • 1
  • Maria-Florina Balcan
    • 2
  • Heiko Röglin
    • 3
  • Shang-Hua Teng
    • 4
  • Yu Xia
    • 5
  1. 1.Department of Computer ScienceBoston UniversityBostonUSA
  2. 2.College of ComputingGeorgia Institute of TechnologyAtlantaUSA
  3. 3.Department of Computer ScienceUniversity of BonnBonnGermany
  4. 4.Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  5. 5.Bioinformatics Program and Department of ChemistryBoston UniversityBostonUSA

Personalised recommendations