Clustering based on rank distance with applications on DNA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7667 LNCS, Issue PART 5, 2012, Pages 722-729

  Dinu, Liviu Petrisor ^a   Ionescu, Radu Tudor ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

hierarchical clustering; k means; rank distance

Indexed keywords

CLUSTERING METHODS; DISTANCE MEASURE; HIER-ARCHICAL CLUSTERING; K-MEANS; K-MEANS ALGORITHM; MEAN VECTOR; MITOCHONDRIAL DNA; RANK DISTANCE;

DATA PROCESSING;

CLUSTERING ALGORITHMS;

EID: 84869046655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34500-5_85     Document Type: Conference Paper

References (13)

1. Diaconis, P., Graham, R.L.: Spearman footrule as a measure of disarray. Journal of Royal Statistical Society. Series B (Methodological) 39(2), 262-268 (1977)
2. Dinu, L.P.: On the classification and aggregation of hierarchies with different constitutive elements. Fundamenta Informaticae 55(1), 39-50 (2003)
3. Dinu, L.P., Ionescu, R.T.: An efficient rank based approach for closest string and closest substring. PLoS ONE 7(6), e37576 (June 2012)
4. Dinu, L.P., Manea, F.: An efficient approach for the rank aggregation problem. Theoretical Computer Science 359(1-3), 455-461 (2006)
5. Dinu, L.P., Popa, A.: On the Closest String via Rank Distance. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 413-426. Springer, Heidelberg (2012)
6. Dinu, L.P., Sgarro, A.: A Low-complexity Distance for DNA Strings. Fundamenta Informaticae 73(3), 361-372 (2006)
7. Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining Knowledge Discovery 2(3), 283-304 (1998)
8. McCallum, A., Nigam, K., Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. In: Proceedings of ACM SIGKDD, pp. 169-178 (2000)
9. Palmer, J., Herbon, L.: Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. Journal of Molecular Evolution 28, 87-89 (1988)
10. Reyes, A., Gissi, C., Pesole, G., Catzeflis, F.M., Saccone, C.: Where do rodents fit? evidence from the complete mitochondrial genome of sciurus vulgaris. Mol. Biol. Evol. 17(6), 979-983 (2000)
11. Selim, S.Z., Ismail, M.A.: K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-6(1), 81-87 (1984)
12. Smith, T.,Waterman, M.: Comparison of biosequences. Advances in Applied Mathematics 2(4), 482-489 (1981)
13. Tian, T.Z., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. SIGMOD Rec. 25(2), 103-114 (1996)