Clustering algorithm based on graph connectivity

Information Processing Letters

Volumn 76, Issue 4-6, 2000, Pages 175-181

  Hartuv, Erez ^a   Shamir, Ron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; POLYNOMIALS;

CLUSTER ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0034515528     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00142-3     Document Type: Article

References (22)

1. Anderberg M.R. Cluster Analysis for Applications. 1973;Academic Press, New York.
2. Buckley F., Harary F. Distance in Graphs. 1990;Addison-Wesley, Reading, MA.
3. Even S. Graph Algorithms. 1979;Computer Science Press, Potomac, MD.
4. Gomory R.E., Hu T.C. Multy-terminal networks flows. SIAM J. Appl. Math. Vol. 9:1961;551-570.
5. Hansen P., Jaumard B. Cluster analysis and mathematical programming. Math. Programming. Vol. 79:1997;191-215.
6. Hartigan J.A. Clustering Algorithms. 1975;John Wiley and Sons, New York.
7. Hartuv E. Cluster analysis by highly connected subgraphs with applications to cDNA clustering. Master's Thesis:August 1998;Department of Computer Science, Tel Aviv University.
8. Hartuv E., Schmitt A., Lange J., Meier-Ewert S., Lehrach H., Shamir R. An algorithm for clustering cDNAs for gene expression analysis using short oligonucleotide fingerprints. Proc. 3rd International Symposium on Computational Molecular Biology (RECOMB'99). April 1999;188-197.
9. Hartuv E., Schmitt A., Lange J., Meier-Ewert S., Lehrach H., Shamir R. An algorithm for clustering cDNA fingerprints. Genomics. Vol. 66:(3):2000;249-256.
10. Jardine N., Sibson R. Mathematical Taxonomy. 1971;John Wiley and Sons, London.
11. Karger D. Minimum cuts in near-linear time. Proc. STOC'96. 1996;ACM Press, New York.
12. Matula D.W. The cohesive strength of graphs. Chartrand G., Kapoor S.F. The Many Facets of Graph Theory. Lecture Notes in Math. Vol. 110:1969;215-221 Springer, Berlin.
13. Matula D.W. Cluster analysis via graph theoretic techniques. Mullin R.C., Reid K.B., Roselle D.P. Proc. Louisiana Conference on Combinatorics, Graph Theory and Computing. 1970;199-212 University of Manitoba, Winnipeg.
14. Matula D.W. k -Components, clusters and slicings in graphs. SIAM J. Appl. Math. Vol. 22:(3):1972;459-480.
15. Matula D.W. Graph theoretic techniques for cluster analysis algorithms. van Ryzin J. Classification and Clustering. 1977;95-129 Academic Press, New York.
16. Matula D.W. Determining edge connectivity in O(nm). Proc. 28th IEEE Symposium on Foundations of Computer Science. 1987;249-251.
17. Milosavljevic A., Strezoska Z., Zeremski M., Grujic D., Paunesku T., Crkvenjakov R. Clone clustering by hybridization. Genomics. Vol. 27:1995;83-89.
18. Mirkin B. Mathematical Classification and Clustering. 1996;Kluwer, Dordrecht.
19. Nagamochi H., Ibaraki T. Computing edge connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. Vol. 5:1992;54-66.
20. Sneath P.H.A., Sokal R.R. Numerical Taxonomy. 1973;Freeman, San Francisco.
21. Sokal R.R. Clustering and classification: Background and current directions. Classification and Clustering. 1977;1-15 Academic Press, New York.
22. Wu Z., Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Analysis Machine Intelligence. Vol. 15:(11):1993;1101-1113.